Data structures from scratch 0/15

Data structures from scratch

Dynamic arrays and deques

A growable array over raw storage: capacity, placement new, copying and moving elements on growth, and the strong exception guarantee, then a deque that keeps references valid. Reimplementing `std::vector` is the classic C++ container question.

0 / 3 problems solved 0 / 7 questions solved

Questions

0/7 solved
Question Tags Difficulty Success
1. Which Handles Survive
iterator-invalidationrehash +2
Hard 70%
2. vector vs array
Data StructuresMemory Management
Easy 35%
3. Choosing the Right Container
container_choicelru_cache +2
Medium 67%
4. Zero Then Ten
vectorreserve +2
Medium 75%
5. Reference Survives Push Front
dequevector +2
Medium 59%
6. vector Memory Growth
vectoramortized +3
Medium 94%
7. Iterator Invalidation Rules
iterator_invalidationmap +2
Medium 49%