Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Heaters
Bookmark
Brute Force
Sort + Binary Search
Sort + Two Pointers
Input
Standard
Multiple heaters
Far apart
Exact coverage
Custom
houses
=
[1, 2, 3]
,
heaters
=
[2]
Houses
0
1
1
2
2
3
Heaters
(sorted)
0
2
Houses
0
1
1
2
2
3
Heaters
(sorted)
0
2
Houses
0
1
1
2
2
3
house
Heaters
(sorted)
0
2
result = 0
Houses
0
1
1
2
2
3
house
Heaters
(sorted)
0
2
|1 - 2| = 1
result = 0
Houses
0
1
1
2
2
3
house
Heaters
(sorted)
0
2
closest heater is 2, distance = 1
result = 1
Houses
0
1
1
2
2
3
house
Heaters
(sorted)
0
2
result = 1
Houses
0
1
1
2
2
3
house
Heaters
(sorted)
0
2
closest heater is 2, distance = 0
result = 1
Houses
0
1
1
2
2
3
house
Heaters
(sorted)
0
2
result = 1
Houses
0
1
1
2
2
3
house
Heaters
(sorted)
0
2
|3 - 2| = 1
result = 1
Houses
0
1
1
2
2
3
house
Heaters
(sorted)
0
2
closest heater is 2, distance = 1
result = 1
Houses
0
1
1
2
2
3
Heaters
(sorted)
0
2
result = 1
algo
master
.
io
Step:
Start: find the minimum radius so every house is covered by a heater
0 / 10
Input
Standard
Multiple heaters
Far apart
Exact coverage
Custom
houses
=
[1, 2, 3]
,
heaters
=
[2]
0 / 10
algo
master
.
io
Step:
Start: find the minimum radius so every house is covered by a heater