LeetCode The Hard Way

Bloomberg

1239 problems

ProblemDifficultyFrequency Topics
3347. Maximum Frequency of an Element After Performing Operations IIHard8.3%
ArrayBinary SearchSliding WindowSortingPrefix Sum
1925. Count Square Sum TriplesEasy8.3%
MathEnumeration
3776. Minimum Moves to Balance Circular ArrayMedium8.3%
ArrayGreedySorting
955. Delete Columns to Make Sorted IIMedium8.3%
ArrayStringGreedy
2124. Check if All A's Appears Before All B'sEasy8.3%
String
Circular Array LoopMedium8.3%
ArrayHash TableTwo PointersFloyd's Cycle Finding Algorithm
2421. Number of Good PathsHard8.3%
ArrayHash TableTreeUnion-FindGraph TheorySorting
3074. Apple Redistribution into BoxesEasy8.3%
ArrayGreedySorting
Analyze Subscription Conversion Medium8.3%
Database
2402. Meeting Rooms IIIHard8.3%
ArrayHash TableSortingHeap (Priority Queue)Simulation
3469. Find Minimum Cost to Remove Array ElementsMedium8.3%
ArrayDynamic Programming
Mini ParserMedium8.3%
StringStackDepth-First Search
967. Numbers With Same Consecutive DifferencesMedium8.3%
BacktrackingBreadth-First Search
377. Combination Sum IVMedium8.3%
ArrayDynamic Programming
1458. Max Dot Product of Two SubsequencesHard8.3%
ArrayDynamic ProgrammingLongest Common Subsequence
Arithmetic Slices II - SubsequenceHard8.3%
ArrayDynamic Programming
Total Hamming DistanceMedium8.3%
ArrayMathBit Manipulation
3649. Number of Perfect PairsMedium8.3%
ArrayMathTwo PointersSorting
3314. Construct the Minimum Bitwise Array IEasy8.3%
ArrayBit Manipulation
Root Equals Sum of ChildrenEasy8.3%
TreeBinary Tree
3650. Minimum Cost Path with Edge ReversalsMedium8.3%
Graph TheoryHeap (Priority Queue)Shortest Path
2716. Minimize String LengthEasy8.3%
Hash TableString
1026. Maximum Difference Between Node and AncestorMedium8.3%
TreeDepth-First SearchBinary Tree
833. Find And Replace in StringMedium8.3%
ArrayHash TableStringSorting
868. Binary GapEasy8.3%
Bit Manipulation
AlgoMonsterVisit ZapplyCertGarden
Your logo here
Become a sponsor
Buy Me A Coffee