Meet your coaches
Talk through the problem while you code. Signed-in reps become prep memory for the next session.
Median of Two Sorted Arrays
Binary search on the smaller array to find the partition point where left half elements all <= right half elements in both arrays - handle edge cases with infinity. O(log(min(m,n))) and a brutal problem that tests binary search mastery; understanding the invariant is half the battle.
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.
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 sessionStart a coached rep now. Sign in before or after the session so StrongYes can save what you struggled with to your prep memory.
Email me this coached-rep link
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.
Arrays and Hashing Interview Questions gives you a useful next rep while you are still on your phone.