1. Time complexity (Big-O notation)

2. Space complexity

3. Searching (linear, binary)

4. Sorting (bubble, merge, quicksort)

5. Recursion & divide and conquer

6. Dynamic programming

7. Greedy algorithms

8. Graph traversal (BFS, DFS)

9. String matching (Naive, KMP, Boyer-Moore)

10. Edit distance / Levenshtein distance

11. Longest Common Subsequence

12. Viterbi algorithm

13. CYK / Earley parsing algorithms