And today's type of Problem is - Arrays and Searching.
/** * Given two sorted arrays array1 and array2 of size m and n respectively. * Find the median of the two sorted arrays. * * @Example 1: * Input: * m = 3, n = 4 * array1 = [1, 9, 15] * array2 = [2, 4, 5, 23] * * Output: 5 * * @Example 2: * Input: * m = 2, n = 4 * array1 = [41, 78] * array2 = [3, 4, 7, 8] * * Output: 7.5 * * Expected Time Complexity: O(min(log n, log m)). * Expected Auxiliary Space: O((n+m)/2). */
Have a bit of a coding yourself and see what kind of solution you can come up with and comment your solution here.
You can write your solution in any language and in your way, But don't forget to comment your best solution here.
If you get stuck or you want to see the solution,
II'l show you how would i solve it.
We will Highlight top answers || comments in Future videos.
Check the tutorial for Solution
Top comments (0)