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