We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Key is to use greedy algorithm to always place the transmitter at the house furthest to the right possible to cover the range.
O(n log n) solution due to the sorting at the beginning.
Hackerland Radio Transmitters
You are viewing a single comment's thread. Return to all comments →
Key is to use greedy algorithm to always place the transmitter at the house furthest to the right possible to cover the range. O(n log n) solution due to the sorting at the beginning.