Meet your coaches
Talk through the problem while you code. Guest text is free. Hosted voice is the Own Words Pack.
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.
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 sessionMeet your coaches
Talk through the problem while you code. Guest text is free. Hosted voice is the Own Words Pack.
Start a coached rep now. Guest text is free. Sign in if you want this work on another device.
Email me this coached-rep link
Code + tests need a desktop
Chat works on this phone. Email yourself a link when you want the editor and tests.