Median of Two Sorted Arrays, is a LeetCode problem from Search subdomain. In this post we will see how we can solve this challenge in Swift

Problem Description

You can find the full details of the problem Median of Two Sorted Arrays at LeetCode


remove half of them until index is 0

Time Complexity: O(log(m + n)), Space Complexity: O(1)

Please check the main.swift snippet for the solution.

This solution originally posted at: Github by @soapyigu