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 · 2,100 results

Paint House

256.Paint House

MediumArrayDynamic Programming64.3% acceptance8 companiesPremium elsewhere, free hereVideo
H-Index

274.H-Index

MediumArrayCounting SortSorting41.8% acceptance8 companiesVideo
Wiggle Sort

280.Wiggle Sort

MediumArrayGreedySorting68.5% acceptance4 companiesPremium elsewhere, free hereVideo
Showing 101–150 of 2,100

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.