Coding Interview Patterns

Planned outline

1. Module 1

   How to approach a coding round

   Coming soon
2. Module 2

   Interview toolkits in five languages

   Coming soon
3. Module 3

   Arrays and hashing

   Coming soon
4. Module 4

   Two pointers

   Coming soon
5. Module 5

   Sliding window

   Coming soon
6. Module 6

   Prefix sums and difference arrays

   Coming soon
7. Module 7

   Sorting as a tool

   Coming soon
8. Module 8

   Stacks and monotonic stacks

   Coming soon
9. Module 9

   Binary search

   Coming soon
10. Module 10

    Linked list patterns

    Coming soon
11. Module 11

    Tree patterns: depth-first

    Coming soon
12. Module 12

    Tree patterns: breadth-first

    Coming soon
13. Module 13

    Heaps and top-K

    Coming soon
14. Module 14

    Intervals and sweep line

    Coming soon
15. Module 15

    Matrices and simulation

    Coming soon
16. Module 16

    Backtracking

    Coming soon
17. Module 17

    Bit manipulation

    Coming soon
18. Module 18

    Maths for coding rounds

    Coming soon
19. Module 19

    Tries

    Coming soon
20. Module 20

    Graph patterns: traversal

    Coming soon
21. Module 21

    Topological sort and DAGs

    Coming soon
22. Module 22

    Union-find (disjoint sets)

    Coming soon
23. Module 23

    Weighted graphs: shortest paths and spanning trees

    Coming soon
24. Module 24

    Dynamic programming: foundations

    Coming soon
25. Module 25

    Dynamic programming: knapsack, grids and strings

    Coming soon
26. Module 26

    Dynamic programming: advanced patterns

    Coming soon
27. Module 27

    Greedy algorithms and proofs

    Coming soon
28. Module 28

    String patterns

    Coming soon
29. Module 29

    Design-a-data-structure problems

    Coming soon
30. Module 30

    Range queries: Fenwick and segment trees

    Coming soon
31. Module 31

    Concurrency coding problems

    Coming soon
32. Module 32

    Coding rounds with AI: read, debug, extend

    Coming soon
33. Module 33

    Pattern recognition and mixed practice

    Coming soon

Official documentation

• docs.python.org/3/library/bisect.html (docs.python.org)
• docs.oracle.com/en/java/javase/25/docs/api/java.base/java/util/PriorityQueue.html (docs.oracle.com)
• en.cppreference.com/w/cpp/algorithm (en.cppreference.com)
• go.dev/doc (go.dev)

More in Data structures, algorithms and coding interviews

• Data Structures & Algorithms (coming soon)
• Competitive Programming (coming soon)
• All DSA tracks
• How we make lessons