Skip to main content

List · 75 problems

Grind 75: All 75 Problems in a Study Order

Grind 75 is built to be shaped around your calendar. I give you one steady order and let you adjust. The order is mine. I start with the openers, then go one topic at a time, easiest first.

Get the link for your laptop

Free: write the code and run it, no sign-up.

Whose list this is

Yangshun Tay built Grind 75. StrongYes did not write it, and the problems belong to their sources. Every problem below opens a StrongYes practice page for the problem with the same name. Source: Tech Interview Handbook: Grind 75.

The problems, in my order

23 easy · 43 medium · 9 hard. Solved marks come from this browser and, signed in, your account.

  1. Contains DuplicateeasyArrays & Hashing
  2. Majority ElementeasyArrays & Hashing
  3. Ransom NoteeasyStringsArrays & Hashing
  4. Valid AnagrameasyStringsArrays & Hashing
  5. Two SumeasyTwo PointersArrays & Hashing
  6. Valid PalindromeeasyTwo PointersStrings
  7. Product of Array Except SelfmediumArrays & Hashing
  8. Spiral MatrixmediumArrays & Hashing
  9. String to Integer ConversionmediumStrings
  10. 3SummediumTwo PointersArrays & Hashing
  11. Sort ColorsmediumTwo PointersArrays & Hashing
  12. Implement Queue using StackseasyStackDesign
  13. Valid ParentheseseasyStackStrings
  14. Evaluate Reverse Polish NotationmediumStackArrays & Hashing
  15. Min StackmediumStackDesign
  16. Basic CalculatorhardStackStrings
  17. Largest Rectangle in HistogramhardStackArrays & Hashing
  18. Binary SearcheasyBinary SearchArrays & Hashing
  19. First Bad VersioneasyBinary Search
  20. Search in Rotated Sorted ArraymediumBinary SearchArrays & Hashing
  21. Time Based Key-Value StoremediumBinary SearchDesign
  22. Best Time to Buy and Sell StockeasySliding WindowArrays & Hashing
  23. Analytics: Longest Unique Session WindowmediumSliding WindowStrings
  24. Find All Anagrams in a StringmediumSliding WindowStrings
  25. Minimum Window SubstringhardSliding WindowStrings
  26. Linked List CycleeasyLinked ListsTwo Pointers
  27. Merge Two Sorted ListseasyLinked Lists
  28. Middle of the Linked ListeasyLinked ListsTwo Pointers
  29. Reverse Linked ListeasyLinked Lists
  30. LRU CachemediumLinked ListsDesign
  31. Implement Trie (Prefix Tree)mediumTreesDesign
  32. Balanced Binary TreeeasyTreesBFS & DFS
  33. Diameter of Binary TreeeasyTreesBFS & DFS
  34. Flood FilleasyBFS & DFSArrays & Hashing
  35. Invert Binary TreeeasyTreesBFS & DFS
  36. Maximum Depth of Binary TreeeasyTreesBFS & DFS
  37. Binary Tree Level Order TraversalmediumTreesBFS & DFS
  38. Binary Tree Right Side ViewmediumTreesBFS & DFS
  39. Construct Binary Tree from Preorder and Inorder TraversalmediumTreesBFS & DFS
  40. Distance to Nearest ZeromediumBFS & DFSArrays & Hashing
  41. Kth Smallest Element in a BSTmediumTreesBFS & DFS
  42. Lowest Common Ancestor of a Binary Search TreemediumTreesBFS & DFS
  43. Lowest Common Ancestor of a Binary TreemediumTreesBFS & DFS
  44. Validate Binary Search TreemediumTreesBFS & DFS
  45. Serialize and Deserialize Binary TreehardTreesDesign
  46. K Closest Points to OriginmediumBinary SearchHeaps
  47. Find Median from Data StreamhardHeapsTwo Pointers
  48. Merge K Sorted ListshardLinked ListsHeaps
  49. Combination SummediumBacktrackingArrays & Hashing
  50. Letter Combinations of a Phone NumbermediumBacktrackingStrings
  51. PermutationsmediumBacktrackingArrays & Hashing
  52. Word SearchmediumBacktrackingStrings
  53. Accounts MergemediumGraphsStrings
  54. Clone GraphmediumGraphsBFS & DFS
  55. Course SchedulemediumHeapsGraphs
  56. Minimum Height TreesmediumGraphsBFS & DFS
  57. Number of IslandsmediumGraphsBFS & DFS
  58. Rotting OrangesmediumGraphsBFS & DFS
  59. Word LadderhardGraphsStrings
  60. Climbing StairseasyDynamic Programming
  61. Coin ChangemediumDynamic ProgrammingBFS & DFS
  62. Equal Sum Array PartitionmediumDynamic ProgrammingArrays & Hashing
  63. Longest Palindromic SubstringmediumTwo PointersDynamic Programming
  64. Maximum SubarraymediumDynamic ProgrammingArrays & Hashing
  65. Unique PathsmediumDynamic Programming
  66. Word BreakmediumTreesDynamic Programming
  67. Maximum Profit in Job SchedulinghardBinary SearchDynamic Programming
  68. Trapping Rain WaterhardStackHeaps
  69. Longest Palindrome LengtheasyGreedyStrings
  70. Container With Most WatermediumGreedyTwo Pointers
  71. Task SchedulermediumGreedyHeaps
  72. Insert IntervalmediumIntervalsArrays & Hashing
  73. Merge IntervalsmediumIntervalsArrays & Hashing
  74. Add BinaryeasyBit ManipulationStrings
  75. SubsetsmediumBit ManipulationBacktracking

How I'd work it

  1. 1

    Pick your pace first

    Count the weeks you have, then divide. Two problems a day, five days a week, takes about eight weeks.

  2. 2

    Mix easy and hard

    Do an easy problem to warm up and a medium to stretch. Skip the hard ones until the mediums feel calm.

  3. 3

    Talk through each one

    Say the plan before you code and the cost after. Coco listens and asks what a line does.

Two problems a day, five days a week, finishes this list in about 8 weeks.

The list by pattern

Every problem is a costume over a smaller idea. Learn the idea and the costume stops mattering.

Where Coco comes in

Coco is an AI study partner, not a person. She listens while you explain your code, asks what a line does and never hands you the fix. Sign in free to type with Coco, up to a daily limit, and to talk with her for one hour. After that, talking comes with the $79 pack. Anyone can open the editor and run their code.

Questions people ask

How long does Grind 75 take?
Two problems a day, five days a week, takes about eight weeks. A looser pace works if your interview is further out.
How is Grind 75 different from the Blind 75?
Both have 75 problems, and they overlap. Grind 75 was built later and meant to be scheduled around your time.
Do I need the official schedule?
No. This page keeps one steady order. Use the official planner if you want its week-by-week schedule.

Keep going

Fin and Coco are characters, not people. strongyes.io is independent. Leo builds it with AI agents.