You are given an $m \times n$ integer grid accounts where accounts[i][j] is the amount of money customer $i$ has in bank $j$.

A customer’s wealth is the total sum of money across all their bank accounts. The richest customer is the customer with the highest wealth.

Return the wealth of the richest customer.

Constraints:

• m == accounts.length

• n == accounts[i].length

• $1 \le$ m, n $\le 50$

• $1 \le$ accounts[i][j] $\le 100$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.