Heaters

LeetCode 475 • Medium • Two Pointers • Anduril

Houses [1,2,3,4], heaters [1,4] → min radius 1. Sort + two pointers / binary search on positions.

TimeO(n log n)

SpaceO(1)

House

Heater

Radius

step—

note—

Speed:

Ready

Press Play to walk the algorithm.

Whiteboard

Size:3

Type It

findRadius(houses, heaters) — minimum heater radius to warm every house.

═══ HEATERS (LC 475) ═══

PATTERN ▸ sort + two pointers

① sort houses & heaters

② for each house, closest heater via advancing pointer

ans = max(ans, min dist)

your implementation

Verify: