Algorithm · Google · Medium
Maximum Problem Assignment Hard · Topics · Company Tags · Hints There are N problems numbered 0 through N-1 and M programmers numbered 0 through M-1. Problem i is described by a set of tags tags[i], and programmer j is described by a set of skills skills[j]. A problem i can be assigned to programmer j if the two sets have at least one common element. Each problem may be assigned to at most one programmer, and each programmer may receive at most one problem. Compute the…
Checking your access…