LeetCode The Hard Way

Uber

336 problems

ProblemDifficultyFrequency Topics
2008. Maximum Earnings From TaxiMedium35.4%
ArrayHash TableBinary SearchDynamic ProgrammingSorting
2115. Find All Possible Recipes from Given SuppliesMedium35.4%
ArrayHash TableStringGraph TheoryTopological SortDirected Acyclic Graph
974. Subarray Sums Divisible by KMedium35.4%
ArrayHash TablePrefix Sum
258. Add DigitsEasy35.4%
MathSimulationNumber Theory
365. Water and Jug ProblemMedium35.4%
MathDepth-First SearchBreadth-First SearchBézout's LemmaEuclidean AlgorithmGreatest Common DivisorExtended Euclidean Algorithm
Brightest Position on StreetMedium35.4%
ArraySortingPrefix SumOrdered Set
788. Rotated DigitsMedium35.4%
MathDynamic Programming
2101. Detonate the Maximum BombsMedium35.4%
ArrayMathDepth-First SearchBreadth-First SearchGraph TheoryGeometry
Simplify PathMedium35.4%
StringStack
2197. Replace Non-Coprime Numbers in ArrayHard35.4%
ArrayMathStackNumber TheoryLeast Common MultipleGreatest Common Divisor
1235. Maximum Profit in Job SchedulingHard35.4%
ArrayBinary SearchDynamic ProgrammingSorting
1353. Maximum Number of Events That Can Be AttendedMedium35.4%
ArrayGreedySortingHeap (Priority Queue)
864. Shortest Path to Get All KeysHard35.4%
ArrayBit ManipulationBreadth-First SearchMatrix
2861. Maximum Number of AlloysMedium35.4%
ArrayBinary Search
3367. Maximize Sum of Weights after Edge RemovalsHard35.4%
Dynamic ProgrammingTreeDepth-First SearchSorting
Next PermutationMedium29.5%
ArrayTwo Pointers
Longest Valid ParenthesesHard29.5%
StringDynamic ProgrammingStackBracket Sequences
Sqrt(x)Easy29.5%
MathBinary SearchNewton's Method
Longest Consecutive SequenceMedium29.5%
ArrayHash TableUnion-Find
Find Minimum in Rotated Sorted ArrayMedium29.5%
ArrayBinary Search
283. Move ZeroesEasy29.5%
ArrayTwo Pointers
773. Sliding PuzzleHard29.5%
ArrayDynamic ProgrammingBacktrackingBreadth-First SearchMemoizationMatrixHeuristic SearchBidirectional SearchA* Search
787. Cheapest Flights Within K StopsMedium29.5%
Dynamic ProgrammingDepth-First SearchBreadth-First SearchGraph TheoryHeap (Priority Queue)Shortest Path
802. Find Eventual Safe StatesMedium29.5%
Depth-First SearchBreadth-First SearchGraph TheoryTopological SortKosaraju's AlgorithmTarjan's SCC Algorithm
992. Subarrays with K Different IntegersHard29.5%
ArrayHash TableSliding WindowCounting
AlgoMonsterVisit ZapplyCertGarden
Your logo here
Become a sponsor
Buy Me A Coffee