Your Practice Plan
What to do next.
Data structures and algorithms are a skill, like a sport. Watching helps, but you get good by practising. Here's a simple plan for the next few weeks.

- A skill, like a sport
- Practice makes it stick
- A simple plan
A four week plan
In week one, practise arrays, strings, and hashing, with two pointer and sliding window problems. In week two, stacks, queues, linked lists, and binary search. In week three, trees, heaps, and graphs. And in week four, greedy, dynamic programming, and backtracking. Two or three problems a day is plenty.
| Week | Focus |
|---|---|
| 1 | arrays, strings, hashing, windows |
| 2 | stacks, queues, lists, binary search |
| 3 | trees, heaps, graphs |
| 4 | greedy, DP, backtracking |
How to practise
Try each problem for about twenty minutes before you look at a solution. If you're stuck, read just the hint, or the technique, and try again. After you solve it, say out loud why your solution works, and what its Big O is. And come back to the hard ones a week later, to see if you can solve them from scratch.
| key | value |
|---|---|
| Try first | about 20 minutes |
| Stuck? | read a hint, not the answer |
| Explain it | why it works, its Big O |
| Repeat | hard ones a week later |
Summary
Practise a few problems every day, explain your answers out loud, and revisit the hard ones. That's how this becomes second nature. Next, the end of the course.
Key takeaways- Two or three a day
- Explain out loud
- Revisit hard ones