Advance
- Queue with stack (Using 2 stack, Time efficient)
- Queue with stack (Using 1 stack, Time in-efficient)
- Binary Search Tree
- Disjoint Set Unit
- SQRT Decomposition
- Segment Tree
- Lazy Propagation
- Trie Tree
- Binary Index Tree
- Vector
- Stack
- Queue
- Deque
- Map
- Set
- Unordered Set
- Pair
- Struct
Advance
- Linear Search
- Binary Search
- Bisection method
- Ternary Search
- GCD
- LCM
- Prime Generator (Sieve of Erathosthenos)
- Goldbach Conjecture
- Find All Divisor
- Modular Arithmetic
- Big Mod
- Number of Digit
- Euler Totient Function
- Number of Divisor
- Sum of Divisor
- All Possible Subset
- School Method
- Fermat's Method
- Miller Rabin
Advance
- Bitwise-Sieve
- Segmented Sieve
- Extended Euclidean Algorithm
- Modular Multiplicative Inverse
- Fermat's Little Theorem
- Chinese Remainder Theorem
- Graph Representation
- BFS
- BFS on Grid
- DFS
- Top Sort
- Topological Sort
- Strongly Connected Component
- Flood Fill Algorithm
Shortest Path Problem
Minimum Spanning Tree (MST)
- Fibonacci Number
- Binomial Coefficient
- Coin Change 1
- Coin Change 2
- 0/1 Knapsack 1
- 0/1 Knapsack 2
- 0/1 Knapsack 3
- 0/1 Knapsack 4
- Fractional Knapsack
- Gold Mine Problem
- Longest Common Subsequence
- Longest Palindromic Subsequence
- Largest Palindromic Substring
- Maximum Subarray Sum
- Subset Sum
- Bubble Sort
- Selection Sort
- Merge Sort
- Quick Sort
- Heap Sort
- Insertion Sort
- Permutation Generator
- Tower of Hanoi
ยฉ ๐๐บ๐ถ๐ฟ๐๐น ๐๐๐น๐ฎ๐บ, ๐๐๐ฌ๐ฌ๐ข๐จ๐ง๐๐ญ๐ ๐๐ซ๐จ๐๐ฅ๐๐ฆ ๐๐จ๐ฅ๐ฏ๐๐ซ & ๐๐๐๐ค๐๐ง๐ ๐๐ง๐ ๐ข๐ง๐๐๐ซ
