Projection Area of 3D Shapes Problem

Projection Area of 3D Shapes Problem — ExecCode Easy DSA Practice

Solve the Projection Area of 3D Shapes problem on ExecCode. Free online easy DSA practice in Arrays - Logic Building. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given an n x n grid where we place some 1 x 1 x 1 cubes that are axis-aligned with the x, y, and z axes. Your task is to compute the required answer and return the total area of all three projections. Each value v = grid[i][j] represents a tower of v cubes placed on top of the cell (i, j). We view the projection of these cubes onto the xy, yz, and zx planes. A projection is like a shadow, that maps our 3-dimensional figure to a 2-dimensional plane. We are viewing the "shadow" when looking at the cubes from the top, the front, and the side.

Examples

Input {"grid": [[1, 2], [3, 4]]}; Output 17. Input {"grid": [[2]]}; Output 5

Constraints

n == grid.length == grid[i].length 1 <= n <= 50 0 <= grid[i][j] <= 50

Practice Projection Area of 3D Shapes free on ExecCode. Browse DSA problems, topic map, and placement guides.