Week 13 of 43
Core DSA
WEEK 13 LEARNING MODULE
Array & List Operations (+ Saturday Contest 2)
Launches Phase 1 (Core DSA) with sequential memory structures, dynamic array resizing, in-place array mutation, and Saturday Contest 2 problems.
6 Practice Problems3 Core ConceptsVerified Curriculum: high Confidence
What You'll Learn
- ✓Understand sequential memory layout, cache locality, and $O(1)$ random access in arrays.
- ✓Analyze dynamic array growth amortized $O(1)$ append vs. $O(n)$ insertion/deletion costs.
- ✓Perform in-place array operations without extra space.
- ✓Solve competitive programming contest problems involving simulation, greed, and sorting.
Core Concepts
Contiguous Memory & Random Access
O(1) accessArray elements stored in adjacent memory addresses enabling direct O(1) index calculations.
Dynamic Array Resizing
O(1) amortizedGeometric resizing factors that yield amortized O(1) append operations.
Two-Pointer Zero Compaction
O(n) time, O(1) spaceShifting non-zero elements forward in-place while preserving relative order.
Algorithms Covered
In-place Array ShiftingRelative Ordering SortArbitrary-Precision Increment SimulationContest Grid Simulation
Data Structures Applied
Arrays / Dynamic ListsHash Maps
“If you want to enjoy the rainbow, be prepared to endure the storm.”
— Warren W. Wiersbe
Lecture Materials (1)
Curated Practice Problems (6)
LeetCode
W13