You are given a $0$ indexed integer array arr and an $m imes n$ integer matrix mat. Both arr and mat contain every integer in the range $[1, m imes n]$.

Starting at index $0$, iterate through arr and paint the cell in mat that contains the value arr[i].

Return the smallest index i at which at least one entire row or column in mat becomes fully painted.

Constraints:

• m $==$ mat.length

• n $==$ mat[i].length

• arr.length $==$ m $ imes$ n

• $1 \leq$ m, n $\leq 10^5$

• $1 \leq$ m $ imes$ n $\leq 10^5$

• $1 \leq$ arr[i], mat[r][c] $\leq$ m $ imes$ n

• All the integers of arr are unique.

• All the integers of mat are unique.

Input: arr = [3,5,1,4,2]-List[int], mat = [[1,2,3,4,5]]-List[List[int]]
Output: 0-int
Explanation: Painting the cells according to arr, the earliest index identified for a fully painted row or column is 0.

Input: arr = [1,2,5,6,3,4,7,8]-List[int], mat = [[1,2,3,4],[5,6,7,8]]-List[List[int]]
Output: 2-int
Explanation: By index 2, the values 1 and 5 have been painted in the first column, so the first completely painted column is completed at index 2.

Input: arr = [9,6,1,2,3,7,5,8,4]-List[int], mat = [[9,1,5],[6,3,8],[2,7,4]]-List[List[int]]
Output: 3-int
Explanation: At index 3, the first column contains the painted values 9, 6, and 2, so it becomes completely painted.

Input: arr = [2,1,7,8,6,3,5,4]-List[int], mat = [[2,7],[1,8],[6,3],[5,4]]-List[List[int]]
Output: 2-int
Explanation: At index 2, the first row has both of its cells, 2 and 7, painted, so it becomes completely painted.

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.