Median of Two Sorted Lists | Dataford Interview Questions

Find the median of two sorted lists.

Given two individually sorted integer lists, return the median of all values while targeting O(log(min(m, n))) time and O(1) extra space. If the combined length is even, return the average of the two middle values; otherwise, return the middle value.

Constraints

0 <= len(nums1), len(nums2) <= 1000
len(nums1) + len(nums2) >= 1
Each list is sorted in nondecreasing order
-10^9 <= nums1[i], nums2[i] <= 10^9

Function Signature

def median_two_sorted_lists(nums1, nums2):

Your question is Median of Two Sorted Lists. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Find the median of two sorted lists.

Constraints

0 <= len(nums1), len(nums2) <= 1000
len(nums1) + len(nums2) >= 1
Each list is sorted in nondecreasing order
-10^9 <= nums1[i], nums2[i] <= 10^9

Function Signature

def median_two_sorted_lists(nums1, nums2):

Your question is Median of Two Sorted Lists. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.