Bug Report for median-of-two-sorted-arrays

[gonzalodelgado]

Bug Report for https://neetcode.io/problems/median-of-two-sorted-arrays

My O(1) time solution passes all the tests, but it's actually invalid.

import itertools

class Solution:
    def find_midpoints(self, nums: list) -> tuple:
      if not nums:
        return tuple()
      mp = len(nums)//2
      return (nums[mp - 1], nums[mp]) if len(nums) % 2 == 0 else (nums[mp],)

    def findMedianSortedArrays(self, nums1: list[int], nums2: list[int]) -> float:
      mp1 = self.find_midpoints(nums1)
      mp2 = self.find_midpoints(nums2)
      merged_mps = sorted(itertools.chain(mp1, mp2))
      mp = self.find_midpoints(merged_mps)
      return sum(mp)/len(mp)

Counter example: nums1=[1, 2, 6], nums2=[3, 4, 5], median is (3 + 4)/2 = 3.5, my solution returns 3.0.