<pre class="shiki github-dark shaku"><code>// This is a JavaScript coding problem from BFE.dev /** * @param { Array } arr * @param { number } depth * @returns { Array } */function flat(arr, depth = 1) { if(depth === 0 || arr.length === 0) { return arr.slice(); } const result = []; for (let i=0; i&lt;arr.length; i++) { if ( i in arr ) { const item = arr[i]; if (Array.isArray(item)) { result.push(...flat(item, depth-1)); } else { result.push(item); } } } return result;}</code></pre>

Time Complexity: O(n), Space Complexity: O(n + d)

TikTok

Google

Apple

Yandex

Roblox

There is already Array.prototype.flat() in JavaScript (ES2019), which reduces the nesting of Array. Please implement your own. const arr = [1, [2], [3…

implement it by yourself

4. implement basic throttle()

2. implement curry() with placeholder support

3. implement Array.prototype.flat()