LeetCode The Hard Way

General Motors

14 problems

ProblemDifficultyFrequency Topics
323. Number of Connected Components in an Undirected GraphMedium100%
Depth-First SearchBreadth-First SearchUnion-FindGraph Theory
4009. Minimum Possible Maximum Waiting TimeHard78.8%
ArrayDynamic ProgrammingMemoization
1404. Number of Steps to Reduce a Number in Binary Representation to OneMedium69.7%
StringBit ManipulationSimulation
Implement Trie (Prefix Tree)Medium65.4%
Hash TableStringDesignTrie
56. Merge IntervalsMedium65.4%
ArraySortingQuicksort
146. LRU CacheMedium59.9%
Hash TableLinked ListDesignDoubly-Linked List
Minimum Path SumMedium59.9%
ArrayDynamic ProgrammingMatrix
Dot Product of Two Sparse VectorsMedium59.9%
ArrayHash TableTwo PointersDesignLinear Algebra
Maximum Sum of 3 Non-Overlapping SubarraysHard59.9%
ArrayDynamic ProgrammingSliding WindowPrefix Sum
First Missing PositiveHard52.1%
ArrayHash Table
297. Serialize and Deserialize Binary TreeHard52.1%
StringTreeDepth-First SearchBreadth-First SearchDesignBinary Tree
843. Guess the WordHard52.1%
ArrayMathStringMinimaxInteractiveGame Theory
1647. Minimum Deletions to Make Character Frequencies UniqueMedium52.1%
Hash TableStringGreedySorting
200. Number of IslandsMedium52.1%
ArrayDepth-First SearchBreadth-First SearchUnion-FindMatrix
AlgoMonsterVisit ZapplyCertGarden
Your logo here
Become a sponsor
Buy Me A Coffee