Hello readers! It’s really important for me to continue my practice and learning. Every week, I block off 30 minutes, set a timer and choose a challenge from leetcode. This helps me keep my skills sharp, see how other devs all over the planet would solve these problems, and take some leisure time to problem solve and be creative. Being able to see other solutions expands my mind for solving future problems in a clever and efficient way. Today, the problem set focuses on Python.
Given two sorted arrays
nums2 of size
n respectively, return the median of the two sorted arrays.
The overall run time complexity should be
Input: nums1 = [1,3], nums2 =  Output: 2.00000 Explanation: merged array = [1,2,3] and median is 2.
Input: nums1 = [1,2], nums2 = [3,4] Output: 2.50000 Explanation: merged array = [1,2,3,4] and median is (2 + 3) / 2 = 2.5.
nums1.length == m
nums2.length == n
0 <= m <= 1000
0 <= n <= 1000
1 <= m + n <= 2000
-106 <= nums1[i], nums2[i] <= 106
class Solution: def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float: mrgeArr = nums1 + nums2 mrgeArr.sort() if len(mrgeArr) % 2 == 0: el1 = int(len(mrgeArr) / 2) el2 = int((len(mrgeArr) / 2) - 1) return float(str((mrgeArr[el1] + mrgeArr[el2]) / 2)) else: el1 = int(floor(len(mrgeArr) / 2)) return float(str(mrgeArr[el1]))
All solutions are also now on my GitHub profile if you want to check out all of the coding challenges I’ve completed so far!
All credit to problem sets goes to Leetcode