DSA Interview Patterns

Recognise common problem patterns and explain your solution clearly.

Start course →

Syllabus

Solving method

  1. How coding interviews work
  2. Reading constraints carefully
  3. Brute force before optimisation
  4. Explaining complexity
  5. A repeatable problem-solving loop

Array and string patterns

  1. Two pointers
  2. Sliding window
  3. Prefix sums
  4. Hash maps and frequency counts
  5. Intervals and sorting

Search and recursion

  1. Binary search
  2. Recursion trees
  3. Backtracking
  4. Divide and conquer
  5. Stack-based parsing

Linked structures and graphs

  1. Linked-list pointer patterns
  2. Stacks and monotonic stacks
  3. Queues and breadth-first search
  4. Depth-first search
  5. Topological ordering and union-find

Dynamic programming and practice

  1. Recognising dynamic programming
  2. One-dimensional DP
  3. Grid and sequence DP
  4. Mock interview practice
  5. DSA pattern revision checklist