## Problem You are given a list of employees, each with a set of skills. Assign all employees to exactly one of `k` teams such that: (1) each team has at least one employee with each required skill, (2) team sizes differ by at most 1. Determine if a valid assignment exists, and if so, return one. ```python def assign_teams( employees: list[dict], # {"id": str, "skills": set[str]} required_skills: set[str], k: int ) -> list[list[str]] | None: # list of k teams, each as list of employee IDs pass ``` **Example:** ``` employees = [ {"id": "A", "skills": {"python", "sql"}}, {"id": "B", "skills": {"java"}}, {"id": "C", "skills": {"python"}}, {"id": "D", "skills": {"sql", "java"}}, ] required_skills = {"python", "sql"}, k = 2 -> [["A", "B"], ["C", "D"]] # one valid solution ``` ## Follow-ups 1. This problem is NP-hard in the general case. What greedy heuristic would you use to get a good-enough solution quickly? 2. How does constraint satisfaction (CSP) formulation with backtracking differ from a greedy assignment? 3. What if an employee can be on multiple teams simultaneously? How does the feasibility check change? 4. How would you model this as an integer linear program (ILP) and what solver would you use?

InterviewDB Experience · San Francisco

Team Arrangement: Assign Employees to Teams Subject to Skill and Size Constraints

phone

Interview Experience

Problem You are given a list of employees, each with a set of skills. Assign all employees to exactly one of k teams such that: (1) each team has at least one employee with each required skill, (2) team sizes differ by at most 1. Determine if a valid assignment exists, and if so, return one. Example: Follow-ups This problem is NP-hard in the general case. What greedy heuristic would you use to get a good-enough solution quickly? How does constraint satisfaction (CSP) formulation with backtrackin…

Full Details

🔒

Unlock all Anduril questions

Full insider details, leaked discussions, and candidate experiences.

Get full access — $100 a year, unlimited access

About This Question

This is a candidate experience report from a anduril interview during the phone round.

It covers the following topics: Phone, Sql, Greedy, Coding, Backtracking .

Topics

Phone Sql Greedy Coding Backtracking

Team Arrangement: Assign Employees to Teams Subject to Skill and Size Constraints

Interview Experience

Full Details

About This Question

Topics

More Anduril Interview Questions