Phase 01 of 04
Data Structures and Algorithms
Weeks 1-2: Data Structures & Algorithms. Practice 10-14 medium/hard problems. Focus on implementation and complexity analysis.
Weeks 1-2: Focus on Data Structures and Algorithms. Cover arrays, linked lists, stacks, queues, trees (binary, BST, AVL), heaps, hash tables, graphs. Practice implementing and analyzing time/space complexity for common algorithms like sorting (quicksort, mergesort), searching (binary search), graph traversal (BFS, DFS), dynamic programming. Aim for 5-7 medium/hard problems per week.