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