<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) { // your code here if(arr1.length === 0 &amp;&amp; arr2.length === 0) { return null; } let total = arr1.length + arr2.length; let mid = Math.floor(total/2); let isEven = total % 2 === 0; mid = isEven ? mid -1 : mid; let p1=0, p2=0, n1,n2; while(p1&lt;arr1.length &amp;&amp; p2&lt;arr2.length) { if(arr1[p1] &lt;= arr2[p2]) { if((p1+p2) === mid &amp;&amp; !isEven) { return arr1[p1] } else if((p1+p2) === mid &amp;&amp; isEven) { if(!n1) { n1 = arr1[p1]; mid += 1; } else if(!n2) { n2 = arr1[p1]; return (n1+n2)/2; } } p1 += 1; } else { if((p1+p2) === mid &amp;&amp; !isEven) { return arr2[p2] } else if((p1+p2) === mid &amp;&amp; isEven) { if(!n1) { n1 = arr2[p2]; mid += 1; } else if(!n2) { n2 = arr2[p2]; return (n1+n2)/2; } } p2 += 1; } } while(p1 &lt; arr1.length) { if((p1+p2) === mid &amp;&amp; !isEven) { return arr1[p1] } else if((p1+p2) === mid &amp;&amp; isEven) { if(!n1) { n1 = arr1[p1]; mid += 1; } else if(!n2) { n2 = arr1[p1]; return (n1+n2)/2; } } p1 += 1; } while(p2 &lt; arr2.length) { if((p1+p2) === mid &amp;&amp; !isEven) { return arr2[p2] } else if((p1+p2) === mid &amp;&amp; isEven) { if(!n1) { n1 = arr2[p2]; mid += 1; } else if(!n2) { n2 = arr2[p2]; return (n1+n2)/2; } } p2 += 1 } return null;}// console.log(median([1,2],[3,4,5]));console.log(median([1,2],[3,4]));</code></pre>

Time Complexity - O(M+N) Space Complexity - O(1)

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…