Sorted Again · data structures and algorithms in Python

Open this page in a web browser

This preview can’t run the course. Its code editor, the Python that runs your solutions and the step-by-step visualizers need JavaScript, and this viewer (a message or file preview) has it turned off.

On iPhone or iPad, open the link in Safari or Chrome. On a computer, open the file in Chrome, Safari, Edge or Firefox.

Inside: 27 modules and 192 problems.

  1. Start here
  2. Big-O and complexity
  3. Arrays and hashing
  4. Two pointers
  5. Sliding window
  6. Stacks and monotonic stacks
  7. Binary search
  8. Linked lists
  9. Recursion
  10. Trees and BSTs
  11. Tries
  12. Heaps and priority queues
  13. Backtracking
  14. Graphs
  15. Intervals
  16. Greedy
  17. Dynamic programming
  18. Bit manipulation and math
  19. Interview playbook

Advanced:

  1. Ordered data structures
  2. Greedy with heaps
  3. Fenwick and segment trees
  4. Binary lifting and sparse tables
  5. String matching
  6. Advanced graphs
  7. Advanced dynamic programming
  8. Number theory