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