DEV Community

DPC
DPC

Posted on

5 3 3 5 5

Daily JavaScript Challenge #JS-67: Find the Maximum Depth of a Nested Array

Daily JavaScript Challenge: Find the Maximum Depth of a Nested Array

Hey fellow developers! 👋 Welcome to today's JavaScript coding challenge. Let's keep those programming skills sharp!

The Challenge

Difficulty: Medium

Topic: Arrays

Description

Given a nested array, your task is to find and return the maximum depth of nesting. An empty array has a depth of 1. Each additional level of nested arrays within increases the depth by 1.

Ready to Begin?

https://www.dpcdev.com/

  1. Fork this challenge
  2. Write your solution
  3. Test it against the provided test cases
  4. Share your approach in the comments below!

Want to Learn More?

Check out the documentation about this topic here: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/isArray

Join the Discussion!

  • How did you approach this problem?
  • Did you find any interesting edge cases?
  • What was your biggest learning from this challenge?

Let's learn together! Drop your thoughts and questions in the comments below. 👇


This is part of our Daily JavaScript Challenge series. Follow me for daily programming challenges and let's grow together! 🚀

javascript #programming #coding #dailycodingchallenge #webdev

Image of Timescale

🚀 pgai Vectorizer: SQLAlchemy and LiteLLM Make Vector Search Simple

We built pgai Vectorizer to simplify embedding management for AI applications—without needing a separate database or complex infrastructure. Since launch, developers have created over 3,000 vectorizers on Timescale Cloud, with many more self-hosted.

Read full post →

Top comments (2)

Collapse
 
kubernatesdashboard profile image
kubernetesdashboard

The challenge is to find the maximum depth of a nested array in JavaScript. You can solve this by recursively traversing the array and checking if each element is itself an array. If it is, increase the depth by 1. The base case handles non-array elements, and the depth is adjusted accordingly. For example, for an input like [1, [2, [3, [4]]]]], the depth would be 4. This type of problem helps sharpen your skills in recursion and array manipulation. For more challenges and resources, feel free to check out Kubernetes Dashboard for a comprehensive guide to cloud environments and system monitoring!

Collapse
 
shikkaba profile image
Me

Link says invalid token.

Billboard image

The Next Generation Developer Platform

Coherence is the first Platform-as-a-Service you can control. Unlike "black-box" platforms that are opinionated about the infra you can deploy, Coherence is powered by CNC, the open-source IaC framework, which offers limitless customization.

Learn more