sum of middle elements of two sorted arrays | GFG Problem
sum of middle elements of two sorted arrays | GFG Problem
Given 2 sorted arrays Ar1 and Ar2 of size N each. Merge the given arrays and find the sum of the two middle elements of the merged array.
Example 1:
Input:
N = 5
Ar1[] = {1, 2, 4, 6, 10}
Ar2[] = {4, 5, 6, 9, 12}
Output: 11
Explanation: The merged array looks like
{1,2,4,4,5,6,6,9,10,12}. Sum of middle
elements is 11 (5 + 6).
Please Like | Share | SUBSCRIBE to our Channel
CodewithArvinder
🙏🙏🙏
Subscribe to our Channel...!
/ @codewitharvinder
Follow us on Instagram...!
/ codewitharvinder
Don't forget to tag our Channel..!
#codewitharvinder
Related tags-
Sum of Middle Elements of two sorted arrays | Arrays (Medium) | Data Structures | Geeks for Geeks
Problem - Sum of Middle Elements of two sorted arrays
Arrays (Medium) | Data Structures | Geeks for Geeks
Sum of middle elements of two sorted arrays
median of two sorted arrays
leetcode median of two sorted arrays
find median of two sorted arrays
median of two sorted arrays leetcode
leetcode 4. median of two sorted arrays
median of two sorted arrays solution
median of two sorted arrays java
leetcode 4 median of two sorted arrays python
median of two sorted arrays binary search
Gfg problem
sum of middle elements of two sorted arrays | gfg problem
sum of middle elements of two sorted arrays gfg
geeksforgeeks, leetcode, programming
median of two sorted arrays,
median of two sorted arrays leetcode,
find median of two sorted arrays
#geeksforgeeks #java #gfg #gfgdailyproblem #leetcode #coding #shorts #viral #javaprogramming #problemsolving #datastructure #dsa #array
