LeetCode The Hard Way

Uber

336 problems

ProblemDifficultyFrequency Topics
2. Add Two NumbersMedium21.7%
Linked ListMathRecursion
3. Longest Substring Without Repeating CharactersMedium21.7%
Hash TableStringSliding Window
11. Container With Most WaterMedium21.7%
ArrayTwo PointersGreedy
20. Valid ParenthesesEasy21.7%
StringStackBracket Sequences
53. Maximum SubarrayMedium21.7%
ArrayDivide and ConquerDynamic Programming
Minimum Path SumMedium21.7%
ArrayDynamic ProgrammingMatrix
215. Kth Largest Element in an ArrayMedium21.7%
ArrayDivide and ConquerSortingHeap (Priority Queue)Quickselect
The Skyline ProblemHard21.7%
ArrayDivide and ConquerBinary Indexed TreeSegment TreeSweep LineSortingHeap (Priority Queue)Ordered Set
286. Walls and GatesMedium21.7%
ArrayBreadth-First SearchMatrix
329. Longest Increasing Path in a MatrixHard21.7%
ArrayDynamic ProgrammingDepth-First SearchBreadth-First SearchGraph TheoryTopological SortMemoizationMatrixDirected Acyclic Graph
496. Next Greater Element IEasy21.7%
ArrayHash TableStackMonotonic Stack
560. Subarray Sum Equals KMedium21.7%
ArrayHash TablePrefix Sum
Find K Closest ElementsMedium21.7%
ArrayTwo PointersBinary SearchSliding WindowSortingHeap (Priority Queue)
Candy CrushMedium21.7%
ArrayTwo PointersMatrixSimulation
785. Is Graph Bipartite?Medium21.7%
Depth-First SearchBreadth-First SearchUnion-FindGraph TheoryGraph ColoringBipartite Graph
983. Minimum Cost For TicketsMedium21.7%
ArrayDynamic Programming
1011. Capacity To Ship Packages Within D DaysMedium21.7%
ArrayBinary Search
Amount of New Area Painted Each DayHard21.7%
ArraySegment TreeOrdered Set
2251. Number of Flowers in Full BloomHard21.7%
ArrayHash TableBinary SearchSortingPrefix SumOrdered Set
3043. Find the Length of the Longest Common PrefixMedium21.7%
ArrayHash TableStringTrie
1472. Design Browser HistoryMedium21.7%
ArrayLinked ListStackDesignDoubly-Linked ListData Stream
Word Ladder IIHard21.7%
Hash TableStringBacktrackingBreadth-First SearchBidirectional Search
Meeting RoomsEasy21.7%
ArraySortingQuicksort
895. Maximum Frequency StackHard21.7%
Hash TableStackDesignOrdered Set
Count Different Palindromic SubsequencesHard21.7%
StringDynamic Programming
AlgoMonsterVisit ZapplyCertGarden
Your logo here
Become a sponsor
Buy Me A Coffee