Given a $0$ indexed $m imes n$ binary matrix grid.

A non empty subset of rows is considered good if the sum of elements in each column across the chosen subset is at most half of the size of the subset. That is, if the subset contains $k$ rows, the sum of elements in each column within those rows must not exceed $\lfloor \frac{k}{2} \rfloor$.

Return an array containing the indices of the rows belonging to any good subset, sorted in ascending order. If there are multiple valid good subsets, return any of them. If no such subset exists, return an empty array.

Constraints:

• m $==$ grid.length

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

• $1 \leq$ m $\leq 10^4$

• $1 \leq$ n $\leq 5$

• grid[i][j] is either $0$ or $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.