Meet your coaches
Talk through the problem while you code. Guest text is free. Hosted voice is the Own Words Pack.
Longest Increasing Subsequence
Longest Increasing Subsequence is a dynamic programming question: define the state cleanly and the transitions usually follow. Interviewers love it because it reveals your state-and-transition thinking and your edge-case discipline. Once you define the right state, the transitions usually write themselves.
Chat with Fin or Coco right now on mobile.
Start talking through the problem here. Switch to desktop when you're ready to code and run tests.
Start coaching sessionMeet your coaches
Talk through the problem while you code. Guest text is free. Hosted voice is the Own Words Pack.
Start a coached rep now. Guest text is free. Sign in if you want this work on another device.
Email me this coached-rep link
Code + tests need a desktop
Chat works on this phone. Email yourself a link when you want the editor and tests.