Phase 01 of 06
Data Structures and Algorithms Fundamentals
Weeks 1-2: Data Structures (Arrays, Lists, Trees, HashMaps) & Algorithms (Sorting, Searching, BFS/DFS). Solve 15-20 problems.
Weeks 1-2: Focus on core data structures like arrays, linked lists, stacks, queues, trees (binary trees, BSTs), and hash tables. Practice common algorithms such as sorting (merge sort, quicksort), searching (binary search), and basic graph traversals (BFS, DFS). Aim to solve at least 15-20 problems related to these topics.