<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 flatt(arr, depth = 1, finalArr){	for(let i = 0; i&lt; arr.length; i++){		if(Array.isArray(arr[i]) &amp;&amp; depth != 0){			flatt(arr[i], depth-1, finalArr);		}		else{			finalArr.push(arr[i]);		}	}	return finalArr;}function flat(arr, depth = 1) { // your imeplementation here let finalArr = [];	return flatt(arr,depth,finalArr);}</code></pre>

This solution does not require any extra space like stack or queue, its a simple recursive solution

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()