Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Partition Array Into Two Arrays to Minimize Sum Difference
Coding · Array · Binary Search · Bit Manipulation
- Valid Triangle Number
Coding · Array · Binary Search · Greedy
- 3Sum
Coding · Array · Sorting · Two Pointers
- 3Sum Closest
Coding · Array · Sorting · Two Pointers
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 475. Heaters
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Anduril
Heaters
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 65.6. This is not an interview probability.
View source