2015.Average Height of Buildings in Each Segment
MediumArrayGreedyHeap (Priority Queue)57.9% acceptance1 companyPremium elsewhere, free hereVideo
208 results
2034.Stock Price Fluctuation
MediumData StreamDesignHash Table49.1% acceptance6 companiesVideo
2054.Two Best Non-Overlapping Events
MediumArrayBinary SearchDynamic Programming64.0% acceptance7 companiesVideo
2093.Minimum Cost to Reach City With Discounts
MediumGraphHeap (Priority Queue)Shortest Path62.4% acceptance2 companiesPremium elsewhere, free hereVideo
2099.Find Subsequence of Length K With the Largest Sum
EasyArrayHash TableHeap (Priority Queue)57.4% acceptance6 companiesVideo
2102.Sequentially Ordinal Rank Tracker
HardData StreamDesignHeap (Priority Queue)61.5% acceptance1 companyVideo
2146.K Highest Ranked Items Within a Price Range
MediumArrayBreadth-First SearchHeap (Priority Queue)47.1% acceptance1 companyVideo
2163.Minimum Difference in Sums After Removal of Elements
HardArrayDynamic ProgrammingHeap (Priority Queue)69.8% acceptance7 companiesVideo
2182.Construct String With Repeat Limit
MediumCountingGreedyHash Table70.9% acceptance5 companiesVideo
2208.Minimum Operations to Halve Array Sum
MediumArrayGreedyHeap (Priority Queue)50.1% acceptance2 companiesVideo
2231.Largest Number After Digit Swaps by Parity
EasyHeap (Priority Queue)Sorting65.7% acceptance5 companiesVideo
2233.Maximum Product After K Increments
MediumArrayGreedyHeap (Priority Queue)44.0% acceptance2 companiesVideo
2285.Maximum Total Importance of Roads
MediumGraphGreedyHeap (Priority Queue)69.3% acceptance1 companyVideo
2290.Minimum Obstacle Removal to Reach Corner
HardArrayBreadth-First SearchGraph71.1% acceptance2 companiesVideo
2333.Minimum Sum of Squared Difference
MediumArrayBinary SearchGreedy43.0% acceptance3 companiesVideo
2335.Minimum Amount of Time to Fill Cups
EasyArrayGreedyHeap (Priority Queue)60.7% acceptance1 companyVideo
2336.Smallest Number in Infinite Set
MediumDesignHash TableHeap (Priority Queue)70.6% acceptance6 companiesVideo
2342.Max Sum of a Pair With Equal Sum of Digits
MediumArrayHash TableHeap (Priority Queue)66.0% acceptance6 companiesVideo
2343.Query Kth Smallest Trimmed Number
MediumArrayDivide and ConquerHeap (Priority Queue)47.9% acceptance1 companyVideo
2344.Minimum Deletions to Make Array Divisible
HardArrayHeap (Priority Queue)Math61.8% acceptance3 companiesVideo
2349.Design a Number Container System
MediumDesignHash TableHeap (Priority Queue)57.1% acceptance1 companyVideo
2353.Design a Food Rating System
MediumDesignHash TableHeap (Priority Queue)52.9% acceptance4 companiesVideo
2357.Make Array Zero by Subtracting Equal Amounts
EasyArrayGreedyHash Table73.8% acceptance1 companyVideo
2386.Find the K-Sum of an Array
HardArrayHeap (Priority Queue)Sorting42.0% acceptance3 companiesVideo
2398.Maximum Number of Robots Within Budget
HardArrayBinary SearchHeap (Priority Queue)39.4% acceptance2 companiesVideo
2402.Meeting Rooms III
HardArrayHash TableHeap (Priority Queue)51.6% acceptance12 companiesVideo
2406.Divide Intervals Into Minimum Number of Groups
MediumArrayGreedyHeap (Priority Queue)63.7% acceptance7 companiesVideo
2424.Longest Uploaded Prefix
MediumBinary Indexed TreeBinary SearchDesign55.5% acceptance1 companyVideo
2454.Next Greater Element IV
HardArrayBinary SearchHeap (Priority Queue)43.0% acceptance1 companyVideo
2456.Most Popular Video Creator
MediumArrayHash TableHeap (Priority Queue)45.3% acceptance2 companiesVideo
2462.Total Cost to Hire K Workers
MediumArrayHeap (Priority Queue)Simulation43.6% acceptance4 companiesVideo
2473.Minimum Cost to Buy Apples
MediumArrayGraphHeap (Priority Queue)67.5% acceptance2 companiesPremium elsewhere, free hereVideo
2497.Maximum Star Sum of a Graph
MediumArrayGraphGreedy42.6% acceptance3 companiesVideo
2500.Delete Greatest Value in Each Row
EasyArrayHeap (Priority Queue)Matrix80.5% acceptance2 companiesVideo
2503.Maximum Number of Points From Grid Queries
HardArrayBreadth-First SearchHeap (Priority Queue)59.3% acceptance6 companiesVideo
2512.Reward Top K Students
MediumArrayHash TableHeap (Priority Queue)47.5% acceptance1 companyVideo
2530.Maximal Score After Applying K Operations
MediumArrayGreedyHeap (Priority Queue)63.7% acceptance6 companiesVideo
2532.Time to Cross a Bridge
HardArrayHeap (Priority Queue)Simulation44.4% acceptance1 companyVideo
2542.Maximum Subsequence Score
MediumArrayGreedyHeap (Priority Queue)54.6% acceptance5 companiesVideo
2551.Put Marbles in Bags
HardArrayGreedyHeap (Priority Queue)72.2% acceptance8 companiesVideo
2558.Take Gifts From the Richest Pile
EasyArrayHeap (Priority Queue)Simulation75.5% acceptance4 companiesVideo
2577.Minimum Time to Visit a Cell In a Grid
HardArrayBreadth-First SearchGraph56.3% acceptance4 companiesVideo
2593.Find Score of an Array After Marking All Elements
MediumArrayHash TableHeap (Priority Queue)64.5% acceptance5 companiesVideo
2599.Make the Prefix Sum Non-negative
MediumArrayGreedyHeap (Priority Queue)51.9% acceptance1 companyPremium elsewhere, free hereVideo
2611.Mice and Cheese
MediumArrayGreedyHeap (Priority Queue)49.2% acceptance1 companyVideo
2617.Minimum Number of Visited Cells in a Grid
HardArrayBreadth-First SearchDynamic Programming24.1% acceptance3 companiesVideo
2642.Design Graph With Shortest Path Calculator
HardDesignGraphHeap (Priority Queue)65.6% acceptance2 companiesVideo
2662.Minimum Cost of a Path With Special Roads
MediumArrayGraphHeap (Priority Queue)43.3% acceptance1 companyVideo
2679.Sum in a Matrix
MediumArrayHeap (Priority Queue)Matrix61.1% acceptanceVideo
2699.Modify Graph Edge Weights
HardGraphHeap (Priority Queue)Shortest Path55.6% acceptance1 companyVideo
Showing 101–150 of 208
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.