Problem · Graph
Maximum Programmer-Problem Matching
Problem statement
Each problem has a list of tags, and each programmer has a list of skills. A programmer is compatible with a problem when the programmer's skills and the problem's tags share at least one identical string.
The problem statement continues
ProExamples
Example 1
problemTags = [["java"], ["python", "sql"], ["go"]]programmerSkills = [["java", "python"], ["java"], ["rust", "go"]]return = 3The first programmer can take the Python problem, the second programmer can take the Java problem, and the third programmer can take the Go problem. These three pairs use every programmer and problem once, so no larger matching is possible.
FastPrep Pro
Reported in 1 Google interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 1 more worked example, explained
- Guided hints and editorial
- Run your code on real test cases
$9/month
Pro subscription, billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week