1Text JustificationHardArrayStringSimulation
Solve → 2Text JustificationHardArrayStringSimulation
Solve → 3Top K Frequent WordsMediumArrayHash TableString
Solve → 4Restore the Array From Adjacent PairsMediumArrayHash TableDepth-First Search
Solve → 5Ways to Split Array Into Three SubarraysMediumArrayTwo PointersBinary Search
Solve → 6Text JustificationHardArrayStringSimulation
Solve → 7MinesweeperMediumArrayDepth-First SearchBreadth-First Search
Solve → 8Top K Frequent ElementsMediumArrayHash TableDivide and Conquer
Solve → 9Number of Orders in the BacklogMediumArrayHeap (Priority Queue)Simulation
Solve → 10Check if There is a Valid Path in a GridMediumArrayDepth-First SearchBreadth-First Search
Solve → 11Count Good MealsMediumArrayHash Table
Solve → 12Count the Number of Consistent StringsEasyArrayHash TableString
Solve → 13Brightest Position on StreetMediumArraySortingPrefix Sum
Solve → 14Employee ImportanceMediumArrayHash TableTree
Solve → 15Ways to Split Array Into Three SubarraysMediumArrayTwo PointersBinary Search
Solve → 16Restore the Array From Adjacent PairsMediumArrayHash TableDepth-First Search
Solve → 17Brightest Position on StreetMediumArraySortingPrefix Sum
Solve → 18Count Good MealsMediumArrayHash Table
Solve → 19Number of Orders in the BacklogMediumArrayHeap (Priority Queue)Simulation
Solve → 20Check if There is a Valid Path in a GridMediumArrayDepth-First SearchBreadth-First Search
Solve → 21Count the Number of Consistent StringsEasyArrayHash TableString
Solve → 22Top K Frequent WordsMediumArrayHash TableString
Solve → 23Text JustificationHardArrayStringSimulation
Solve → 24MinesweeperMediumArrayDepth-First SearchBreadth-First Search
Solve → 25Top K Frequent ElementsMediumArrayHash TableDivide and Conquer
Solve → 26Employee ImportanceMediumArrayHash TableTree
Solve → 27Best Time to Buy and Sell StockEasyArrayDynamic Programming
Solve →