2649. Nested Array Generator LeetCode Solution

In this guide, you will get 2649. Nested Array Generator LeetCode Solution with the best time and space complexity. The solution to Nested Array Generator problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.

Problem Statement
Complexity Analysis
Nested Array Generator solution in C++
Nested Array Generator solution in Java
Nested Array Generator solution in Python
Additional Resources

2649. Nested Array Generator LeetCode Solution image

Problem Statement of Nested Array Generator

Given a multi-dimensional array of integers, return a generator object which yields integers in the same order as inorder traversal.
A multi-dimensional array is a recursive data structure that contains both integers and other multi-dimensional arrays.
inorder traversal iterates over each array from left to right, yielding any integers it encounters or applying inorder traversal to any arrays it encounters.

Example 1:

Input: arr = [[[6]],[1,3],[]]
Output: [6,1,3]
Explanation:
const generator = inorderTraversal(arr);
generator.next().value; // 6
generator.next().value; // 1
generator.next().value; // 3
generator.next().done; // true

Example 2:

Input: arr = []
Output: []
Explanation: There are no integers so the generator doesn’t yield anything.

Constraints:

0 <= arr.flat().length <= 105
0 <= arr.flat()[i] <= 105
maxNestingDepth <= 105

Can you solve this without creating a new flattened version of the array?

Complexity Analysis

Time Complexity: Google AdSense
Space Complexity: Google Analytics

2649. Nested Array Generator LeetCode Solution in C++

type MultidimensionalArray = (MultidimensionalArray | number)[];

function* inorderTraversal(
  arr: MultidimensionalArray
): Generator<number, void, unknown> {
  for (const item of arr) {
    if (typeof item === 'number') {
      yield item;
    } else {
      yield* inorderTraversal(item);
    }
  }
}
/* code provided by PROGIEZ */