0213startend↓→
hardNeetCode 150

Swim in Rising Water

Swim in Rising Water is really a boundary-finding problem, even if it doesn't look like it at first. It's a hard one for a reason: it stresses boundary precision when the rules pile up. If you can state the invariant for your search space, you'll stop making off-by-one mistakes.

Arrays & HashingGraphsHeap / Priority QueueBinary SearchBFS / DFS
πŸ‘©β€πŸ«
πŸ‘¨β€πŸ’Ό

Meet Allison & Tim

Your AI coaches

Practice coding interviews out loud with real-time voice coaching. Your code actually runs.

Free Β· No sign up Β· Early access

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.

1Find Minimum Time to Reach Destinationhard
Based onLeetCode

Desktop required

Sorry β€” mobile can’t run the editor + tests yet. Email yourself a link to continue on desktop.