Given an array of binary strings strs and two integers m and n, return the size of the largest subset of strs such that the subset contains at most m zeros and at most n ones.

A subset is formed by selecting any number of strings from strs, without changing their order.

findMaxForm(strs, m, n) returns the maximum possible size of such a subset.

Note: A binary string contains only the characters '0' and '1'.

Constraints:

• $1 \leq$ strs.length $\leq 600$

• $1 \leq$ strs[i].length $\leq 100$

• strs[i] consists only of digits '0' and '1'.

• $1 \leq$ m, n $\leq 100$

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.