undefined
Knapsack
+2
Backtracking
Subarray Sum
Sudoku Solver
+1
N Queens
Generate Parentheses
N Queens All Solution Optimised
Minimax
Graph Coloring
Rat Maze
Nqueen Print All Solutions
Knight Tour
Magic Sequence
Subset Sum
Wildcard Matching
Subset Sum
Bit Manipulation
Power of 2
Find Non Repeating Number
Travelling Salesman Using Bit Manipulation
Count Bits Flip
Set Kth Bit
Count of Set Bits
Count of Trailing Ciphers in Factorial N
Blockchain
Modular Division
Ciphers
Caesar Cipher
Vigenere Cipher
XOR Cipher
+2
A 1z 26 Cipher
Hill Cipher
Elliptic Curve Key Exchange
Base 64 Encoding
Uint 256 T
Uint 128 T
Atbash Cipher
Morse Code
Compression
Huffman
Conversions
CPU Scheduling Algorithms
Fcfs Scheduling
Data Structures
Prime
+7
Prime
+7
Fenwick Tree
Lowest Common Ancestor
Queue Using Two Stacks
Dsu Union Rank
Queue Using Linked List
Trie Tree
Disjoint Set
Tree 234
Trie Using Hashmap
Reverse a Linked List
Node
Circular Queue Using Linked List
Binary Search Tree 2
Queue Using Array
Linkedlist Implentation Usingarray
Dsu Path Compression
Linked List
+1
List Array
Stack Using Array
Queue
+1
Doubly Linked List
+3
Binaryheap
Skip List
Stack
+2
Morrisinorder
Main Cll
Cll
Cll
Tree
Bloom Filter
Segment Tree
+3
Rb Tree
Binary Search Tree
+3
AVL Tree
+2
Trie Modern
Stack Using Queue
Stack with Singly Linked List
+3
Queue Using Array 2
Queue Using Linked List
Postfix Evaluation
Circular Linked List
Divide and Conquer
Dynamic Programming
Catalan Numbers
Cut Rod
Egg Dropping Puzzle
Maximum Circular Subarray
Fibonacci Bottom Up
Longest Increasing Subsequence
Edit Distance
+1
0 1 Knapsack
Searching of Element in Dynamic Array
Word Break
Palindrome Partitioning
Longest Common Subsequence
+1
Kadane 2
Longest Increasing Subsequence (Nlogn)
Abbreviation
Kadane
Floyd Warshall
+2
House Robber
Minimum Edit Distance
Longest Common String
Tree Height
Coin Change
+4
Shortest Common Supersequence
Partition Problem
Coin Change Topdown
Matrix Chain Multiplication
Longest Palindromic Subsequence
Geometry
Graphics
Spirograph
Graphs
Cycle Check Directed Graph
Bridge Finding with Tarjan Algorithm
Prim
Hopcroft Karp
Connected Components
Topological Sort by Kahns Algo
Is Graph Bipartite
Kosaraju
Hamiltons Cycle
Max Flow with Ford Fulkerson and Edmond Karp Algo
Depth First Search with Stack
Depth First Search
+4
Travelling Salesman Problem
Breadth First Search
+3
Is Graph Bipartite 2
Kruskal
Bi Directional Dijkstra
Dijkstra
+2
Connected Components with Dsu
Dijkstra
+2
Bellman Ford
+2
Greedy Algorithms
Boruvkas Minimum Spanning Tree
Jumpgame
Kruskals Minimum Spanning Tree
Prims Minimum Spanning Tree
Hashing
Double Hash Hash Table
Chaining
Md 5
Sha 1
Quadratic Probing Hash Table
Linear Probing Hash Table
Machine Learning
Kohonen Som Trace
Kohonen Som Topology
Adaline Learning
Vector Ops
K Nearest Neighbors
Ordinary Least Squares Regressor
A Star Search
Neural Network
Math
Check Factorial
Extended Euclid Algorithm
Euler's Totient
+1
Armstrong Number
+7
Double Factorial
Fibonacci Large
Binomial Calculate
Quadratic Equations Complex Numbers
Finding Number of Digits in a Number
Aliquot Sum
+3
Vector Cross Product
Fibonacci Fast
Sum of Digits
+1
Realtime Stats
Sum of Binomial Coefficient
Primes up to Billion
Sieve of Eratosthenes
+4
Binary Exponent
Integral Approximation
N Bonacci
Gcd Recursive Euclidean
Modular Exponentiation
Linear Recurrence Matrix
Ncr Modulo P
Fibonacci Sum
Sqrt Double
Large Number
Gcd of N Numbers
Approximate Pi
Fibonacci Numbers
+10
Modular Inverse Simple
Volume
Power of Two
String Fibonacci
Perimeter
Integral Approximation 2
Factorial
+11
Modular Inverse Fermat Little Theorem
Eratosthenes
N Choose R
Gcd Iterative Euclidean
LCM
+2
Prime Factorization
Magic Number
Check Amicable Pair
Complex Numbers
Least Common Multiple
Number of Positive Divisors
Miller Rabin
Fibonacci Matrix Exponentiation
Inv Sqrt
Power for Huge Numbers
Fast Power
Largest Power
Area
Large Factorial
Matrix Exponentiation
Qr Decomposition
Bisection Method
Runge Kutta
Armstrong Number
+7
Matrix
Numerical Analysis
Numerical Methods
Inverse Fast Fourier Transform
False Position
Gram Schmidt
Babylonian Method
Qr Eigen Values
Golden Search Extrema
Qr Decompose
Ode Forward Euler
Lu Decompose
Newton Raphson Method
Fast Fourier Transform
Midpoint Integral Method
Successive Approximation
Ode Semi Implicit Euler
Composite Simpson Rule
Durand Kerner Roots
Ode Midpoint Euler
Brent Method Extrema
Operations on Datastructures
Selectionsortlinkedlist
Array Right Rotation
Union of Two Arrays
Get Size of Linked List
Reverse Binary Tree
Array Left Rotation
Circular Queue Using Array
Intersection of Two Arrays
Trie Multiple Search
Reverse a Linked List Using Recusion
Inorder Successor of Bst
Others
Smallest Circle
Vector Important Functions
Happy Number
Tower of Hanoi
+1
Decimal to Roman Numeral
Iterative Tree Traversals
Lru Cache
Recursive Tree Traversal
Palindrome of Number
Easter
Sparse Matrix
Paranthesis Matching
Kadanes 3
Buzz Number
Fast Integer Input
Stairs Pattern
Physics
Ground to Ground Projectile Motion
Probability
Geometric Dist
Addition Rule
Bayes Theorem
Binomial Dist
Windowed Median
Poisson Dist
Range Queries
Persistent Seg Tree Lazy Prop
Mo
Prefix Sum Array
Segtree
Heavy Light Decomposition
Sparse Table
Sparse Table
Searches
Interpolation Search
+4
Jump Search
+7
Text Search
Ternary Search
+5
Linear Search
+12
Fibonacci Search
+4
Floyd Cycle Detection Algo
Median Search
Hash Search
Saddleback Search
Interpolation Search 2
Binary Search
+13
Exponential Search
Median Search 2
Sublist Search
Sorts
Topological Sort
Insertion Sort
+17
Stooge Sort
Quick Sort
+18
Shell Sort
+8
Radix Sort 2
Gnome Sort
+6
Wave Sort
Bucket Sort
+4
Pigeonhole Sort
+2
Dnf Sort
Tim Sort
+1
Cycle Sort
+4
Cocktail Selection Sort
Odd Even Sort
Bead Sort
+2
Selection Sort Iterative
Counting Sort
+6
Radix Sort
+8
Merge Insertion Sort
Random Pivot Quick Sort
Recursive Bubble Sort
Strand Sort
Bubble Sort
+18
Pancake Sort
+5
Selection Sort Recursive
Wiggle Sort
Count Inversions
Quick Sort 3
Comb Sort
+7
Numeric String Sort
Bitonic Sort
Heap Sort
+12
Bogo Sort
+5
Counting Sort String
Shell Sort 2
Non Recursive Merge Sort
Swap Sort
Library Sort
Slowsort
Binary Insertion Sort
+1
