Segment Tree - with min/max/sum range queries examples

Bit Manipulation - set/get/update/clear bits, multiplication/division by two, make negative etc.

Binary Floating Point - binary representation of the floating-point numbers.

Fibonacci Number - classic and closed-form versions

Prime Factors - finding prime factors and counting them using Hardy-Ramanujan's theorem

Euclidean Algorithm - calculate the Greatest Common Divisor (GCD)

Sieve of Eratosthenes - finding all prime numbers up to any given limit

Is Power of Two - check if the number is power of two (naive and bitwise algorithms)

Complex Number - complex numbers and basic operations with them

Radian & Degree - radians to degree and backwards conversion

Matrices - matrices and basic matrix operations (multiplication, transposition, etc.)

Euclidean Distance - distance between two points/vectors/matrices

Liu Hui π Algorithm - approximate π calculations based on N-gons

Discrete Fourier Transform - decompose a function of time (a signal) into the frequencies that make it up

Cartesian Product - product of multiple sets

Fisher–Yates Shuffle - random permutation of a finite sequence

Power Set - all subsets of a set (bitwise and backtracking solutions)

Permutations (with and without repetitions)

Combinations (with and without repetitions)

Knapsack Problem - "0/1" and "Unbound" ones

Maximum Subarray - "Brute Force" and "Dynamic Programming" (Kadane's) versions

Combination Sum - find all combinations that form specific sum

Hamming Distance - number of positions at which the symbols are different

Palindrome - check if the string is the same in reverse

Levenshtein Distance - minimum edit distance between two sequences

Knuth–Morris–Pratt Algorithm (KMP Algorithm) - substring search (pattern matching)

Z Algorithm - substring search (pattern matching)

Jump Search (or Block Search) - search in sorted array

Interpolation Search - search in uniformly distributed sorted array

Quicksort - in-place and non-in-place implementations

Kruskal’s Algorithm - finding Minimum Spanning Tree (MST) for weighted undirected graph

Dijkstra Algorithm - finding the shortest paths to all graph vertices from single vertex

Bellman-Ford Algorithm - finding the shortest paths to all graph vertices from single vertex

Floyd-Warshall Algorithm - find the shortest paths between all pairs of vertices

Detect Cycle - for both directed and undirected graphs (DFS and Disjoint Set based versions)

Prim’s Algorithm - finding Minimum Spanning Tree (MST) for weighted undirected graph

Articulation Points - Tarjan's algorithm (DFS based)

Eulerian Path and Eulerian Circuit - Fleury's algorithm - Visit every edge exactly once

Hamiltonian Cycle - Visit every vertex exactly once

Strongly Connected Components - Kosaraju's algorithm

Travelling Salesman Problem - shortest possible route that visits each city and returns to the origin city

Polynomial Hash - rolling hash function based on polynomial

Rail Fence Cipher - a transposition cipher algorithm for encoding messages

Caesar Cipher - simple substitution cipher

Hill Cipher - substitution cipher based on linear algebra

NanoNeuron - 7 simple JS functions that illustrate how machines can actually learn (forward/backward propagation)

k-NN - k-nearest neighbors classification algorithm

Seam Carving - content-aware image resizing algorithm

Weighted Random - select the random item from the list based on items' weights

Genetic algorithm - example of how the genetic algorithm may be applied for training the self-parking cars

Square Matrix Rotation - in-place algorithm

Jump Game - backtracking, dynamic programming (top-down + bottom-up) and greedy examples

Unique Paths - backtracking, dynamic programming and Pascal's Triangle based examples

- look at all the possibilities and selects the best solution

Rain Terraces - trapping rain water problem

Recursive Staircase - count the number of ways to reach to the top

- choose the best option at the current time, without any consideration for the future

Dijkstra Algorithm - finding the shortest path to all graph vertices

- divide the problem into smaller parts and then solve those parts

Matrices - generating and traversing the matrices of different shapes

Best Time To Buy Sell Stocks - divide and conquer and one-pass examples

- build up a solution using previously found sub-solutions

Bellman-Ford Algorithm - finding the shortest path to all graph vertices

- similarly to brute force, try to generate all possible solutions, but each time you generate next solution you test
if it satisfies all conditions, and only then continue generating subsequent solutions. Otherwise, backtrack, and go on a
different path of finding a solution. Normally the DFS traversal of state-space is being used.

- remember the lowest-cost solution found at each stage of the backtracking
search, and use the cost of the lowest-cost solution found so far as a lower bound on the cost of
a least-cost solution to the problem, in order to discard partial solutions with costs larger than the
lowest-cost solution found so far. Normally BFS traversal in combination with DFS traversal of state-space
tree is being used.

Repository of JAVASCRIPT ALGORITHMS Resources in December 2022

Select category under javascript-algorithms projects and apps that you are looking to build in December 2022

Last Updated: 29 November 2022

Repository of javascript algorithms Resources

Subscribe to our Newsletter

Company

Follow Us

Subscribe to our Newsletter