You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively.Merge nums1 and nums2 into a single array sorted in non-decreasing order.The final sorted array should not be returned by the function, but instead be stored inside the array nums1. To accommodate this, nums1 has a length of m + n, where the first m elements denote the elements that should be merged, and the last n elements are set to 0 and should be ignored. nums2 has a length of n. Example 1:Input: nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3Output: [1,2,2,3,5,6]Explanation: The arrays we are merging are [1,2,3] and [2,5,6].The result of the merge is [1,2,2,3,5,6] with the underlined elements coming from nums1.Example 2:Input: nums1 = [1], m = 1, nums2 = [], n = 0Output: [1]Explanation: The arrays we are merging are [1] and [].The result of the merge is [1].Example 3:Input: nums1 = [0], m = 0, nums2 = [1], n = 1Output: [1]Explanation: The arrays we are merging are [] and [1].The result of the merge is [1].Note that because m = 0, there are no elements in nums1. The 0 is only there to ensure the merge result can fit in nums1. Constraints:nums1.length == m + nnums2.length == n0 <= m, n <= 2001 <= m + n <= 200-109 <= nums1[i], nums2[j] <= 109 Follow up: Can you come up with an algorithm that runs in O(m + n) time?

Given two sorted arrays arr1[] and arr2[] of sizes n and m in non-decreasing order. Merge them in sorted order without using any extra space. Modify arr1 so that it contains the first N elements and modify arr2 so that it contains the last M elements.

You are given two 0-indexed integer arrays nums1 and nums2 of sizes n and m, respectively.Consider calculating the following values:The number of indices i such that 0 <= i < n and nums1[i] occurs at least once in nums2.The number of indices i such that 0 <= i < m and nums2[i] occurs at least once in nums1.Return an integer array answer of size 2 containing the two values in the above order.

Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.The overall run time complexity should be O(log (m+n)). Example 1:Input: nums1 = [1,3], nums2 = [2]Output: 2.00000Explanation: merged array = [1,2,3] and median is 2.Example 2:Input: nums1 = [1,2], nums2 = [3,4]Output: 2.50000Explanation: merged array = [1,2,3,4] and median is (2 + 3) / 2 = 2.5. Constraints:nums1.length == mnums2.length == n0 <= m <= 10000 <= n <= 10001 <= m + n <= 2000-106 <= nums1[i], nums2[i] <= 106

Given an array of size N, implement Merge sort.Input FormatThe first line of input contains an integer N - the size of an array. The second line contains the elements of the array.Output FormatFor each merge call of Merge Sort, print the array elements.Constraints1 <= N <= 201 <= A[i] <= 103ExampleInput65 1 3 15 10 4Output1 5 3 15 10 4 1 3 5 15 10 4 1 3 5 10 15 4 1 3 5 4 10 15 1 3 4 5 10 15

You are given two arrays of equal length, nums1 and nums2.Each element in nums1 has been increased (or decreased in the case of negative) by an integer, represented by the variable x.As a result, nums1 becomes equal to nums2. Two arrays are considered equal when they contain the same integers with the same frequencies.Return the integer x. Example 1:Input: nums1 = [2,6,4], nums2 = [9,7,5]Output: 3Explanation:The integer added to each element of nums1 is 3.Example 2:Input: nums1 = [10], nums2 = [5]Output: -5Explanation:The integer added to each element of nums1 is -5.Example 3:Input: nums1 = [1,1,1,1], nums2 = [1,1,1,1]Output: 0Explanation:The integer added to each element of nums1 is 0. Constraints:1 <= nums1.length == nums2.length <= 1000 <= nums1[i], nums2[i] <= 1000The test cases are generated in a way that there is an integer x such that nums1 can become equal to nums2 by adding x to each element of nums1.