Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 474. Ones and Zeroes
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source