← All problems
#49 3D Subarray Sum Medium

Implement a program that computes the sum of a 3D subarray of 32-bit integers. You are given an input 3D array input of length N x M x K, and two depth indices S_DEP and E_DEP and two row indices S_ROW and E_ROW and two column indices S_COL and E_COL. S_DEP, E_DEP, S_ROW, E_ROW, S_COL and E_COL are inclusive, 0-based start and end indices — compute the sum of input[S_DEP..E_DEP][S_ROW..E_ROW][S_COL..E_COL].

Implementation Requirements

Example 1:

Input:  input = [[[1, 2, 3],
                  [4, 5, 1]],
                 [[1, 1, 1],
                  [2, 2, 2]]]
        N = 2, M = 2, K = 3
        S_DEP = 0, E_DEP = 1, S_ROW = 0, E_ROW = 0, S_COL = 1, E_COL = 2
Output: output = 7

Example 2:

Input:  input = [[[5, 10],
                  [5, 2],
                  [2, 2]]]
        N = 1, M = 3, K = 2
        S_DEP = 0, E_DEP = 0, S_ROW = 0, E_ROW = 2, S_COL = 1, E_COL = 1
Output: output = 14

Constraints

Guided walkthrough coming soon. Below is the official starter signature in each language; the clickable line-by-line explanation hasn't been authored yet.
Problem text & starters from the official AlphaGPU/leetgpu-challenges. Solve it on leetgpu.com.