LeetCode The Hard Way

Amazon

2015 problems

ProblemDifficultyFrequency Topics
Remove BoxesHard7.2%
ArrayDynamic ProgrammingMemoization
1297. Maximum Number of Occurrences of a SubstringMedium7.2%
Hash TableStringSliding Window
3516. Find Closest PersonEasy7.2%
Math
3541. Find Most Frequent Vowel and ConsonantEasy7.2%
Hash TableStringCounting
1935. Maximum Number of Words You Can TypeEasy7.2%
Hash TableString
2544. Alternating Digit SumEasy7.2%
Math
3370. Smallest Number With All Set BitsEasy7.2%
MathBit Manipulation
2421. Number of Good PathsHard7.2%
ArrayHash TableTreeUnion-FindGraph TheorySorting
3428. Maximum and Minimum Sums of at Most Size K SubsequencesMedium7.2%
ArrayMathDynamic ProgrammingSortingCombinatorics
1578. Minimum Time to Make Rope ColorfulMedium7.2%
ArrayStringDynamic ProgrammingGreedy
2169. Count Operations to Obtain ZeroEasy7.2%
MathSimulation
2654. Minimum Number of Operations to Make All Array Elements Equal to 1Medium7.2%
ArrayMathNumber TheoryEuclidean AlgorithmGreatest Common Divisor
3228. Maximum Number of Operations to Move Ones to the EndMedium7.2%
StringGreedyCounting
3190. Find Minimum Operations to Make All Elements Divisible by ThreeEasy7.2%
ArrayMath
2435. Paths in Matrix Whose Sum Is Divisible by KHard7.2%
ArrayDynamic ProgrammingMatrix
1776. Car Fleet IIHard7.2%
ArrayMathStackHeap (Priority Queue)Monotonic Stack
1399. Count Largest GroupEasy7.2%
Hash TableMathCounting
Find Followers CountEasy7.2%
Database
Smallest Good BaseHard7.2%
MathBinary Search
2843. Count Symmetric IntegersEasy7.2%
MathEnumeration
2498. Frog Jump IIMedium7.2%
ArrayBinary SearchGreedy
3013. Divide an Array Into Subarrays With Minimum Cost IIHard7.2%
ArrayHash TableSliding WindowHeap (Priority Queue)
Non-negative Integers without Consecutive OnesHard7.2%
Dynamic Programming
2383. Minimum Hours of Training to Win a CompetitionEasy7.2%
ArrayGreedy
3721. Longest Balanced Subarray IIHard7.2%
ArrayHash TableDivide and ConquerSegment TreePrefix Sum
AlgoMonsterVisit ZapplyCertGarden
Your logo here
Become a sponsor
Buy Me A Coffee