Talentd
FleetCode
Make and follow sheets.Sign in

Solutions, explained

Every approach from brute force to the best one, with code in Python, Java, C++ and more.

Has video
Array2,100String848Hash Table764Math642Dynamic Programming606Sorting493Greedy457Binary Search334Depth-First Search318Database302Matrix267Bit Manipulation263All topics

With video · 3,856 results

4Sum II

454.4Sum II

MediumArrayHash Table57.9% acceptance4 companiesVideo
Poor Pigs

458.Poor Pigs

HardCombinatoricsDynamic ProgrammingMath59.4% acceptance1 companyVideo
LFU Cache

460.LFU Cache

HardDesignDoubly-Linked ListHash Table50.6% acceptance32 companiesVideo
Can I Win

464.Can I Win

MediumBit ManipulationBitmaskDynamic Programming31.7% acceptance4 companiesVideo
Heaters

475.Heaters

MediumArrayBinary SearchSorting42.9% acceptance12 companiesVideo
Zuma Game

488.Zuma Game

HardBreadth-First SearchDynamic ProgrammingMemoization29.4% acceptance7 companiesVideo
The Maze

490.The Maze

MediumArrayBreadth-First SearchDepth-First Search60.4% acceptance13 companiesPremium elsewhere, free hereVideo
The Maze III

499.The Maze III

HardArrayBreadth-First SearchDepth-First Search52.3% acceptance1 companyPremium elsewhere, free hereVideo
Showing 451–500 of 3,856

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.