Index
Content🔗
Data Structures
Sorting
- Elementary Sorting Strategies
- Quicksort
- Mergesort
- Priority Queues & Heapsort
- Radix Sort
Search
- Binary Search
- BSTs
- Hashing
- Radix Search
Problem Solving Paradigm
- Complete Search
- Divide & Conquer
- Greedy
- Dynamic Programming
Graph
- Graph Properties and their Types
- Graph Traversal (DFS/BFS)
- Digraphs & DAGs (Topological Sorting)
- Shortest Paths
- MSTs
- Network Flows
- Other Algorithms
- Summary
Strings
- Fundamentals
- String Hashing
- Rabin-Karp
- Prefix function - KMP
- Z function
- Suffix Array
- Advanced
- Suffix Tree
- Suffix Automaton
- Lyndon factorization
- Tasks
- Expression Parsing
- Manacher’s Algorithm - Finding all sub-palindromes in O(n)
- Finding repetitions
Trees