Mailbox assignment distance
Given the positions of houses on a street (integers) and a number k of mailboxes to install (each mailbox sits at an integer position), assign each house to its nearest mailbox. Return the minimum possible total distance between all houses and their nearest mailbox. There are at most 100 houses and 1 <= k <= number of houses; positions are 1..10000.
Implement
min_mailbox_distance(houses: list[int], k: int) → intExamples
in
[[1,4,8,10,20],3]out5What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 40 min
solution.py
InputExpectedGot
[[1,4,8,10,20],3]5not run yetsample