easy solution
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```javascript []
/**
 * @param {Array} arr
 * @param {number} depth
 * @return {Array}
 */
var flat = function (arr, n) {

    let res = [];

    const flatternArray = (flatArr, n) => {
        for (let i = 0; i < flatArr.length; i++) {
            if (Array.isArray(flatArr[i]) && n !== 0) {
                flatternArray(flatArr[i], n - 1);
            } else {
                res.push(flatArr[i])
            }
        }
    }

    flatternArray(arr, n)

    return res;

};
```
['JavaScript']