LeetCode The Hard Way

Hudson River Trading

16 problems

ProblemDifficultyFrequency Topics
1566. Detect Pattern of Length M Repeated K or More TimesEasy100%
ArrayEnumeration
1317. Convert Integer to the Sum of Two No-Zero IntegersEasy100%
Math
3225. Maximum Score From Grid OperationsHard100%
ArrayDynamic ProgrammingMatrixPrefix Sum
2275. Largest Combination With Bitwise AND Greater Than ZeroMedium100%
ArrayHash TableBit ManipulationCounting
2508. Add Edges to Make Degrees of All Nodes EvenHard97.1%
Hash TableGraph Theory
2246. Longest Path With Different Adjacent CharactersHard97.1%
ArrayStringTreeDepth-First SearchGraph TheoryTopological Sort
2285. Maximum Total Importance of RoadsMedium97.1%
GreedyGraph TheorySortingHeap (Priority Queue)
1342. Number of Steps to Reduce a Number to ZeroEasy97.1%
MathBit Manipulation
1323. Maximum 69 NumberEasy97.1%
MathGreedy
2772. Apply Operations to Make All Array Elements Equal to ZeroMedium97.1%
ArrayPrefix Sum
2257. Count Unguarded Cells in the GridMedium97.1%
ArrayMatrixSimulation
3161. Block Placement QueriesHard72.6%
ArrayBinary SearchBinary Indexed TreeSegment TreeOrdered Set
14. Longest Common PrefixEasy62.5%
ArrayStringTrie
Text JustificationHard62.5%
ArrayStringSimulation
2502. Design Memory AllocatorMedium62.5%
ArrayHash TableDesignSimulation
Shortest Word DistanceEasy62.5%
ArrayString
AlgoMonsterVisit ZapplyCertGarden
Your logo here
Become a sponsor
Buy Me A Coffee