DSA in Python · Lesson 132 of 132
Course Complete
You did it.
You've finished the course. You started with counting steps, and now you can choose the right data structure, and solve problems with windows, heaps, graphs, and dynamic programming. That's a big achievement.

- From counting steps
- To graphs and DP
- A big achievement
What you learned
You learned Big O, so you can measure any solution. Lists, dictionaries, sets, stacks, queues, and linked lists. Searching and sorting. Trees, heaps, tries, and graphs. And the problem solving techniques, from greedy, to dynamic programming, to backtracking.
Big Omeasure any solution
Core structureslists, dicts, stacks, queues
Trees and graphsBFS, DFS, Dijkstra
Techniquesgreedy, DP, backtracking
Summary
Thank you for learning with me. Keep practising, keep explaining your solutions, and good luck in your next interview.
Key takeaways- Big O
- Data structures
- Algorithms
Next up: Keep Practising — a few problems a day