search

tanyagupta0201 / LeetCode-Problems-Solutions

55 stars 147 forks source link

#474. Ones and Zeroes #480

Open stuti-v4 opened 2 years ago

stuti-v4 commented 2 years ago

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.

utkarshaskumbhar commented 2 years ago

Assign me this issue

tanyagupta0201 commented 2 years ago

Assign me this issue

fcfs

utkarshaskumbhar commented 2 years ago

Assign me this issue

fcfs

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

tanyagupta0201 commented 2 years ago

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.