JavaScript: Flatten a given array up to the specified depth
JavaScript fundamental (ES6 Syntax): Exercise-234 with Solution
Write a JavaScript program to flatten a given array to the specified depth.
- Use recursion, decrementing depth by 1 for each level of depth.
- Use Array.prototype.reduce() and Array.prototype.concat() to merge elements or arrays.
- Base case, for depth equal to 1 stops recursion.
- Write a JavaScript program to flatten a given array to the specified depth.
Sample Solution:
JavaScript Code:
//#Source https://bit.ly/2neWfJ2
const flatten = (arr, depth = 1) =>
arr.reduce((a, v) => a.concat(depth > 1 && Array.isArray(v) ? flatten(v, depth - 1) : v), []);
console.log(flatten([1, [2], 3, 4]));
console.log(flatten([1, [2, [3, [4, 5], 6], 7], 8], 2));
Sample Output:
[1,2,3,4] [1,2,3,[4,5],6,7,8]
Flowchart:

Live Demo:
See the Pen javascript-basic-exercise-234-1 by w3resource (@w3resource) on CodePen.
Improve this sample solution and post your code through Disqus
Previous: Write a JavaScript program to flatten an object with the paths for keys.
Next: Write a JavaScript program to get the last key that satisfies the provided testing function, otherwise undefined is returned.
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.
- Weekly Trends
- Python Interview Questions and Answers: Comprehensive Guide
- Scala Exercises, Practice, Solution
- Kotlin Exercises practice with solution
- MongoDB Exercises, Practice, Solution
- SQL Exercises, Practice, Solution - JOINS
- Java Basic Programming Exercises
- SQL Subqueries
- Adventureworks Database Exercises
- C# Sharp Basic Exercises
- SQL COUNT() with distinct
- JavaScript String Exercises
- JavaScript HTML Form Validation
- Java Collection Exercises
- SQL COUNT() function
- SQL Inner Join