Day 5: Coding Challenge

• Problem -> Two sorted arrays are given let's say num1 and num2 respectively, we have to return the median of these two arrays.
• Condition is overall time complexity should be O(log(m+n))
• Solutions -> 1st approach is to get the resultant array by combining two arrays using the pointer approach to get the output array. Then we can easily find out the median of the output array.
• Solution -> 2nd we can use binary search as the arrays are sorted. Also, the problem will be solved in given time complexity.
• Time Complexity - O(log m + log n))
• Space complexity - O(log m + log n)

#problemsolving #problemsolvingskills #problemoftheday #30daysofcodechallenge #30daysofcode #leetcode2023 #codechallenge