← Questions
Ones and zeroes
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given a list of binary strings and two budgets, at most max_zeros zeros and at most max_ones ones in total, choose as many strings as possible so that the chosen strings together stay within both budgets. Return how many you can choose.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding
