Skip to main content
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

Learn this pattern

Arrays and Hashing Interview Questions

Arrays and hashing problems are about fast lookup choices: set for membership, map for attached state, and buckets when counts are bounded. Reach for this family when brute force compares too many pairs or when you need to remember what you saw earlier in one pass.

Coco
Fin

Meet your coaches

Talk through the problem while you code. Signed-in reps become prep memory for the next session.

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 session
1Find Minimum Time to Reach Destinationhard
Based onLeetCode

Desktop required

Sorry - mobile cannot run the editor and tests yet. Use the next step below or email yourself a link to continue on desktop.

Read the pattern guide

Arrays and Hashing Interview Questions gives you a useful next rep while you are still on your phone.