AlgorithmsTracksAdvancedAdvanced1D dynamic programming, Backtracking, Heap, and Hard problems that mix several topics.AllEasyMediumHardAll topicsHash MapTwo PointersSliding WindowStackLinked ListPrefix SumBinary SearchBFS (Breadth-First Search)DFS (Depth-First Search)Intervals1D Dynamic ProgrammingGreedyBacktrackingHeap11D dynamic programming ~105 minEasy 15 minClimbing StairsMedium 25 minHouse RobberMedium 35 minLongest Increasing SubsequenceMedium 30 minWord Break2Backtracking ~80 minMedium 25 minSubsetsMedium 25 minPermutationsMedium 30 minCombination Sum3Heap — priority queue ~80 minMedium 20 minKth Largest Element in an ArrayHard 30 minMerge K Sorted ListsHard 30 minFind Median from Data Stream4Mixed Hard problems ~140 minHard 40 minWord LadderHard 30 minTrapping Rain WaterMedium 25 minSearch in Rotated Sorted ArrayMedium 20 minFind Minimum in Rotated Sorted ArrayMedium 25 minTop K Frequent Elements
