<pre class="shiki github-dark shaku"><code>/** * @param {number[]} arr1 - sorted integer array * @param {number[]} arr2 - sorted integer array * @returns {number} */function median(arr1, arr2) { // sorted array hence we can use the concept similar to merge sort let len1 = arr1.length; let len2 = arr2.length; let entireArr = []; let i = 0, j = 0; while(i &lt; len1 &amp;&amp; j &lt; len2){ if(arr1[i] &gt; arr2[j]){ entireArr.push(arr2[j]) j++ } else { entireArr.push(arr1[i]) i++; } } while(i &lt; len1){ entireArr.push(arr1[i]) i++; } while(j &lt; len2){ entireArr.push(arr2[j]) j++; } /** * Find the median */ let mid = Math.floor((entireArr.length )/ 2); console.log(mid) if(entireArr.length % 2 !== 0){ return(entireArr[mid] ) } else { let result = ((entireArr[mid] + entireArr[mid-1]) / 2) return( result ) } }</code></pre>

1) Used Merge Sort to get the resultant data. 2)Then mathematical definition of median

Given two sorted array of integers, please return the median. median([1,2],[3,4,5])// 3 If there are even numbers, return the average. median([1,2],[3…