LeetCode The Hard Way

Bloomberg

1239 problems

ProblemDifficultyFrequency Topics
1760. Minimum Limit of Balls in a BagMedium24.7%
ArrayBinary Search
1652. Defuse the BombEasy24.7%
ArraySliding Window
Two Sum IV - Input is a BSTEasy24.7%
Hash TableTwo PointersTreeDepth-First SearchBreadth-First SearchBinary Search TreeBinary Tree
Primary Department for Each EmployeeEasy24.7%
Database
3174. Clear DigitsEasy24.7%
StringStackSimulation
Valid NumberHard24.7%
String
Find Root of N-Ary TreeMedium24.7%
Hash TableBit ManipulationTreeDepth-First Search
863. All Nodes Distance K in Binary TreeMedium24.7%
Hash TableTreeDepth-First SearchBreadth-First SearchBinary Tree
781. Rabbits in ForestMedium24.7%
ArrayHash TableMathGreedy
Longest Palindromic SubsequenceMedium24.7%
StringDynamic Programming
2040. Kth Smallest Product of Two Sorted ArraysHard24.7%
ArrayBinary Search
973. K Closest Points to OriginMedium24.7%
ArrayMathDivide and ConquerGeometrySortingHeap (Priority Queue)QuickselectK-D Tree
Investments in 2016Medium24.7%
Database
1353. Maximum Number of Events That Can Be AttendedMedium24.7%
ArrayGreedySortingHeap (Priority Queue)
3136. Valid WordEasy24.7%
String
1275. Find Winner on a Tic Tac Toe GameEasy24.7%
ArrayHash TableMatrixSimulation
Trips and UsersHard24.7%
Database
309. Best Time to Buy and Sell Stock with CooldownMedium24.7%
ArrayDynamic Programming
812. Largest Triangle AreaEasy24.7%
ArrayMathGeometryPolygons
2048. Next Greater Numerically Balanced NumberMedium24.7%
Hash TableMathBacktrackingCountingEnumeration
1046. Last Stone WeightEasy24.7%
ArrayHeap (Priority Queue)
Number of Longest Increasing SubsequenceMedium24.7%
ArrayDynamic ProgrammingBinary Indexed TreeSegment TreeLongest Increasing Subsequence
1022. Sum of Root To Leaf Binary NumbersEasy24.7%
TreeDepth-First SearchBinary Tree
2833. Furthest Point From OriginEasy24.7%
StringCounting
Text JustificationHard21.6%
ArrayStringSimulation
AlgoMonsterVisit ZapplyCertGarden
Your logo here
Become a sponsor
Buy Me A Coffee