You are given a $2$D integer array properties of size $n imes m$, and an integer k.

An undirected graph with $n$ vertices is constructed where each vertex $i$ ($0 \le i < n$) corresponds to the array properties[i]. An edge exists between vertex $i$ and vertex $j$ ($i \neq j$) if the number of distinct values shared by both properties[i] and properties[j] is at least k.

Return the number of connected components in the graph.

Constraints:

• $1 \le n ==$ properties.length $\le 100$

• $1 \le m ==$ properties[i].length $\le 100$

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

• $1 \le k \le m$

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.