Richest Customer Matrix Problem

Richest Customer Matrix Problem — ExecCode Easy DSA Practice

Solve the Richest Customer Matrix problem on ExecCode. Free online easy DSA practice in Matrix. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given the input needed to solve Richest Customer Matrix. Your task is to compute the required answer and return maximum row sum. A rectangular board contains information in rows and columns. In Richest Customer Matrix, each cell must be interpreted with its neighbors or position in mind. JSON 2D accounts array.

Examples

Input {"accounts": [[1, 2, 3], [3, 2, 1]]}; Output 6. Input {"accounts": [[1, 5], [7, 3], [3, 5]]}; Output 10. Input {"accounts": [[2, 8, 7], [7, 1, 3], [1, 9, 5]]}; Output 17

Constraints

Positive balances

Practice Richest Customer Matrix free on ExecCode. Browse DSA problems, topic map, and placement guides.