LeetCode The Hard Way

Goldman Sachs

246 problems

ProblemDifficultyFrequency Topics
42. Trapping Rain WaterHard100%
ArrayTwo PointersDynamic ProgrammingStackMonotonic Stack
4. Median of Two Sorted ArraysHard80%
ArrayBinary SearchDivide and Conquer
387. First Unique Character in a StringEasy77.6%
Hash TableStringQueueCounting
1086. High FiveEasy75.8%
ArrayHash TableSortingHeap (Priority Queue)
Fraction to Recurring DecimalMedium75.1%
Hash TableMathString
Minimum Path SumMedium70.3%
ArrayDynamic ProgrammingMatrix
11. Container With Most WaterMedium65.8%
ArrayTwo PointersGreedy
146. LRU CacheMedium65.1%
Hash TableLinked ListDesignDoubly-Linked List
3. Longest Substring Without Repeating CharactersMedium64.4%
Hash TableStringSliding Window
443. String CompressionMedium62.2%
Two PointersString
56. Merge IntervalsMedium60.5%
ArraySortingQuicksort
200. Number of IslandsMedium59.6%
ArrayDepth-First SearchBreadth-First SearchUnion-FindMatrix
33. Search in Rotated Sorted ArrayMedium57.7%
ArrayBinary Search
49. Group AnagramsMedium56.6%
ArrayHash TableStringSorting
1823. Find the Winner of the Circular GameMedium56.6%
ArrayMathRecursionQueueSimulation
121. Best Time to Buy and Sell StockEasy55.5%
ArrayDynamic Programming
1648. Sell Diminishing-Valued Colored BallsMedium55.5%
ArrayMathBinary SearchGreedySortingHeap (Priority Queue)
1. Two SumEasy54.3%
ArrayHash Table
Find Minimum in Rotated Sorted ArrayMedium54.3%
ArrayBinary Search
Longest Palindromic SubsequenceMedium54.3%
StringDynamic Programming
Knight Probability in ChessboardMedium53%
Dynamic Programming
53. Maximum SubarrayMedium51.6%
ArrayDivide and ConquerDynamic Programming
91. Decode WaysMedium51.6%
StringDynamic Programming
2097. Valid Arrangement of PairsHard50.1%
ArrayDepth-First SearchGraph TheoryEulerian CircuitEulerian PathSemi-Eulerian Graph
Robot Return to OriginEasy50.1%
StringSimulation
AlgoMonsterVisit ZapplyCertGarden
Your logo here
Become a sponsor
Buy Me A Coffee