LeetCode The Hard Way

IXL

17 problems

ProblemDifficultyFrequency Topics
Range Addition IIEasy100%
ArrayMath
295. Find Median from Data StreamHard94.7%
Two PointersDesignSortingHeap (Priority Queue)Data Stream
234. Palindrome Linked ListEasy92.6%
Linked ListTwo PointersStackRecursion
23. Merge k Sorted ListsHard90.2%
Linked ListDivide and ConquerHeap (Priority Queue)Merge SortTournament Sort
Fraction to Recurring DecimalMedium90.2%
Hash TableMathString
Stickers to Spell WordHard90.2%
ArrayHash TableStringDynamic ProgrammingBacktrackingBit ManipulationMemoizationBitmask
56. Merge IntervalsMedium87.6%
ArraySortingQuicksort
Fraction Addition and SubtractionMedium87.6%
MathStringSimulationEuclidean AlgorithmGreatest Common Divisor
Find the Derangement of An ArrayMedium87.6%
MathDynamic ProgrammingCombinatorics
Basic Calculator IIMedium77.2%
MathStringStack
Insert Delete GetRandom O(1)Medium72.3%
ArrayHash TableMathDesignRandomized
162. Find Peak ElementMedium72.3%
ArrayBinary Search
1465. Maximum Area of a Piece of Cake After Horizontal and Vertical CutsMedium65.9%
ArrayGreedySorting
1-bit and 2-bit CharactersEasy65.9%
Array
Design Snake GameMedium57%
ArrayHash TableDesignQueueSimulation
1347. Minimum Number of Steps to Make Two Strings AnagramMedium57%
Hash TableStringCounting
207. Course ScheduleMedium57%
Depth-First SearchBreadth-First SearchGraph TheoryTopological SortDirected Acyclic Graph
AlgoMonsterVisit ZapplyCertGarden
Your logo here
Become a sponsor
Buy Me A Coffee