LeetCode The Hard Way

WorldQuant

4 problems

ProblemDifficultyFrequency Topics
Meeting Rooms IIMedium100%
ArrayTwo PointersGreedySortingHeap (Priority Queue)Prefix Sum
2617. Minimum Number of Visited Cells in a GridHard82.8%
ArrayDynamic ProgrammingStackBreadth-First SearchUnion-FindHeap (Priority Queue)MatrixMonotonic Stack
295. Find Median from Data StreamHard82.8%
Two PointersDesignSortingHeap (Priority Queue)Data Stream
Maximal RectangleHard82.8%
ArrayDynamic ProgrammingStackMatrixMonotonic Stack
AlgoMonsterVisit ZapplyCertGarden
Your logo here
Become a sponsor
Buy Me A Coffee