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