LeetCode The Hard Way

Walmart Labs

135 problems

ProblemDifficultyFrequency Topics
283. Move ZeroesEasy52.9%
ArrayTwo Pointers
90. Subsets IIMedium52.9%
ArrayBacktrackingBit Manipulation
300. Longest Increasing SubsequenceMedium52.9%
ArrayBinary SearchDynamic ProgrammingLongest Increasing Subsequence
2461. Maximum Sum of Distinct Subarrays With Length KMedium52.9%
ArrayHash TableSliding Window
The MazeMedium52.9%
ArrayDepth-First SearchBreadth-First SearchMatrix
1209. Remove All Adjacent Duplicates in String IIMedium52.9%
StringStack
Next Greater Element IIIMedium52.9%
MathTwo PointersString
2402. Meeting Rooms IIIHard52.9%
ArrayHash TableSortingHeap (Priority Queue)Simulation
CandyHard52.9%
ArrayGreedy
287. Find the Duplicate NumberMedium52.9%
ArrayTwo PointersBinary SearchBit ManipulationPigeonhole PrincipleFloyd's Cycle Finding Algorithm
Sliding Window MaximumHard52.9%
ArrayQueueSliding WindowHeap (Priority Queue)Monotonic QueueRange Minimum/Maximum Query
25. Reverse Nodes in k-GroupHard42.5%
Linked ListRecursion
Pow(x, n)Medium42.5%
MathRecursion
67. Add BinaryEasy42.5%
MathStringBit ManipulationSimulation
238. Product of Array Except SelfMedium42.5%
ArrayPrefix Sum
Flatten Nested List IteratorMedium42.5%
StackTreeDepth-First SearchDesignQueueIterator
739. Daily TemperaturesMedium42.5%
ArrayStackMonotonic Stack
1143. Longest Common SubsequenceMedium42.5%
StringDynamic ProgrammingLongest Common Subsequence
525. Contiguous ArrayMedium42.5%
ArrayHash TablePrefix Sum
57. Insert IntervalMedium42.5%
Array
Search in Rotated Sorted Array IIMedium42.5%
ArrayBinary Search
TriangleMedium42.5%
ArrayDynamic Programming
40. Combination Sum IIMedium42.5%
ArrayBacktracking
Count Different Palindromic SubsequencesHard42.5%
StringDynamic Programming
152. Maximum Product SubarrayMedium42.5%
ArrayDynamic Programming
AlgoMonsterVisit ZapplyCertGarden
Your logo here
Become a sponsor
Buy Me A Coffee