You are given a $2 {D}$ integer array grid of size m $ imes$ n.

You need to select exactly one integer from each row of grid.

Return the minimum possible bitwise ${OR}$ sum of the chosen elements.

Constraints:

• $1 \leq$ m $==$ grid.length $\leq 10^5$

• $1 \leq$ n $==$ grid[i].length $\leq 10^5$

• m $\times$ n $\leq 10^5$

• $1 \leq$ grid[i][j] $\leq 10^5$

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.