MODULE 1
Algorithmic Thinking & Complexity
- Problem solving basics
- Computational thinking
- Pseudocode
- Time & space complexity
- Big‑O / Ω / Θ
MODULE 2
Arrays & Strings
- Arrays traversal & operations
- Prefix sum
- Sliding window
- Two pointers
- Strings & substrings
- Anagrams
MODULE 3
Recursion & Backtracking
- Recursion basics
- Call stack
- Subsets
- Permutations
- N‑Queens
- Sudoku
MODULE 4
Searching & Sorting
- Linear & binary search
- Merge sort
- Quick sort
- Heap sort
- Counting / radix