Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 474. Ones and Zeroes
Select the largest subset of binary strings from strs such that the total number of 0's is ≤ m and total number of 1's is ≤ n. This is a 0/1 knapsack-style optimization with two resource constraints (zeros and ones), typically solved with 2D DP.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.