Phase 01 of 04
Data Structures and Complexity
Weeks 1-2: Data Structures (Arrays, Linked Lists, Trees, Hash Maps) & Complexity Analysis.
Weeks 1-2: Focus on core data structures like arrays, linked lists, stacks, queues, trees (binary trees, BSTs), and hash maps. Practice implementing them and solving problems involving their usage. Understand time and space complexity analysis (Big O notation).