Backtracking
Big Integer
Bit Manipulation
Ciphers
AES
Another Rot 13
Baconian Cipher
Base 64
Blake 2b
Caesar
Chacha
Diffie Hellman
Hashing Traits
Kerninghan
Morse Code
Polybius
Rail Fence
Rot 13
Salsa
Sha 3
Tea
Theoretical Rot 13
Transposition
Vigenere
XOR Cipher
+2
Compression
Conversions
Binary to Decimal
+3
Binary to Hexadecimal
Decimal to Binary
+4
Hexa Decimal To Binary
Octal to Binary
Data Structures
Permutations
AVL Tree
+2
B Tree
Binary Search Tree
+3
Fenwick Tree
Floyds Algorithm
Graph
Heap
+1
Lazy Segment Tree
Linked List
+1
Postfix Evaluation
Bloom Filter
Count Min Sketch
Queue
+1
Rb Tree
Segment Tree
+3
Segment Tree Recursive
Stack with Singly Linked List
+3
Treap
Trie
Veb Tree
Heap
+1
Disjoint Set Union
Lowest Common Ancestor
Prime
+8
Prime
+8
Reverse
Divide and Conquer
Dynamic Programming
Coin Change
+6
Egg Dropping
Fibonacci Numbers
+11
Knapsack
+2
Longest Common Subsequence
+1
Longest Common Substring
Longest Continuous Increasing Subsequence
Longest Increasing Subsequence
Matrix Chain Multiply
Maximal Square
Maximum Subarray
Minimum Cost Path
Rod Cutting
Snail
Subset Generation
Kadane Algorithm
Floyd Warshall
+3
Catalan Numbers
Financial
Interest
General
Geometry
Graphs
A Star
Bellman Ford
+3
Bipartite Matching
Breadth First Search
+3
Centroid Decomposition
Depth First Search
+4
Depth First Search Tic Tac Toe
Dijkstra
+3
Dinic Maxflow
Eulerian Path
Graph Enumeration
Kosaraju
Lee
Minimum Spanning Tree
Prim
Prufer Code
Strongly Connected Components
Tarjans Ssc
Two Satisfiability
Greedy Methods
Fractional Knapsack
Hashing
Sha 256
Linear Algebra
Gaussian Elimination
Machine Learning
Math
Two Sum
Abs
+5
Aliquot Sum
+4
Amicable Numbers
Area of Polygon
Area Under Curve
Armstrong Number
+8
Average
Baby Step Giant Step
Bell Numbers
Binary Exponentiation
Binomial Coefficient
+1
Ceil
Chinese Remainder Theorem
Collatz Sequence
Cross Entropy Loss
Elliptic Curve
Extended Euclidean Algorithm
Factors
Fast Power
Faster Perfect Numbers
Field
Frizzy Number
Gaussian Error Linear Unit
Gcd of N Numbers
Geometric Series
Greatest Common Divisor
Huber Loss
Karatsuba Multiplication
LCM
+2
Leaky Relu
Linear Sieve
Matrix Ops
Mersenne Primes
Miller Rabin
Newton Raphson
Nthprime
Perfect Number
+5
Perfect Square
+3
Pollard Rho
Prime Factors
Quadratic Residue
Random
Relu
Sieve of Eratosthenes
+4
Sigmoid
Signum
Simpson Integration
Sine
Softmax
Sprague Grundy Theorem
Square Pyramidal Numbers
Square Root
Sum of Digits
+1
Tanh
Trial Division
Vector Cross Product
Zellers Congruence Algorithm
Matrix
Pascal Triangle
Navigation
Networking Flow
Ford Fulkerson
Neural Network
Exponential Linear Unit
Number Theory
Numerical Methods
Fast Fourier Transform
Others
Range Queries
Heavy Light Decomposition
Searches
Union Find
+1
Interpolation
Binary Search
+15
Binary Search Recursive
Exponential Search
Fibonacci Search
+4
Interpolation Search
+6
Jump Search
+8
Kth Smallest
Kth Smallest Heap
Linear Search
+14
Moore Voting
Quick Select
Saddleback Search
Ternary Search
+5
Ternary Search Min Max
Ternary Search Min Max Recursive
Ternary Search Recursive
Sorts
Fisher Yates Shuffle
Topological Sort
+1
Bead Sort
+2
Binary Insertion Sort
+4
Bitonic Sort
Bogo Sort
+7
Bubble Sort
+19
Bucket Sort
+5
Cocktail Shaker Sort
Comb Sort
+8
Counting Sort
+8
Cycle Sort
+5
Dutch National Flag Sort
Exchange Sort
Gnome Sort
+7
Heap Sort
+15
Insertion Sort
+18
Intro Sort
Odd Even Sort
+1
Pancake Sort
+6
Patience Sort
Pigeonhole Sort
+2
Quick Sort
+19
Quick Sort 3 Ways
Radix Sort
+9
Selection Sort
+14
Shell Sort
+9
Sleep Sort
Sort Utils
Stooge Sort
+1
Tim Sort
+2
Tree Sort
Wave Sort
Wiggle Sort
Stacks
Infix To Postfix
Strings
Issubsequence
Genetic
Naive
Aho Corasick
Anagram
Autocomplete Using Trie
Boyer Moore Search
Burrows Wheeler Transform
Duval Algorithm
Hamming Distance
+4
Jaro Winkler Distance
Knuth Morris Pratt
Levenshtein Distance
+2
Manacher
Palindrome
+2
Rabin Karp
+2
