Given an array of binary strings, and two integers (max zeros) and (max ones), return the maximum number of strings you can select such that total zeros and total ones .
For example, strings with : select for 4 strings (4 zeros, 3 ones). Each string has a "cost" in two dimensions: zeros and ones. You want to find the largest count of strings while staying within both budgets. This is 0/1 knapsack with two capacities.