k channels: maximize the sum of medians
Task
There are k channels and an array of packets (lengths). Distribute all packets among the channels (each channel non-empty) so that the sum of the channel medians is maximal.
The rest of this answer, with code and interview follow-ups, is in the DevPrep app.
Read the full answer in DevPrep