Phase 01 of 04
Data Structures and Algorithms
Weeks 1-2: DSA fundamentals. Practice 5-7 problems/week.
Weeks 1-2: Focus on Data Structures and Algorithms. Cover arrays, linked lists, stacks, queues, trees (binary, BST, AVL), heaps, hash tables, graphs. Implement and analyze time/space complexity for sorting (quicksort, mergesort), searching (binary search), graph traversal (BFS, DFS), and dynamic programming problems. Practice 5-7 problems per week.