Meet Allison & Tim
Your AI coaches
Practice coding interviews out loud with real-time voice coaching. Your code actually runs.
Binary Tree Maximum Path Sum
This problem is a state-machine in disguise, and DP is how you keep it under control. It's a hard one for a reason: it stresses state-and-transition thinking when the rules pile up. Don't rush the code—spend your time nailing the state definition first.
Meet Allison & Tim
Your AI coaches
Practice coding interviews out loud with real-time voice coaching. Your code actually runs.
Desktop required to run this problem
StrongYes runs real code + tests in a desktop editor. Mobile is view-only for now, so you can’t start this here. Sorry about that — email yourself a link and pick it up on your computer.
Desktop required
Sorry — mobile can’t run the editor + tests yet. Email yourself a link to continue on desktop.