LeetCode The Hard Way

MathWorks

27 problems

ProblemDifficultyFrequency Topics
2462. Total Cost to Hire K WorkersMedium100%
ArrayTwo PointersHeap (Priority Queue)Simulation
1648. Sell Diminishing-Valued Colored BallsMedium100%
ArrayMathBinary SearchGreedySortingHeap (Priority Queue)
2861. Maximum Number of AlloysMedium97.9%
ArrayBinary Search
3035. Maximum Palindromes After OperationsMedium95.5%
ArrayHash TableStringGreedySortingCounting
968. Binary Tree CamerasHard95.5%
Dynamic ProgrammingTreeDepth-First SearchBinary TreeDP on Trees
Shopping OffersMedium95.5%
ArrayDynamic ProgrammingBacktrackingBit ManipulationMemoizationBitmaskKnapsack ProblemComplete Knapsack
Reshape the MatrixEasy92.9%
ArrayMatrixSimulation
2514. Count AnagramsHard90%
Hash TableMathStringCombinatoricsCountingFermat's Little Theorem
2038. Remove Colored Pieces if Both Neighbors are the Same ColorMedium90%
MathStringGreedyGame Theory
1163. Last Substring in Lexicographical OrderHard90%
Two PointersStringLyndon Factorization
1130. Minimum Cost Tree From Leaf ValuesMedium90%
ArrayDynamic ProgrammingStackGreedyMonotonic StackCartesian Tree
3049. Earliest Second to Mark Indices IIHard90%
ArrayBinary SearchGreedyHeap (Priority Queue)
3048. Earliest Second to Mark Indices IMedium90%
ArrayBinary Search
Keyboard RowEasy90%
ArrayHash TableString
2444. Count Subarrays With Fixed BoundsHard73%
ArrayQueueSliding WindowMonotonic Queue
2582. Pass the PillowEasy73%
MathSimulation
2918. Minimum Equal Sum of Two Arrays After Replacing ZerosMedium73%
ArrayGreedy
2858. Minimum Edge Reversals So Every Node Is ReachableHard65.9%
Dynamic ProgrammingDepth-First SearchBreadth-First SearchGraph Theory
621. Task SchedulerMedium65.9%
ArrayHash TableGreedySortingHeap (Priority Queue)Counting
25. Reverse Nodes in k-GroupHard56%
Linked ListRecursion
Number of Divisible Triplet SumsMedium56%
ArrayHash Table
2559. Count Vowel Strings in RangesMedium56%
ArrayStringPrefix Sum
2697. Lexicographically Smallest PalindromeEasy56%
Two PointersStringGreedy
1220. Count Vowels PermutationHard56%
Dynamic Programming
20. Valid ParenthesesEasy56%
StringStackBracket Sequences
AlgoMonsterVisit ZapplyCertGarden
Your logo here
Become a sponsor
Buy Me A Coffee