Drill the course
Practice
116 solve-first problems, one list. Search, filter to exactly what you need, and drill it.
Problems
116
In the hub
Solved
0
0% complete
Remaining
116
Still to crack
Showing 116 of 116
- Remove Duplicates from Sorted ArrayArraysEasy
- Move ZeroesArraysEasy
- Best Time to Buy & Sell StockArraysEasy
- Rotate ArrayArraysMedium
- Product of Array Except SelfArraysMedium
- Valid PalindromeStringsEasy
- Valid AnagramStringsEasy
- Longest Common PrefixStringsEasy
- Find the Index (strStr)StringsEasy
- Reverse Words in a StringStringsMedium
- Two SumHash TablesEasy
- Contains Duplicate IIHash TablesEasy
- First Unique CharacterHash TablesEasy
- Group AnagramsHash TablesMedium
- Longest Consecutive SequenceHash TablesMedium
- Reverse Linked ListLinked ListsEasy
- Middle of the Linked ListLinked ListsEasy
- Linked List CycleLinked ListsEasy
- Merge Two Sorted ListsLinked ListsEasy
- Remove Nth Node From EndLinked ListsMedium
- Valid ParenthesesStacksEasy
- Evaluate Reverse Polish NotationStacksMedium
- Min StackStacksMedium
- Daily TemperaturesStacksMedium
- Largest Rectangle in HistogramStacksHard
- Number of Recent CallsQueuesEasy
- Implement Queue Using StacksQueuesEasy
- First Unique in a StreamQueuesMedium
- Sliding Window MaximumQueuesHard
- Two Sum II (Sorted Input)Two PointersMedium
- Sort Colors (Dutch National Flag)Two PointersMedium
- Container With Most WaterTwo PointersMedium
- 3SumTwo PointersMedium
- Trapping Rain WaterTwo PointersHard
- Maximum Average Subarray ISliding WindowEasy
- Minimum Size Subarray SumSliding WindowMedium
- Longest Substring Without Repeating CharactersSliding WindowMedium
- Permutation in StringSliding WindowMedium
- Minimum Window SubstringSliding WindowHard
- Range Sum Query — ImmutablePrefix SumEasy
- Subarray Sum Equals KPrefix SumMedium
- Contiguous ArrayPrefix SumMedium
- Range Sum Query 2D — ImmutablePrefix SumMedium
- Maximum Subarray (Kadane's Algorithm)Prefix SumMedium
- Search Insert PositionBinary SearchEasy
- Find First and Last PositionBinary SearchMedium
- Search in Rotated Sorted ArrayBinary SearchMedium
- Koko Eating BananasBinary SearchMedium
- Find Minimum in Rotated Sorted ArrayBinary SearchMedium
- Sort an ArraySortingMedium
- Merge IntervalsSortingMedium
- Largest NumberSortingMedium
- Meeting Rooms IISortingMedium
- Kth Largest Element in an ArraySortingMedium
- Rotate ImageMatrixMedium
- Spiral MatrixMatrixMedium
- Set Matrix ZeroesMatrixMedium
- Search a 2D MatrixMatrixMedium
- Number of IslandsMatrixMedium
- Word SearchMatrixMedium
- SubsetsRecursionMedium
- PermutationsRecursionMedium
- Combination SumRecursionMedium
- Generate ParenthesesRecursionMedium
- Palindrome PartitioningRecursionMedium
- N-QueensRecursionHard
- Maximum Depth of Binary TreeBinary TreesEasy
- Diameter of Binary TreeBinary TreesEasy
- Binary Tree Level Order TraversalBinary TreesMedium
- Construct Binary Tree from Preorder and Inorder TraversalBinary TreesMedium
- Lowest Common Ancestor of a Binary TreeBinary TreesMedium
- Binary Tree Right Side ViewBinary TreesMedium
- Serialize and Deserialize Binary TreeBinary TreesHard
- Validate Binary Search TreeBSTMedium
- Kth Smallest Element in a BSTBSTMedium
- Lowest Common Ancestor of a BSTBSTMedium
- Insert into a Binary Search TreeBSTMedium
- Delete Node in a BSTBSTMedium
- Convert Sorted Array to Binary Search TreeBSTEasy
- Kth Largest Element in a StreamHeapsEasy
- Top K Frequent ElementsHeapsMedium
- K Closest Points to OriginHeapsMedium
- Merge k Sorted ListsHeapsHard
- Find Median from Data StreamHeapsHard
- Task SchedulerHeapsMedium
- Implement Trie (Prefix Tree)TriesMedium
- Design Add and Search Words Data StructureTriesMedium
- Longest Word in DictionaryTriesMedium
- Word Search IITriesHard
- Meeting RoomsIntervalsEasy
- Insert IntervalIntervalsMedium
- Non-overlapping IntervalsIntervalsMedium
- Minimum Number of Arrows to Burst BalloonsIntervalsMedium
- Employee Free TimeIntervalsHard
- Jump GameGreedyMedium
- Jump Game IIGreedyMedium
- Gas StationGreedyMedium
- Partition LabelsGreedyMedium
- CandyGreedyHard
- Clone GraphGraphsMedium
- Course ScheduleGraphsMedium
- Course Schedule IIGraphsMedium
- Network Delay TimeGraphsMedium
- Number of ProvincesGraphsMedium
- Redundant ConnectionGraphsMedium
- Min Cost to Connect All PointsGraphsMedium
- Climbing StairsDPEasy
- House RobberDPMedium
- Coin ChangeDPMedium
- Longest Increasing SubsequenceDPMedium
- Unique PathsDPMedium
- Longest Common SubsequenceDPMedium
- Edit DistanceDPHard
- Partition Equal Subset SumDPMedium
- Word BreakDPMedium
- House Robber IIIDPMedium