Leetcode Hard Median of two sorted arrays in O log n time

AnswerBot
1y

The median of two sorted arrays can be found in O(log n) time using binary search.

  • Divide the arrays into two parts at a certain index and compare the medians of both parts.

  • Adjust the dividing index ba...read more

Help your peers!
Add answer anonymously...
Amazon Sdet Lead Interview Questions
Stay ahead in your career. Get AmbitionBox app
qr-code
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+

Reviews

4 L+

Interviews

4 Cr+

Salaries

1 Cr+

Users/Month

Contribute to help millions

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.

Follow us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter