LeetCode The Hard Way

Oracle

282 problems

ProblemDifficultyFrequency Topics
605. Can Place FlowersEasy26.6%
ArrayGreedy
Basic Calculator IIIHard26.6%
MathStringStackRecursion
Cache With Time LimitMedium26.6%
—
2055. Plates Between CandlesMedium26.6%
ArrayStringBinary SearchPrefix Sum
Create Maximum NumberHard26.6%
ArrayTwo PointersStackGreedyMonotonic Stack
Nested List Weight SumMedium26.6%
Depth-First SearchBreadth-First Search
Remove Invalid ParenthesesHard26.6%
StringBacktrackingBreadth-First Search
1824. Minimum Sideway JumpsMedium26.6%
ArrayDynamic ProgrammingGreedy
Largest Divisible SubsetMedium26.6%
ArrayMathDynamic ProgrammingSorting
104. Maximum Depth of Binary TreeEasy26.6%
TreeDepth-First SearchBreadth-First SearchBinary Tree
Multiply StringsMedium26.6%
MathStringSimulation
Sparse Matrix MultiplicationMedium26.6%
ArrayHash TableMatrixLinear Algebra
Next Greater Element IIIMedium26.6%
MathTwo PointersString
2439. Minimize Maximum of ArrayMedium26.6%
ArrayBinary SearchDynamic ProgrammingGreedyPrefix Sum
1071. Greatest Common Divisor of StringsEasy26.6%
MathStringEuclidean AlgorithmGreatest Common Divisor
CandyHard26.6%
ArrayGreedy
3Sum SmallerMedium26.6%
ArrayTwo PointersBinary SearchSorting
1768. Merge Strings AlternatelyEasy26.6%
Two PointersString
1248. Count Number of Nice SubarraysMedium26.6%
ArrayHash TableMathSliding WindowPrefix Sum
Evaluate Reverse Polish NotationMedium26.6%
ArrayMathStack
2181. Merge Nodes in Between ZerosMedium26.6%
Linked ListSimulation
Encode and Decode StringsMedium26.6%
ArrayStringDesign
1312. Minimum Insertion Steps to Make a String PalindromeHard26.6%
StringDynamic Programming
211. Design Add and Search Words Data StructureMedium26.6%
StringDepth-First SearchDesignTrie
Boundary of Binary TreeMedium26.6%
TreeDepth-First SearchBinary Tree
AlgoMonsterVisit ZapplyCertGarden
Your logo here
Become a sponsor
Buy Me A Coffee