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,120String854Hash Table774Math650Dynamic Programming613Sorting495Greedy462Binary Search335Depth-First Search321Database307Matrix267Bit Manipulation264All topics

462 results

Jump Game

55.Jump Game

MediumArrayDynamic ProgrammingGreedy41.2% acceptance33 companiesVideo
Candy

135.Candy

HardArrayGreedy49.3% acceptance24 companiesVideo
Wiggle Sort

280.Wiggle Sort

MediumArrayGreedySorting68.5% acceptance4 companiesPremium elsewhere, free hereVideo
IPO

502.IPO

HardArrayGreedyHeap (Priority Queue)53.6% acceptance9 companiesVideo
Showing 1–50 of 462

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.