Dedicated Full Algorithm Pages
Each link opens a complete standalone page locked to one algorithm with all specific functionality.
- Binary Search
- Linear Search
- Merge Sort
- Quick Sort
- Heap Sort
- Bubble Sort
- Selection Sort
- Insertion Sort
- Breadth-First Search (BFS)
- Depth-First Search (DFS)
- Dijkstra's Algorithm
- Bellman-Ford Algorithm
- Floyd-Warshall Algorithm
- Kruskal's Algorithm
- Prim's Algorithm
- Topological Sort
- A* (A-Star) Algorithm
- Fibonacci (DP)
- 0/1 Knapsack
- Unbounded Knapsack
- Longest Common Subsequence (LCS)
- Longest Increasing Subsequence (LIS)
- Matrix Chain Multiplication
- Coin Change Problem
- Edit Distance
- Activity Selection
- Fractional Knapsack
- Huffman Coding
- Job Scheduling with Deadlines
- Minimum Spanning Tree (Greedy)
- Merge Sort (Divide & Conquer)
- Quick Sort (Divide & Conquer)
- Binary Search (Divide & Conquer)
- Strassen's Matrix Multiplication
- N-Queens Problem
- Sudoku Solver
- Subset Generation
- Permutations Generation
- Rat in a Maze
- Knuth-Morris-Pratt (KMP)
- Rabin-Karp
- Z Algorithm
- Trie (Prefix Tree)
- Suffix Array
- Suffix Tree
- Union-Find (DSU)
- Segment Tree
- Fenwick Tree (BIT)
- Kth Smallest/Largest (Heap)
- Sliding Window
- Two Pointer Technique
- Bit Manipulation Algorithms