Tutorialspoint
Problem
Solution
Submissions
Back

Convert a 2D Array into a 1D Array

Certification: Basic Level Accuracy: 33.33% Submissions: 6 Points: 5

Write a C# program to convert a 2D array into a 1D array. There are various strategies for flattening a 2D array, but for this problem, use row-major order (traverse each row from left to right, then move to the next row).

Example 1
    
        
  • Input: matrix = [
    
  [1, 2, 3],
    
  [4, 5, 6]
]
    • 
        
  • Output: [1, 2, 3, 4, 5, 6]
    • 
        
  • Explanation:
            
      
                
    • Step 1: Determine the dimensions of the input 2D array (2 rows × 3 columns).
      • 
                
    • Step 2: Calculate the total size needed for the 1D array (2 * 3 = 6).
      • 
                
    • Step 3: Create a new 1D array with the calculated size.
      • 
                
    • Step 4: Traverse the 2D array in row-major order and copy each element to the 1D array.
      • 
                
    • Step 5: The 2D array has 2 rows and 3 columns. In row-major order, we first take all elements from the first row (1, 2, 3), then all elements from the second row (4, 5, 6).
      • 
            
    
        
    •
Example 2
    
        
  • Input: matrix = [
    
  [9],
    
  [8],
    
  [7]
]
    • 
        
  • Output: [9, 8, 7]
    • 
        
  • Explanation:
            
      
                
    • Step 1: Determine the dimensions of the input 2D array (3 rows × 1 column).
      • 
                
    • Step 2: Calculate the total size needed for the 1D array (3 * 1 = 3).
      • 
                
    • Step 3: Create a new 1D array with the calculated size.
      • 
                
    • Step 4: Traverse the 2D array in row-major order and copy each element to the 1D array.
      • 
                
    • Step 5: The 2D array has 3 rows and 1 column. In row-major order, we take the element from each row (9, 8, 7).
      • 
            
    
        
    •
Constraints
    
        
  • 1 ≤ matrix.length ≤ 100
    • 
        
  • 1 ≤ matrix[i].length ≤ 100
    • 
        
  • 0 ≤ matrix[i][j] ≤ 10000
    • 
        
  • Time Complexity: O(m*n)
    • 
        
  • Space Complexity: O(m*n)
    •
ArraysFunctions / MethodsTutorialspointTech Mahindra
Editorial

Login to view the detailed solution and explanation for this problem.

My Submissions
All Solutions
Refresh
Lang Status Date Code
You do not have any submissions for this problem.
Refresh
User Lang Status Date Code
No submissions found.

Please Login to continue
Solve Problems

 
 
 
Output Window
Clear All Apply Filters

Trending

Others

SIGN IN

Don't have an account? Register

Hint
Solution

Solution Hints

    
        
  • Determine the total number of elements in the 2D array.
    • 
        
  • Create a 1D array of the appropriate size.
    • 
        
  • Use nested loops to iterate through the 2D array.
    • 
        
  • Calculate the corresponding 1D index for each element in the 2D array.
    • 
        
  • Handle cases where rows might have different lengths.
    •

Steps to solve by this approach:

 Step 1: Determine the dimensions of the input 2D array (rows × columns).
 Step 2: Calculate the total size needed for the 1D array (rows * columns).
 Step 3: Create a new 1D array with the calculated size.
 Step 4: Traverse the 2D array in row-major order using nested loops.
 Step 5: For each element at position (i,j) in the 2D array, place it at the corresponding position in the 1D array and increment the 1D array index.

Submitted Code :