Phase 01 of 04
Data Structures and Algorithms
Weeks 1-2: DSA fundamentals and practice (15-20 problems/week).
Weeks 1-2: Focus on Data Structures and Algorithms. Cover arrays, linked lists, stacks, queues, trees (binary trees, BSTs, AVL trees), graphs, hash tables. Practice implementing and analyzing time/space complexity for common algorithms like sorting (quicksort, mergesort), searching (binary search), and graph traversal (BFS, DFS). Aim to solve at least 15-20 medium-difficulty problems per week.