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