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