LeetCode The Hard Way

Bloomberg

1239 problems

ProblemDifficultyFrequency Topics
907. Sum of Subarray MinimumsMedium37.3%
ArrayDynamic ProgrammingStackMonotonic Stack
1021. Remove Outermost ParenthesesEasy37.3%
StringStackBracket Sequences
Number of Digit OneHard37.3%
MathDynamic ProgrammingRecursion
869. Reordered Power of 2Medium37.3%
Hash TableMathSortingCountingEnumeration
Partition ListMedium35.7%
Linked ListTwo Pointers
113. Path Sum IIMedium35.7%
BacktrackingTreeDepth-First SearchBinary Tree
115. Distinct SubsequencesHard35.7%
StringDynamic Programming
Excel Sheet Column TitleEasy35.7%
MathString
Perfect SquaresMedium35.7%
MathDynamic ProgrammingBreadth-First SearchKnapsack ProblemComplete Knapsack
Range Sum Query - ImmutableEasy35.7%
ArrayDesignPrefix Sum
Design Hit CounterMedium35.7%
ArrayBinary SearchDesignQueueData Stream
392. Is SubsequenceEasy35.7%
Two PointersStringDynamic Programming
Employee BonusEasy35.7%
Database
678. Valid Parenthesis StringMedium35.7%
StringDynamic ProgrammingStackGreedyBracket Sequences
Immediate Food Delivery IIMedium35.7%
Database
1207. Unique Number of OccurrencesEasy35.7%
ArrayHash Table
Dot Product of Two Sparse VectorsMedium35.7%
ArrayHash TableTwo PointersDesignLinear Algebra
Customer Who Visited but Did Not Make Any TransactionsEasy35.7%
Database
Find if Path Exists in GraphEasy35.7%
Depth-First SearchBreadth-First SearchUnion-FindGraph Theory
2235. Add Two IntegersEasy35.7%
Math
Product Price at a Given DateMedium35.7%
Database
2461. Maximum Sum of Distinct Subarrays With Length KMedium35.7%
ArrayHash TableSliding Window
77. CombinationsMedium34%
Backtracking
Single Number IIMedium34%
ArrayBit Manipulation
Consecutive NumbersMedium34%
Database
AlgoMonsterVisit ZapplyCertGarden
Your logo here
Become a sponsor
Buy Me A Coffee