Blind 75, as mock interviews

Solving these on your own is half of it. In the interview you also have to explain your approach, answer follow-ups and test your code while someone watches. Each problem below opens as a timed round with a voice interviewer and a scored report.

71 of the 75 problems are in the library; 4 are not here yet. In the problem library you can pick this list from the Lists filter and save problems for later.

  1. 1Two SumEasy
  2. 2Best Time to Buy and Sell StockEasy
  3. 3Contains DuplicateEasy
  4. 4Product of Array Except SelfMedium
  5. 5Maximum SubarrayEasy
  6. 6Maximum Product SubarrayMedium
  7. 7Find Minimum in Rotated Sorted ArrayMedium
  8. 8Search in Rotated Sorted ArrayMedium
  9. 93SumMedium
  10. 10Container With Most WaterMedium
  11. 11Number of 1 BitsEasy
  12. 12Counting BitsMedium
  13. 13Missing NumberEasy
  14. 14Reverse BitsEasy
  15. 15Climbing StairsEasy
  16. 16Coin ChangeMedium
  17. 17Longest Increasing SubsequenceMedium
  18. 18Longest Common SubsequenceMedium
  19. 19Word BreakMedium
  20. 20Combination SumMedium
  21. 21House RobberMedium
  22. 22House Robber II (Circular)Medium
  23. 23Decode WaysMedium
  24. 24Unique PathsMedium
  25. 25Jump GameMedium
  26. 26Clone Graph (Adjacency Matrix)Medium
  27. 27Course ScheduleMedium
  28. 28Pacific Atlantic Water FlowMedium
  29. 29Number of IslandsMedium
  30. 30Longest Consecutive SequenceMedium
  31. 31Alien DictionaryHard
  32. 32Graph Valid TreeMedium
  33. 33Insert IntervalMedium
  34. 34Merge IntervalsMedium
  35. 35Non-overlapping IntervalsMedium
  36. 36Meeting RoomsEasy
  37. 37Meeting Rooms IIMedium
  38. 38Reverse Linked ListEasy
  39. 39Linked List CycleEasy
  40. 40Merge Two Sorted ListsEasy
  41. 41Merge K Sorted ListsHard
  42. 42Remove Nth Node From End of ListMedium
  43. 43Reorder ListMedium
  44. 44Set Matrix ZeroesMedium
  45. 45Spiral MatrixMedium
  46. 46Rotate ImageMedium
  47. 47Word SearchMedium
  48. 48Longest Substring Without Repeating CharactersMedium
  49. 49Longest Repeating Character ReplacementMedium
  50. 50Minimum Window SubstringHard
  51. 51Valid AnagramEasy
  52. 52Group AnagramsMedium
  53. 53Valid ParenthesesEasy
  54. 54Valid PalindromeEasy
  55. 55Longest Palindromic SubstringMedium
  56. 56Palindromic SubstringsMedium
  57. 57Encode and Decode StringsMedium
  58. 58Maximum Depth of Binary TreeEasy
  59. 59Same TreeEasy
  60. 60Invert Binary TreeEasy
  61. 61Binary Tree Maximum Path SumHard
  62. 62Binary Tree Level Order TraversalMedium
  63. 63Serialize and Deserialize Binary TreeHard
  64. 64Subtree of Another TreeEasy
  65. 65Validate Binary Search TreeMedium
  66. 66Kth Smallest Element in a BSTMedium
  67. 67Implement Trie (Prefix Tree)Medium
  68. 68Design Add and Search Words Data StructureMedium
  69. 69Word Search IIHard
  70. 70Top K Frequent ElementsMedium
  71. 71Find Median from Data StreamHard