3993.Maximum Value of an Alternating Sequence
MediumGreedyMath31.5% acceptanceVideo
With video · 457 results
4000.Largest Integer With Given Digit Sum
EasyGreedyMath61.6% acceptanceVideo
4008.Minimum Initial Strength to Defeat All Monsters
MediumArrayBinary SearchGreedy50.1% acceptanceVideo
4014.Minimum Total Price After Applying Discounts
MediumArrayGreedySorting71.8% acceptanceVideo
4025.Minimize the Maximum Waiting Time at Synchronized Traffic Lights
MediumArrayGreedy64.7% acceptanceVideo
4026.Maximum Gap Between Stations
MediumGreedyStringTwo Pointers52.4% acceptanceVideo
4036.Lexicographically Largest String After Pair Transformations
MediumArrayBit ManipulationGreedy42.8% acceptanceVideo
Showing 451–457 of 457
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.