Meet Allison & Tim
Your AI coaches
Practice coding interviews out loud with real-time voice coaching. Your code actually runs.
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.
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.