Skip to content
CodeItRaw

Every problem of the Path in one list, easy to hard. Nothing is locked here: solve what you like, in the order you like.

To learn a topic from the start, with its explanation: Go to the Path

0/89
  1. 01First FunctionBasicsEasy
  2. 02SquaredBasicsEasy
  3. 03Is It Even?BasicsEasy
  4. 04Plus or Minus?BasicsEasy
  5. 05From 1 to nBasicsEasy
  6. 06FactorialBasicsEasy
  7. 07Count the PositivesBasicsEasy
  8. 08How Many Are There?BasicsEasy
  9. 09The LargestBasicsEasy
  10. 10SpreadBasicsEasy
  11. 11First SightingBasicsEasy
  12. 12Collect the EvensBasicsEasy
  13. 13How Many Digits?BasicsEasy
  14. 14Signal SumArraysEasy
  15. 15Order CheckArraysEasy
  16. 16Runner-upArraysEasy
  17. 17Zeros to the BackArraysEasy
  18. 18Balance PointArraysEasy
  19. 19Fizz CounterBasicsMedium
  20. 20Best TradeArraysMedium
  21. 21Any Repeats?HashingMedium
  22. 22Most FrequentHashingMedium
  23. 23The Odd OneHashingMedium
  24. 24Two SumHashingMedium
  25. 25Distinct ValuesTwo Pointers & Sliding WindowMedium
  26. 26Pair in SortedTwo Pointers & Sliding WindowMedium
  27. 27Sliding WindowTwo Pointers & Sliding WindowMedium
  28. 28Shortest WindowTwo Pointers & Sliding WindowMedium
  29. 29MirrorRecursion & Divide and ConquerMedium
  30. 30Balanced BracketsRecursion & Divide and ConquerMedium
  31. 31Subset SumRecursion & Divide and ConquerMedium
  32. 32Balanced BracketsStacks & QueuesMedium
  33. 33Next GreaterStacks & QueuesMedium
  34. 34A Warmer DayStacks & QueuesMedium
  35. 35Window PeaksStacks & QueuesMedium
  36. 36Climbing StairsDynamic ProgrammingMedium
  37. 37Don't Wake the NeighboursDynamic ProgrammingMedium
  38. 38Maximum SubarrayDynamic ProgrammingMedium
  39. 39Decode WaysDynamic ProgrammingMedium
  40. 40Grid PathsDynamic ProgrammingMedium
  41. 41Coin ChangeDynamic ProgrammingMedium
  42. 42Text PalindromeStringsMedium
  43. 43Count WordsStringsMedium
  44. 44Longest RunStringsMedium
  45. 45Anagram HalvesStringsMedium
  46. 46Sort ColorsSortingMedium
  47. 47Closest PairSortingMedium
  48. 48MajoritySortingMedium
  49. 49H-IndexSortingMedium
  50. 50Calendar ClashSortingMedium
  51. 51Merge IntervalsSortingMedium
  52. 52Count the ChainLinked ListsMedium
  53. 53Dead CenterLinked ListsMedium
  54. 54k-th From the EndLinked ListsMedium
  55. 55Endless LoopLinked ListsMedium
  56. 56Chain PalindromeLinked ListsMedium
  57. 57Longest StreakHashingHard
  58. 58No RepeatsTwo Pointers & Sliding WindowHard
  59. 59InversionsRecursion & Divide and ConquerHard
  60. 60Largest RectangleStacks & QueuesHard
  61. 61Longest IncreasingDynamic ProgrammingHard
  62. 62Tree SumTreesHard
  63. 63DepthTreesHard
  64. 64LeavesTreesHard
  65. 65Path SumTreesHard
  66. 66Is It a Search Tree?TreesHard
  67. 67DiameterTreesHard
  68. 68Is There a Way?GraphsHard
  69. 69IslandsGraphsHard
  70. 70The Largest IslandGraphsHard
  71. 71Fewest StepsGraphsHard
  72. 72Kth LargestHeaps & Priority QueuesHard
  73. 73Joining RopesHeaps & Priority QueuesHard
  74. 74Running MedianHeaps & Priority QueuesHard
  75. 75Character ReplacementStringsHard
  76. 76Maximum GapSortingHard
  77. 77Lemonade StandGreedy & IntervalsHard
  78. 78Jump GameGreedy & IntervalsHard
  79. 79Fewest JumpsGreedy & IntervalsHard
  80. 80Gas StationGreedy & IntervalsHard
  81. 81Most MeetingsGreedy & IntervalsHard
  82. 82Meeting RoomsGreedy & IntervalsHard
  83. 83CandyGreedy & IntervalsHard
  84. 84Where the Loop BeginsLinked ListsHard
  85. 85Lone WolfBit ManipulationHard
  86. 86Missing NumberBit ManipulationHard
  87. 87Two LonersBit ManipulationHard
  88. 88Total HammingBit ManipulationHard
  89. 89Maximum XORBit ManipulationHard