InterviewDB Experience · Los Angeles

Team Split: Divide Players into Two Balanced Teams

Interview Experience

Problem You are given a list of 2n players each with a skill rating. Split them into two teams of exactly n players such that the absolute difference in total skill between the two teams is minimized. Return the minimum possible difference. Follow-ups Is this NP-hard in general? What constraint makes a DP solution tractable here? Describe the DP state and transition for solving this exactly. If teams don't have to be equal size, how does the problem simplify or change? Extend: each player has tw…

Full Details

🔒

Unlock all Zoox 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 zoox interview during the onsite round.

It covers the following topics: Coding, Onsite, Dynamic Programming .