<pre class="shiki github-dark shaku"><code>// function merge(arrList) {// const allMerged = []// arrList.forEach(arr=&gt;{// allMerged.push(...arr)// })// return allMerged.sort((a,b)=&gt;a-b)// }function merge2(a,b){ const result =[] let i=0 let j=0 while(i&lt;a.length &amp;&amp; j&lt;b.length){ if(a[i]&lt;b[j]){ result.push(a[i]) i++ }else { result.push(b[j]) j++ } if(i&gt;=a.length){ result.push(...b.slice(j)) } if(j&gt;=b.length){ result.push(...a.slice(i)) } } return result}function merge(arrList) { let result=arrList[0] ?? [] for(let i=1;i&lt;arrList.length;i++){ result = merge2(result, arrList[i]) } return result}</code></pre>

O(Nk) complexity

TikTok

You are given a list of sorted non-descending integer arrays, write a function to merge them into one sorted non-descending array. merge( [ [1,1,1,100…