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