<pre class="shiki github-dark shaku"><code>// type Interval = [number, number]/** * @param {Interval[][]} schedules * @return {Interval[]} *//*- Merge into one array- Sort by end time- Combine non-mutually-exclusive times- find other (free) times*/function findMeetingSlots(schedules) { const merged = []; schedules.forEach(x =&gt; merged.push(...x)); // Sort merged.sort((a, b) =&gt; a[1] - b[1]); merged.splice(0, 0, [0, 0]); merged.push([24, 24]); // Combine non-exclusive times for (let i = 0; i &lt; merged.length; i++) { if (i + 1 &lt; merged.length &amp;&amp; merged[i][1] &gt;= merged[i + 1][0]) { merged.splice(i, 2, [Math.min(merged[i][0], merged[i + 1][0]), Math.max(merged[i][1], merged[i + 1][1])]); i--; } } const retArr = []; // Find the exclusive times for(let i = 0; i &lt; merged.length; i++){ if(i+1 &lt; merged.length){ retArr.push([merged[i][1], merged[i+1][0]]); } } return retArr;}</code></pre>

This is my accepted solution

Airbnb

[start, end] is a time interval, with all integers from 0 to 24. Given schedules for all team members, [ [[13,15], [11,12], [10,13]], //schedule for m…