Learn
Practice
Newsletter
Resources
Mobile
New
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Furthest Building You Can Reach
Bookmark
Input
Example 1
Example 2
Only Bricks
Custom
heights
=
[4, 2, 7, 6, 9, 14, 12]
,
bricks
=
5
,
ladders
=
1
4
0
2
1
7
2
6
3
9
4
14
5
12
6
spend bricks on small climbs, save ladders for the big ones
4
0
2
1
7
2
6
3
9
4
14
5
12
6
spend bricks on small climbs, save ladders for the big ones
bricks
0
/5
ladders left =
1
4
0
2
1
7
2
6
3
9
4
14
5
12
6
i
climb =
2
-
4
=
-2
bricks
0
/5
ladders left =
1
4
0
2
1
7
2
6
3
9
4
14
5
12
6
i
climb ≤ 0 →
walk across for free
bricks
5
/5
ladders left =
1
brick climbs (min-heap):
5
4
0
2
1
7
2
6
3
9
4
14
5
12
6
+5
i
pay
5
bricks → used
5
of 5
bricks
5
/5
ladders left =
1
brick climbs (min-heap):
5
4
0
2
1
7
2
6
3
9
4
14
5
12
6
+5
i
climb =
6
-
7
=
-1
bricks
5
/5
ladders left =
1
brick climbs (min-heap):
5
4
0
2
1
7
2
6
3
9
4
14
5
12
6
+5
i
climb =
9
-
6
=
3
bricks
8
/5
ladders left =
1
brick climbs (min-heap):
3
5
4
0
2
1
7
2
6
3
9
4
14
5
12
6
+5
+3
i
pay
3
bricks → used
8
of 5
(over budget!)
bricks
5
/5
ladders left =
0
brick climbs (min-heap):
5
4
0
2
1
7
2
6
3
9
4
14
5
12
6
+5
i
climb =
14
-
9
=
5
bricks
10
/5
ladders left =
0
brick climbs (min-heap):
5
5
4
0
2
1
7
2
6
3
9
4
14
5
12
6
+5
+5
i
pay
5
bricks → used
10
of 5
(over budget!)
bricks
10
/5
ladders left =
0
brick climbs (min-heap):
5
4
0
2
1
7
2
6
3
9
4
14
5
12
6
+5
+5
i
Furthest building = 4 (out of resources)
algo
master
.
io
Step:
Start: heights = [4, 2, 7, 6, 9, 14, 12], bricks = 5, ladders = 1
0 / 14
Input
Example 1
Example 2
Only Bricks
Custom
heights
=
[4, 2, 7, 6, 9, 14, 12]
,
bricks
=
5
,
ladders
=
1
0 / 14
algo
master
.
io
Step:
Start: heights = [4, 2, 7, 6, 9, 14, 12], bricks = 5, ladders = 1
