Tagged “algorithm”
-
Understanding Tabulation and Dynamic Programming with the Knapsack Problem in JavaScript
Transitioning from exponential recursion to bottom-up 2D and 1D tabulation arrays for the 0/1 Knapsack optimization problem in JavaScript. -
Building Fast Autocomplete Search with a Prefix Trie in JavaScript
Implementing a character-by-character Prefix Trie in JavaScript for O(L) dictionary lookup and instant typeahead suggestions. -
Resolving Task Dependencies with Topological Sort in JavaScript
Ordering directed acyclic graphs and detecting circular dependencies in build pipelines using Kahns algorithm in JavaScript. -
Designing an O(1) Least Recently Used Cache with JavaScript Map
Leveraging the insertion-order guarantee of ES6 Map to build a constant-time O(1) LRU cache without a separate doubly linked list. -
Finding Shortest Paths in Weighted Graphs with Dijkstras Algorithm in JavaScript
Implementing a priority queue and Dijkstras greedy relaxation algorithm to compute optimal routes in weighted JavaScript graphs. -
Building and Reversing Singly Linked Lists in JavaScript
Implementing pointer-based node insertion deletion cycle detection and in-place reversal for singly linked lists in JavaScript. -
Solving Subarray Problems with the Sliding Window Pattern in JavaScript
Reducing nested O(n^2) array loops to linear O(n) time complexity using fixed and dynamic sliding windows in JavaScript. -
Implementing Quicksort and In-Place Partitioning in JavaScript
Understanding divide-and-conquer sorting pivot selection strategies and O(n log n) average time complexity with Quicksort in JavaScript. -
Graph Traversal with Breadth-First and Depth-First Search in JavaScript
Exploring DOM trees and adjacency graphs in JavaScript with clean iterative and recursive implementations of BFS and DFS. -
Divide and Conquer Sorting with Merge Sort in JavaScript
While elementary sorting algorithms like Bubble Sort degrade to quadratic O(n^2) time on large datasets, Merge Sort uses a recursive divide-and-conquer strategy to guarantee O(n log n) performance across best, average, and worst-case inputs. -
Implementing Binary Search in JavaScript with Logarithmic Complexity
Scanning an unsorted array element by element with indexOf or find takes O(n) linear time. When working with a sorted dataset, Binary Search repeatedly halves the search interval on every comparison to locate any target in O(log n) logarithmic time. -
Optimizing Recursive Functions with Memoization in JavaScript
Naive recursive algorithms like the Fibonacci sequence recalculate the exact same subproblems thousands of times, leading to exponential O(2^n) time complexity. Caching previous results with memoization drops execution time to linear O(n). -
Shallow vs Deep Cloning Objects in JavaScript
Assigning an object to a new variable in JavaScript copies only its memory reference, causing accidental state mutations across components. Understanding the difference between shallow copying with Object.assign or spread syntax and recursive deep cloning prevents subtle bugs. -
Mastering Array Map Filter and Reduce in JavaScript
Imperative for loops that mutate external arrays often hide the true intent of your data transformations. Chaining JavaScript functional array methods map, filter, and reduce lets you express complex data pipelines in clean, declarative steps. -
Implementing Debounce and Throttle in Vanilla JavaScript
Attaching heavy DOM operations or network requests directly to scroll, resize, or keyup events can quickly freeze the browser main thread. Implementing debounce and throttle in vanilla JavaScript lets you control execution frequency using closures and timers. -
Solving Sieve Of Eratosthenes
the Sieve of Eratosthenes algorithm is known for fining all prime numbers up to a given number, so for example if we were give the number 20 we must return an array of all prime numbers found from 0 to 20. -
Two sum algorithm in Javascript
Two sum Algorithm will take in an array and a given number and will check of all pairs of number in the array that will adds up and equals the given number, So keep in mind that result will be an array of arrays. -
Mean Median Mode Algorithm
The Mean Median Mode Algorithm will take in a numeric array and return an object with Mean Median Mode of all the numbers in the array, you will learn some math calculation technique and functional programming, which means that you will break down your ... -
Reverse words algorithm in Javascript
The reverse words algorithm is pretty easy and straight forward to implement, it will improve your critical thinking skills, the idea is to reverse each word in a given sentence, but keep in mind on every word in the string should be reversed. -
Caesar cipher encryption in Javascript
The caesar cipher is an encryption technique where we shift every letter in a given string by a given number for example the word Car would become Dbs if we shifted the letter by 1 and if we test the word Zoo it become 'App' notice that the letter Z shifted to A. -
Check for palindromes with Javascript
A palindrome is a word, phrase, number, or other sequence of characters which reads the same backward or forward, For example the term race car is a palindrome because it spells out the same term whether it is written forward or if it is written backward. -
Implement Harmless Ransom Note
The harmless ransom note is simply a note made of words cut out from a magazine text, Imagine that a kidnapper wants to write a ransom note and he doesn't want it to be handwritten and be traced back to him so he got a magazine and cuts off a whole word and use them to create an untraceable replica of his ransom note. -
Solving Fizz Buzz Using Javascript
Fizz Buzz is a common interview question where a program should print numbers from 1 to 20 but for multiples of 3 it will print Fizz instead of that number and for the multiples of five print Buzz and print FizzBuzz for the numbers which is multiple of 3 and 5 at the same time.
See all tags.