LeetCode The Hard Way

Goldman Sachs

246 problems

ProblemDifficultyFrequency Topics
1343. Number of Sub-arrays of Size K and Average Greater than or Equal to ThresholdMedium32.6%
ArraySliding Window
Best Time to Buy and Sell Stock IIIHard32.6%
ArrayDynamic Programming
Russian Doll EnvelopesHard32.6%
ArrayBinary SearchDynamic ProgrammingSortingLongest Increasing Subsequence
1219. Path with Maximum GoldMedium32.6%
ArrayBacktrackingMatrix
25. Reverse Nodes in k-GroupHard32.6%
Linked ListRecursion
75. Sort ColorsMedium32.6%
ArrayTwo PointersSortingQuicksortBubble Sort
88. Merge Sorted ArrayEasy32.6%
ArrayTwo PointersSorting
76. Minimum Window SubstringHard32.6%
Hash TableStringSliding Window
1202. Smallest String With SwapsMedium32.6%
ArrayHash TableStringDepth-First SearchBreadth-First SearchUnion-FindSorting
13. Roman to IntegerEasy27.7%
Hash TableMathString
17. Letter Combinations of a Phone NumberMedium27.7%
Hash TableStringBacktracking
Next PermutationMedium27.7%
ArrayTwo Pointers
45. Jump Game IIMedium27.7%
ArrayDynamic ProgrammingGreedy
70. Climbing StairsEasy27.7%
MathDynamic ProgrammingMemoization
152. Maximum Product SubarrayMedium27.7%
ArrayDynamic Programming
Intersection of Two Linked ListsEasy27.7%
Hash TableLinked ListTwo Pointers
Maximal SquareMedium27.7%
ArrayDynamic ProgrammingMatrix
Power of ThreeEasy27.7%
MathRecursion
344. Reverse StringEasy27.7%
Two PointersString
452. Minimum Number of Arrows to Burst BalloonsMedium27.7%
ArrayGreedySorting
23. Merge k Sorted ListsHard27.7%
Linked ListDivide and ConquerHeap (Priority Queue)Merge SortTournament Sort
22. Generate ParenthesesMedium27.7%
StringDynamic ProgrammingBacktrackingBracket Sequences
540. Single Element in a Sorted ArrayMedium27.7%
ArrayBinary Search
412. Fizz BuzzEasy27.7%
MathStringSimulation
918. Maximum Sum Circular SubarrayMedium27.7%
ArrayDivide and ConquerDynamic ProgrammingQueueMonotonic Queue
AlgoMonsterVisit ZapplyCertGarden
Your logo here
Become a sponsor
Buy Me A Coffee