Bootcamp

# DSA bootcamp - 14 days

Week 1 - patterns first, problems second.

Day 1 - Arrays + two pointers: max subarray, container with most water.
Day 2 - Hashing + sliding window: longest substring without repeating chars.
Day 3 - Stacks + monotonic stacks: daily temperatures, next greater element.
Day 4 - Linked lists: reverse, detect cycle (Floyd), merge two sorted.
Day 5 - Trees: BFS, DFS, lowest common ancestor.
Day 6 - Heaps: top-K elements, merge K sorted lists.
Day 7 - Review + one mock interview.

Week 2 - harder patterns.

Day 8 - Graphs: BFS shortest path, DFS topological sort.
Day 9 - Union-find: number of islands, redundant connection.
Day 10 - Backtracking: combinations, N-queens, word search.
Day 11 - DP 1D: house robber, coin change.
Day 12 - DP 2D: longest common subsequence, edit distance.
Day 13 - Greedy + intervals: meeting rooms, jump game.
Day 14 - Two mock interviews, one of them whiteboard.

Rules: explain out loud while solving. Code without an IDE for half. Always state time and space complexity before coding.

// 30-day DSA bootcamp in the lesson body.