1776.Car Fleet II
HardArrayHeap (Priority Queue)Math58.4% acceptance3 companiesVideo
Hard · 504 results
1782.Count Pairs Of Nodes
HardArrayBinary SearchGraph43.3% acceptance1 companyVideo
1787.Make the XOR of All Segments Equal to Zero
HardArrayBit ManipulationDynamic Programming41.1% acceptance2 companiesVideo
1788.Maximize the Beauty of the Garden
HardArrayGreedyHash Table62.8% acceptance1 companyPremium elsewhere, free hereVideo
1793.Maximum Score of a Good Subarray
HardArrayBinary SearchMonotonic Stack64.3% acceptance2 companiesVideo
1799.Maximize Score After N Operations
HardArrayBacktrackingBit Manipulation57.8% acceptance2 companiesVideo
1803.Count Pairs With XOR in a Range
HardArrayBit ManipulationTrie46.9% acceptance1 companyVideo
1815.Maximum Number of Groups Getting Fresh Donuts
HardArrayBit ManipulationBitmask41.7% acceptance1 companyVideo
1819.Number of Different Subsequences GCDs
HardArrayCountingMath47.2% acceptance2 companiesVideo
1835.Find XOR Sum of All Pairs Bitwise AND
HardArrayBit ManipulationMath62.6% acceptance1 companyVideo
1840.Maximum Building Height
HardArrayMathSorting67.1% acceptance6 companiesVideo
1847.Closest Room
HardArrayBinary SearchOrdered Set41.9% acceptance1 companyVideo
1851.Minimum Interval to Include Each Query
HardArrayBinary SearchHeap (Priority Queue)55.4% acceptance3 companiesVideo
1862.Sum of Floored Pairs
HardArrayBinary SearchMath31.4% acceptanceVideo
1872.Stone Game VIII
HardArrayDynamic ProgrammingGame Theory75.2% acceptance1 companyVideo
1879.Minimum XOR Sum of Two Arrays
HardArrayBit ManipulationBitmask52.0% acceptance1 companyVideo
1883.Minimum Skips to Arrive at Meeting On Time
HardArrayDynamic Programming38.9% acceptance1 companyVideo
1889.Minimum Space Wasted From Packaging
HardArrayBinary SearchPrefix Sum33.6% acceptance3 companiesVideo
1912.Design Movie Rental System
HardArrayDesignHash Table62.5% acceptance2 companiesVideo
1923.Longest Common Subpath
HardArrayBinary SearchHash Function30.7% acceptance1 companyVideo
1928.Minimum Cost to Reach Destination in Time
HardArrayDynamic ProgrammingGraph42.6% acceptance6 companiesVideo
1938.Maximum Genetic Difference Query
HardArrayBit ManipulationDepth-First Search48.6% acceptance1 companyVideo
1944.Number of Visible People in a Queue
HardArrayMonotonic StackStack73.3% acceptance17 companiesVideo
1948.Delete Duplicate Folders in System
HardArrayHash FunctionHash Table77.7% acceptance6 companiesVideo
1955.Count Number of Special Subsequences
HardArrayDynamic Programming53.4% acceptance1 companyVideo
1964.Find the Longest Valid Obstacle Course at Each Position
HardArrayBinary Indexed TreeBinary Search62.8% acceptance1 companyVideo
1970.Last Day Where You Can Still Cross
HardArrayBinary SearchBreadth-First Search68.7% acceptance4 companiesVideo
1982.Find Array Given Subset Sums
HardArrayDivide and Conquer49.7% acceptance1 companyVideo
1994.The Number of Good Subsets
HardArrayBit ManipulationBitmask37.8% acceptance2 companiesVideo
1998.GCD Sort of an Array
HardArrayMathNumber Theory51.3% acceptance1 companyVideo
2009.Minimum Number of Operations to Make Array Continuous
HardArrayBinary SearchHash Table52.0% acceptance5 companiesVideo
2019.The Score of Students Solving Math Expression
HardArrayDynamic ProgrammingMath34.8% acceptance2 companiesVideo
2025.Maximum Number of Ways to Partition an Array
HardArrayCountingEnumeration36.2% acceptance2 companiesVideo
2035.Partition Array Into Two Arrays to Minimize Sum Difference
HardArrayBinary SearchBit Manipulation24.4% acceptance9 companiesVideo
2040.Kth Smallest Product of Two Sorted Arrays
HardArrayBinary Search48.8% acceptance5 companiesVideo
2050.Parallel Courses III
HardArrayDynamic ProgrammingGraph67.0% acceptance9 companiesVideo
2056.Number of Valid Move Combinations On Chessboard
HardArrayBacktrackingSimulation48.7% acceptance2 companiesVideo
2065.Maximum Path Quality of a Graph
HardArrayBacktrackingGraph63.1% acceptance5 companiesVideo
2071.Maximum Number of Tasks You Can Assign
HardArrayBinary SearchGreedy50.1% acceptance5 companiesVideo
2088.Count Fertile Pyramids in a Land
HardArrayDynamic ProgrammingMatrix66.5% acceptance1 companyVideo
2106.Maximum Fruits Harvested After at Most K Steps
HardArrayBinary SearchPrefix Sum61.0% acceptance5 companiesVideo
2111.Minimum Operations to Make the Array K-Increasing
HardArrayBinary Search41.1% acceptance1 companyVideo
2122.Recover the Original Array
HardArrayEnumerationHash Table42.0% acceptance1 companyVideo
2123.Minimum Operations to Remove Adjacent Ones in Matrix
HardArrayGraphMatrix42.5% acceptance1 companyPremium elsewhere, free hereVideo
2132.Stamping the Grid
HardArrayGreedyMatrix36.3% acceptance1 companyVideo
2136.Earliest Possible Day of Full Bloom
HardArrayGreedySorting71.4% acceptance1 companyVideo
2141.Maximum Running Time of N Computers
HardArrayBinary SearchGreedy56.4% acceptance6 companiesVideo
2143.Choose Numbers From Two Arrays in Range
HardArrayDynamic Programming51.4% acceptance1 companyPremium elsewhere, free here
2151.Maximum Good People Based on Statements
HardArrayBacktrackingBit Manipulation52.9% acceptance3 companiesVideo
2158.Amount of New Area Painted Each Day
HardArrayOrdered SetSegment Tree55.3% acceptance2 companiesPremium elsewhere, free hereVideo
Showing 201–250 of 504
How to use these solutions
Each solution breaks the problem into approaches, usually from brute force to the best one, and explains why each works. Code comes in Python, Java, C++ and other languages. Knowing why an approach works matters more in an interview than remembering the code.
- Try the problem first. Give it at least 20 minutes before you open the solution.
- Read every approach. The brute force shows you the problem; the faster ones show the pattern.
- Check the complexity. Note the time and space of each approach and what makes the difference.
- Write it yourself. Close the solution and code it from memory in the editor.
- Come back in a week. Solving it again later is what makes the pattern stick.