Data structures & algorithms

How to store and move data efficiently.

6 weeks · wk 2–7Core / deep pace7 topics21 Interview Questions

Why this pace:Frontend/mobile work rarely forces you to implement trees or graphs by hand — budget the most time here, ~1 hr/day plus 2 problems/day.

SEC FOCUS

Unbounded complexity is an attack surface — algorithmic complexity (ReDoS-style) can become a denial-of-service vector.

Topics & Action Items (7)

Arrays, linked lists, stacks, queues

4-5 hrs

Trees, heaps, graphs

6-8 hrs

Hash tables and collision handling

2-3 hrs

Sorting and searching algorithms

4 hrs

Big-O time and space complexity

2 hrs

Recursion and dynamic programming

6-8 hrs

Practicing structured problem sets

5-6 hrs/wk

Previous Stage

Programming fundamentals

Next Stage

Object-oriented programming