Without Recursion || Easy Solution than others || C++ || 👍😊
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}
 */

const flattenOneLevel = (arr) => {
    const ans = [];
    for (const item of arr) {
        if (Array.isArray(item)) {
            ans.push(...item);
        }
        else {
            ans.push(item);
        }
    }

    return ans;
}

var flat = function (arr, n) {
    while (n--) {
        arr = flattenOneLevel(arr);
    }

    return arr;
};
```
['JavaScript']