LeetCode The Hard Way

IBM

166 problems

ProblemDifficultyFrequency Topics
152. Maximum Product SubarrayMedium43.6%
ArrayDynamic Programming
2645. Minimum Additions to Make Valid StringMedium43.6%
StringDynamic ProgrammingStackGreedy
Wiggle Sort IIMedium43.6%
ArrayDivide and ConquerGreedySortingQuickselect
740. Delete and EarnMedium43.6%
ArrayHash TableDynamic Programming
4. Median of Two Sorted ArraysHard34.6%
ArrayBinary SearchDivide and Conquer
169. Majority ElementEasy34.6%
ArrayHash TableDivide and ConquerSortingCountingBoyer–Moore Majority Vote Algorithm
Rotate ArrayMedium34.6%
ArrayMathTwo Pointers
1208. Get Equal Substrings Within BudgetMedium34.6%
StringBinary SearchSliding WindowPrefix Sum
443. String CompressionMedium34.6%
Two PointersString
2432. The Employee That Worked on the Longest TaskEasy34.6%
Array
1834. Single-Threaded CPUMedium34.6%
ArraySortingHeap (Priority Queue)
98. Validate Binary Search TreeMedium34.6%
TreeDepth-First SearchBinary Search TreeBinary Tree
70. Climbing StairsEasy34.6%
MathDynamic ProgrammingMemoization
51. N-QueensHard34.6%
ArrayBacktrackingAlgorithm X
2134. Minimum Swaps to Group All 1's Together IIMedium34.6%
ArraySliding Window
268. Missing NumberEasy34.6%
ArrayHash TableMathBinary SearchBit ManipulationSorting
210. Course Schedule IIMedium34.6%
Depth-First SearchBreadth-First SearchGraph TheoryTopological Sort
767. Reorganize StringMedium34.6%
Hash TableStringGreedySortingHeap (Priority Queue)Counting
1539. Kth Missing Positive NumberEasy34.6%
ArrayBinary Search
1413. Minimum Value to Get Positive Step by Step SumEasy34.6%
ArrayPrefix Sum
Gray CodeMedium34.6%
MathBacktrackingBit Manipulation
67. Add BinaryEasy34.6%
MathStringBit ManipulationSimulation
33. Search in Rotated Sorted ArrayMedium34.6%
ArrayBinary Search
350. Intersection of Two Arrays IIEasy34.6%
ArrayHash TableTwo PointersBinary SearchSorting
79. Word SearchMedium34.6%
ArrayStringBacktrackingDepth-First SearchMatrix
AlgoMonsterVisit ZapplyCertGarden
Your logo here
Become a sponsor
Buy Me A Coffee