LeetCode The Hard Way

Yandex

120 problems

ProblemDifficultyFrequency Topics
Allow One Function CallEasy36%
—
Maximum Average Subarray IEasy36%
ArraySliding Window
Evaluate Reverse Polish NotationMedium36%
ArrayMathStack
9. Palindrome NumberEasy36%
Math
98. Validate Binary Search TreeMedium28.4%
TreeDepth-First SearchBinary Search TreeBinary Tree
235. Lowest Common Ancestor of a Binary Search TreeMedium28.4%
TreeDepth-First SearchBinary Search TreeBinary TreeBinary LiftingLowest Common Ancestor
350. Intersection of Two Arrays IIEasy28.4%
ArrayHash TableTwo PointersBinary SearchSorting
523. Continuous Subarray SumMedium28.4%
ArrayHash TableMathPrefix SumPigeonhole Principle
4SumMedium28.4%
ArrayTwo PointersSorting
322. Coin ChangeMedium28.4%
ArrayDynamic ProgrammingBreadth-First SearchKnapsack ProblemComplete Knapsack
2570. Merge Two 2D Arrays by Summing ValuesEasy28.4%
ArrayHash TableTwo Pointers
Implement Rand10() Using Rand7()Medium28.4%
MathRejection SamplingRandomizedProbability and Statistics
1656. Design an Ordered StreamEasy28.4%
ArrayHash TableDesignData Stream
739. Daily TemperaturesMedium28.4%
ArrayStackMonotonic Stack
295. Find Median from Data StreamHard28.4%
Two PointersDesignSortingHeap (Priority Queue)Data Stream
Add StringsEasy28.4%
MathStringSimulation
24. Swap Nodes in PairsMedium28.4%
Linked ListRecursion
141. Linked List CycleEasy28.4%
Hash TableLinked ListTwo PointersFloyd's Cycle Finding Algorithm
Create Hello World FunctionEasy28.4%
—
Sliding Window MaximumHard28.4%
ArrayQueueSliding WindowHeap (Priority Queue)Monotonic QueueRange Minimum/Maximum Query
Counter IIEasy28.4%
—
35. Search Insert PositionEasy28.4%
ArrayBinary Search
1496. Path CrossingEasy28.4%
Hash TableString
994. Rotting OrangesMedium28.4%
ArrayBreadth-First SearchMatrix
Employees Earning More Than Their ManagersEasy28.4%
Database
AlgoMonsterVisit ZapplyCertGarden
Your logo here
Become a sponsor
Buy Me A Coffee