Search
⌘K

Leetcode 475. Heaters

Given positions of houses and heaters on a line, find the minimum uniform radius R such that every house is within distance R of some heater. Key idea: sort positions and for each house find the nearest heater (binary search or two-pointer) and take the maximum of those nearest distances.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.