Given an $m imes n$ integer matrix grid, you begin at the top left cell $(0, 0)$ and want to reach the bottom right cell $(m - 1, n - 1)$. From any given cell, you may only move either right or down to an adjacent cell.

The score of a path is the bitwise XOR sum of all elements visited along the path, including the starting and ending cells.

Return the minimum possible XOR score among all valid paths from $(0, 0)$ to $(m - 1, n - 1)$.

Constraints:

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

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

• m * n $\leq 1000$

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

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.