Skip to main content
271115target = ?
easyBlind 75

Two Sum

This is often your first interview question, and it's testing something specific: can you trade space for time? The brute force is obvious, but interviewers want to see you reach for a hash map naturally. It's a great warm-up that builds the instinct you'll use in dozens of harder problems.

Arrays & HashingTwo Pointers

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
1Two Sum - Single Paireasy
2Part 2
3Part 3

Start Part 1 to unlock your next challenge

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.