LeetCode The Hard Way

Microsoft

1371 problems

ProblemDifficultyFrequency Topics
112. Path SumEasy38.7%
TreeDepth-First SearchBreadth-First SearchBinary Tree
Single Number IIMedium38.7%
ArrayBit Manipulation
The Skyline ProblemHard38.7%
ArrayDivide and ConquerBinary Indexed TreeSegment TreeSweep LineSortingHeap (Priority Queue)Ordered Set
Perfect SquaresMedium38.7%
MathDynamic ProgrammingBreadth-First SearchKnapsack ProblemComplete Knapsack
Insert Delete GetRandom O(1)Medium38.7%
ArrayHash TableMathDesignRandomized
392. Is SubsequenceEasy38.7%
Two PointersStringDynamic Programming
494. Target SumMedium38.7%
ArrayDynamic ProgrammingBacktrackingKnapsack Problem0-1 Knapsack
647. Palindromic SubstringsMedium38.7%
Two PointersStringDynamic Programming
852. Peak Index in a Mountain ArrayMedium38.7%
ArrayBinary SearchTernary Search
1092. Shortest Common Supersequence Hard38.7%
StringDynamic ProgrammingLongest Common Subsequence
Average Selling PriceEasy38.7%
Database
1423. Maximum Points You Can Obtain from CardsMedium38.7%
ArraySliding WindowPrefix Sum
1752. Check if Array Is Sorted and RotatedEasy38.7%
Array
3139. Minimum Cost to Equalize ArrayHard38.7%
ArrayGreedyEnumeration
Count Binary SubstringsEasy38.7%
Two PointersString
1353. Maximum Number of Events That Can Be AttendedMedium38.7%
ArrayGreedySortingHeap (Priority Queue)
40. Combination Sum IIMedium37.5%
ArrayBacktracking
Spiral Matrix IIMedium37.5%
ArrayMatrixSimulation
Evaluate Reverse Polish NotationMedium37.5%
ArrayMathStack
231. Power of TwoEasy37.5%
MathBit ManipulationRecursion
Add Two Numbers IIMedium37.5%
Linked ListMathStack
Managers with at Least 5 Direct ReportsMedium37.5%
Database
796. Rotate StringEasy37.5%
StringString Matching
977. Squares of a Sorted ArrayEasy37.5%
ArrayTwo PointersSorting
1071. Greatest Common Divisor of StringsEasy37.5%
MathStringEuclidean AlgorithmGreatest Common Divisor
AlgoMonsterVisit ZapplyCertGarden
Your logo here
Become a sponsor
Buy Me A Coffee