Given a $2 D$ binary array grid, return the total number of right triangles that can be formed by choosing $3$ elements with value $1$.

A collection of $3$ elements with value $1$ forms a right triangle if one element shares the same row with the second element and shares the same column with the third element.

Constraints:

• $1 \leq$ grid.length $\leq 1000$

• $1 \leq$ grid[i].length $\leq 1000$

• $0 \leq$ grid[i][j] $\leq 1$

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.