LeetCode-Problems-Solutions #474. Ones and Zeroes

#474. Ones and Zeroes

Open stuti-v4 opened this issue 2 years ago • 4 comments

You are given an array of binary strings strs and two integers m and n.

Return the size of the largest subset of strs such that there are at most m 0's and n 1's in the subset.

A set x is a subset of a set y if all elements of x are also elements of y.

Oct 22 '22 16:10 stuti-v4

Assign me this issue

Oct 22 '22 16:10 utkarshaskumbhar

Assign me this issue

fcfs

Oct 23 '22 08:10 tanyagupta0201

Assign me this issue

fcfs

Do I have to create my own issue in this repository ??

Oct 27 '22 10:10 utkarshaskumbhar

Assign me this issue

fcfs

Do I have to create my own issue in this repository ??

Yes, you may create an issue for the questions that are not already present or assigned already.

Oct 27 '22 14:10 tanyagupta0201