Talentd
For employersSign in
JobsInternshipsPracticeResume toolsCompaniesArticles
For employers
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
Array1,169Hash Table465String428Math320Greedy317Dynamic Programming305Sorting294Depth-First Search205Binary Search182Breadth-First Search164Matrix157Tree157All topics

Medium · 164 results

The Maze

490.The Maze

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

505.The Maze II

MediumArrayBreadth-First SearchDepth-First Search55.0% acceptance5 companiesPremium elsewhere, free hereVideo
01 Matrix

542.01 Matrix

MediumArrayBreadth-First SearchDynamic Programming54.7% acceptance14 companiesVideo
Kill Process

582.Kill Process

MediumArrayBreadth-First SearchDepth-First Search70.4% acceptance4 companiesPremium elsewhere, free hereVideo
Showing 1–50 of 164

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.
All problemsTopicsCompany questionsSheets