← all tracks

Coding Interview Patterns

The classic patterns interviews still test: hashing, two pointers, windows, stacks, trees, graphs and DP.

Intermediate · 38 problems · 0 passed · Background reading: General Coding (DSA)

  1. 01Two Sumeasy
  2. 02Valid Anagrameasy
  3. 03Valid Palindromeeasy
  4. 04Valid Parentheseseasy
  5. 05Reverse a Singly Linked Listeasy
  6. 06Linked List Cycle Detectioneasy
  7. 07Binary Searcheasy
  8. 08Maximum Depth of Binary Treeeasy
  9. 09Find if Path Exists in Grapheasy
  10. 10House Robbereasy
  11. 11Group Anagramsmedium
  12. 12Top K Frequent Elementsmedium
  13. 13Product of Array Except Selfmedium
  14. 14Longest Consecutive Sequencemedium
  15. 153Summedium
  16. 16Container With Most Watermedium
  17. 17Longest Substring Without Repeating Charactersmedium
  18. 18Subarray Sum Equals Kmedium
  19. 19Evaluate Reverse Polish Notationmedium
  20. 20Search in Rotated Sorted Arrayeasy
  21. 21Find First and Last Position of Element in Sorted Arraymedium
  22. 22Diameter of Binary Treemedium
  23. 23Binary Tree Zigzag Level Order Traversalmedium
  24. 24Lowest Common Ancestor of a Binary Treemedium
  25. 25Number of Islands in 2D Gridmedium
  26. 26Course Schedule: Cycle Detection in Directed Graphmedium
  27. 27Course Schedule II: Topological Order Recoverymedium
  28. 28Dijkstra's Single-Source Shortest Pathsmedium
  29. 29Longest Common Subsequencemedium
  30. 30Partition Equal Subset Summedium
  31. 31Decode Waysmedium
  32. 32Non-overlapping Intervalsmedium
  33. 33Trapping Rain Watermedium
  34. 34Minimum Window Substringhard
  35. 35Sliding Window Maximumhard
  36. 36Largest Rectangle in Histogram (Monotonic Stack)hard
  37. 37Binary Tree Maximum Path Sumhard
  38. 38Median of Two Sorted Arrayshard