💎 Hynts Gold Mine — Launching Soon. Join the Waitlist!
Package Wise DSA Sheet
Master data structures and algorithms curated specifically by target compensation packages. Practice targeted problem sets ranging from 3 LPA mass recruiter essentials to 60+ LPA FAANG and top-tier quant interview patterns.
200 Problems•6 Package Tiers (3 LPA – 60+ LPA)
0%
Overall Progress
0/200
Status
Problem
Topic
Practice
Package
Difficulty
Save
1. Two Sum
Arrays•
3 – 5 LPA
•2. Reverse StringStrings•
3 – 5 LPA
•3. Palindrome NumberMath•
3 – 5 LPA
•4. Valid ParenthesesStack•
3 – 5 LPA
•5. Fibonacci NumberRecursion•
3 – 5 LPA
•6. Best Time to Buy and Sell StockArrays•
3 – 5 LPA
•7. Merge Two Sorted ListsLinked List•
3 – 5 LPA
•8. Missing NumberArrays•
3 – 5 LPA
•9. Reverse Linked ListLinked List•
3 – 5 LPA
•10. Contains DuplicateArrays•
3 – 5 LPA
•11. Single NumberBit Manipulation•
3 – 5 LPA
•12. Maximum Depth of Binary TreeTrees•
3 – 5 LPA
•13. Roman to IntegerStrings•
3 – 5 LPA
•14. Count Vowels in StringStrings•
3 – 5 LPA
•15. Move ZeroesArrays•
3 – 5 LPA
•16. Sqrt(x)Math•
3 – 5 LPA
•17. Find All Numbers Disappeared in ArrayArrays•
3 – 5 LPA
•18. Balanced Binary TreeTrees•
3 – 5 LPA
•19. Implement Stack using QueuesStack•
3 – 5 LPA
•20. Count PrimesMath•
3 – 5 LPA
•21. Longest Common PrefixStrings•
3 – 5 LPA
•22. Power of TwoBit Manipulation•
3 – 5 LPA
•23. First Bad VersionBinary Search•
3 – 5 LPA
•24. Intersection of Two ArraysArrays•
3 – 5 LPA
•25. Majority ElementArrays•
3 – 5 LPA
•26. Plus OneArrays•
3 – 5 LPA
•27. Remove Duplicates from Sorted ArrayArrays•
3 – 5 LPA
•28. Symmetric TreeTrees•
3 – 5 LPA
•29. Binary SearchBinary Search•
3 – 5 LPA
•30. Climbing StairsDynamic Programming•
3 – 5 LPA
•31. Maximum SubarrayArrays•
5 – 10 LPA
•32. Linked List CycleLinked List•
5 – 10 LPA
•33. Number of IslandsGraphs•
5 – 10 LPA
•34. Invert Binary TreeTrees•
5 – 10 LPA
•35. Find Minimum in Rotated Sorted ArrayBinary Search•
5 – 10 LPA
•36. House RobberDynamic Programming•
5 – 10 LPA
•37. Valid AnagramStrings•
5 – 10 LPA
•38. Binary Tree Inorder TraversalTrees•
5 – 10 LPA
•39. Search in Rotated Sorted ArrayBinary Search•
5 – 10 LPA
•40. Max Depth of N-ary TreeTrees•
5 – 10 LPA
•41. Flood FillGraphs•
5 – 10 LPA
•42. Middle of the Linked ListLinked List•
5 – 10 LPA
•43. Two Sum II Input Array is SortedTwo Pointers•
5 – 10 LPA
•44. Maximum Product SubarrayDynamic Programming•
5 – 10 LPA
•45. Implement Queue using StacksQueue•
5 – 10 LPA
•46. Diameter of Binary TreeTrees•
5 – 10 LPA
•47. Sort ColorsArrays•
5 – 10 LPA
•48. Min StackStack•
5 – 10 LPA
•49. Number of 1 BitsBit Manipulation•
5 – 10 LPA
•50. Reverse BitsBit Manipulation•
5 – 10 LPA
•51. Pascal TriangleArrays•
5 – 10 LPA
•52. Counting BitsBit Manipulation•
5 – 10 LPA
•53. Path SumTrees•
5 – 10 LPA
•54. Find Peak ElementBinary Search•
5 – 10 LPA
•55. Ransom NoteStrings•
5 – 10 LPA
•56. Add BinaryStrings•
5 – 10 LPA
•57. Delete Node in a Linked ListLinked List•
5 – 10 LPA
•58. Guess Number Higher or LowerBinary Search•
5 – 10 LPA
•59. Remove Linked List ElementsLinked List•
5 – 10 LPA
•60. Longest PalindromeStrings•
5 – 10 LPA
•62. Longest Substring Without Repeating CharactersStrings•
10 – 20 LPA
•63. LRU CacheDesign•
10 – 20 LPA
•64. Binary Tree Level Order TraversalTrees•
10 – 20 LPA
•65. Product of Array Except SelfArrays•
10 – 20 LPA
•66. Coin ChangeDynamic Programming•
10 – 20 LPA
•67. Validate Binary Search TreeTrees•
10 – 20 LPA
•68. Rotate ImageArrays•
10 – 20 LPA
•69. Group AnagramsStrings•
10 – 20 LPA
•70. Jump GameGreedy•
10 – 20 LPA
•71. Spiral MatrixArrays•
10 – 20 LPA
•72. Set Matrix ZeroesArrays•
10 – 20 LPA
•73. Unique PathsDynamic Programming•
10 – 20 LPA
•74. Container With Most WaterTwo Pointers•
10 – 20 LPA
•75. Subarray Sum Equals KArrays•
10 – 20 LPA
•76. Letter Combinations of a Phone NumberBacktracking•
10 – 20 LPA
•77. Find First and Last Position in Sorted ArrayBinary Search•
10 – 20 LPA
•78. Decode WaysDynamic Programming•
10 – 20 LPA
•79. Construct Binary Tree from Preorder and InorderTrees•
10 – 20 LPA
•80. Pacific Atlantic Water FlowGraphs•
10 – 20 LPA
•81. Longest Consecutive SequenceArrays•
10 – 20 LPA
•82. Non-overlapping IntervalsGreedy•
10 – 20 LPA
•83. Binary Tree Right Side ViewTrees•
10 – 20 LPA
•84. Kth Smallest Element in BSTTrees•
10 – 20 LPA
•85. Combination SumBacktracking•
10 – 20 LPA
•86. Next PermutationArrays•
10 – 20 LPA
•87. Number of Connected Components in GraphGraphs•
10 – 20 LPA
•88. Reorder ListLinked List•
10 – 20 LPA
•89. Gas StationGreedy•
10 – 20 LPA
•90. Rotate ListLinked List•
10 – 20 LPA
•91. Word SearchBacktracking•
20 – 40 LPA
•92. Merge IntervalsArrays•
20 – 40 LPA
•93. Lowest Common Ancestor of Binary TreeTrees•
20 – 40 LPA
•94. Course ScheduleGraphs•
20 – 40 LPA
•95. Kth Largest Element in ArrayHeap•
20 – 40 LPA
•96. SubsetsBacktracking•
20 – 40 LPA
•97. Longest Palindromic SubstringDynamic Programming•
20 – 40 LPA
•98. Top K Frequent ElementsHeap•
20 – 40 LPA
•99. Clone GraphGraphs•
20 – 40 LPA
•100. Design Add and Search Words Data StructureTrie•
20 – 40 LPA
•101. Implement TrieTrie•
20 – 40 LPA
•102. Find Median from Data StreamHeap•
20 – 40 LPA
•103. Task SchedulerGreedy•
20 – 40 LPA
•104. Graph Valid TreeGraphs•
20 – 40 LPA
•105. House Robber IIDynamic Programming•
20 – 40 LPA
•106. PermutationsBacktracking•
20 – 40 LPA
•107. Accounts MergeGraphs•
20 – 40 LPA
•108. Daily TemperaturesStack•
20 – 40 LPA
•109. Partition Equal Subset SumDynamic Programming•
20 – 40 LPA
•110. Surrounded RegionsGraphs•
20 – 40 LPA
•111. Decode StringStack•
20 – 40 LPA
•112. K Closest Points to OriginHeap•
20 – 40 LPA
•113. Longest Repeating Character ReplacementSliding Window•
20 – 40 LPA
•114. Time Based Key Value StoreDesign•
20 – 40 LPA
•115. Maximum Width of Binary TreeTrees•
20 – 40 LPA
•116. Word BreakDynamic Programming•
20 – 40 LPA
•117. Rotting OrangesGraphs•
20 – 40 LPA
•118. Remove Nth Node From End of ListLinked List•
20 – 40 LPA
•119. Evaluate Reverse Polish NotationStack•
20 – 40 LPA
•120. Copy List with Random PointerLinked List•
20 – 40 LPA
•121. Trapping Rain WaterArrays•
40 – 60 LPA
•122. Serialize and Deserialize Binary TreeTrees•
40 – 60 LPA
•123. Word LadderGraphs•
40 – 60 LPA
•124. Median of Two Sorted ArraysBinary Search•
40 – 60 LPA
•125. Edit DistanceDynamic Programming•
40 – 60 LPA
•126. Largest Rectangle in HistogramStack•
40 – 60 LPA
•127. Binary Tree Maximum Path SumTrees•
40 – 60 LPA
•128. Merge K Sorted ListsLinked List•
40 – 60 LPA
•129. Jump Game IIGreedy•
40 – 60 LPA
•130. Burst BalloonsDynamic Programming•
40 – 60 LPA
•131. Reverse Nodes in K-GroupLinked List•
40 – 60 LPA
•132. Distinct SubsequencesDynamic Programming•
40 – 60 LPA
•133. Find K Pairs with Smallest SumsHeap•
40 – 60 LPA
•134. Swim in Rising WaterGraphs•
40 – 60 LPA
•135. Alien DictionaryGraphs•
40 – 60 LPA
•137. Minimum Interval to Include Each QueryHeap•
40 – 60 LPA
•138. Reconstruct ItineraryGraphs•
40 – 60 LPA
•139. Palindrome PairsTrie•
40 – 60 LPA
•140. Max Points on a LineMath•
40 – 60 LPA
•141. Regular Expression MatchingDynamic Programming•
60+ LPA
•142. Sliding Window MaximumSliding Window•
60+ LPA
•143. Minimum Window SubstringSliding Window•
60+ LPA
•144. Longest Increasing SubsequenceDynamic Programming•
60+ LPA
•145. N-QueensBacktracking•
60+ LPA
•146. Maximum Profit in Job SchedulingDynamic Programming•
60+ LPA
•147. Sudoku SolverBacktracking•
60+ LPA
•148. Count of Smaller Numbers After SelfArrays•
60+ LPA
•149. Longest Valid ParenthesesStack•
60+ LPA
•150. Wildcard MatchingDynamic Programming•
60+ LPA
•151. First Missing PositiveArrays•
60+ LPA
•152. Text JustificationStrings•
60+ LPA
•153. Dungeon GameDynamic Programming•
60+ LPA
•154. The Skyline ProblemHeap•
60+ LPA
•155. Basic CalculatorStack•
60+ LPA
•156. Russian Doll EnvelopesDynamic Programming•
60+ LPA
•157. Maximum GapSorting•
60+ LPA
•158. Strong Password CheckerStrings•
60+ LPA
•159. Number of AtomsStrings•
60+ LPA
•160. Minimum Cost to Hire K WorkersHeap•
60+ LPA
•161. Frog JumpDynamic Programming•
60+ LPA
•162. Minimum Number of Refueling StopsGreedy•
60+ LPA
•163. Shortest Path to Get All KeysGraphs•
60+ LPA
•164. Maximum Sum of 3 Non-Overlapping SubarraysDynamic Programming•
60+ LPA
•165. Concatenated WordsTrie•
60+ LPA
•166. Number of Ways to Wear Different HatsDynamic Programming•
60+ LPA
•167. Strange PrinterDynamic Programming•
60+ LPA
•168. Minimum Difficulty of a Job ScheduleDynamic Programming•
60+ LPA
•169. Maximize Score After N OperationsDynamic Programming•
60+ LPA
•170. Shortest SuperstringDynamic Programming•
60+ LPA
•171. Find the Duplicate NumberArrays•
20 – 40 LPA
•172. Minimum Height TreesGraphs•
20 – 40 LPA
•173. All Nodes Distance K in Binary TreeTrees•
20 – 40 LPA
•174. Maximum Frequency StackDesign•
40 – 60 LPA
•175. Cheapest Flights Within K StopsGraphs•
20 – 40 LPA
•176. Network Delay TimeGraphs•
20 – 40 LPA
•177. Path With Maximum ProbabilityGraphs•
20 – 40 LPA
•178. Minimum Cost to Connect all PointsGraphs•
20 – 40 LPA
•179. Hand of StraightsGreedy•
10 – 20 LPA
•180. Interleaving StringDynamic Programming•
20 – 40 LPA
•181. Largest NumberSorting•
10 – 20 LPA
•182. Insert IntervalArrays•
10 – 20 LPA
•183. Palindrome PartitioningBacktracking•
20 – 40 LPA
•184. Number of 1 BitsBit Manipulation•
5 – 10 LPA
•185. Design TwitterDesign•
20 – 40 LPA
•186. Koko Eating BananasBinary Search•
10 – 20 LPA
•187. Car FleetStack•
10 – 20 LPA
•188. Minimum Rotations to Open LockGraphs•
20 – 40 LPA
•189. Longest Common SubsequenceDynamic Programming•
20 – 40 LPA
•190. Maximal SquareDynamic Programming•
20 – 40 LPA
•191. Snakes and LaddersGraphs•
10 – 20 LPA
•192. Check if There is a Valid PartitionDynamic Programming•
10 – 20 LPA
•193. Minimum Size Subarray SumSliding Window•
10 – 20 LPA
•194. Fruit Into BasketsSliding Window•
10 – 20 LPA
•195. Count Good Nodes in Binary TreeTrees•
10 – 20 LPA
•196. Maximum Level Sum of Binary TreeTrees•
10 – 20 LPA
•197. Reverse IntegerMath•
5 – 10 LPA
•199. Count Different Palindromic SubsequencesDynamic Programming•
60+ LPA
•200. Minimum Window to SortArrays•
20 – 40 LPA
•