Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Block Placement Queries
Bookmark
Brute Force
Segment Tree
Input
Standard
All Checks
Tight Gaps
Custom
queries
=
[[1,2], [2,5,3], [1,4], [2,5,2]]
add @ 2
fit 3 in [0,5]
=
?
add @ 4
fit 2 in [0,5]
=
?
0
1
2
3
4
5
type 1: place an obstacle · type 2: can a block of size sz fit in [0, x]?
add @ 2
fit 3 in [0,5]
=
?
add @ 4
fit 2 in [0,5]
=
?
0
1
2
3
4
5
type 1: place an obstacle · type 2: can a block of size sz fit in [0, x]?
add @ 2
fit 3 in [0,5]
=
?
add @ 4
fit 2 in [0,5]
=
?
0
1
3
4
5
p
neighbors of 2: prev =
0
· next =
none
add @ 2
fit 3 in [0,5]
=
?
add @ 4
fit 2 in [0,5]
=
?
2
0
1
3
4
5
p
gap[2] = 2 − 0 =
2
add @ 2
fit 3 in [0,5]
=
?
add @ 4
fit 2 in [0,5]
=
?
2
0
1
2
3
4
size 3
x
need a free stretch of length
3
within [0, 5]
add @ 2
fit 3 in [0,5]
=
?
add @ 4
fit 2 in [0,5]
=
?
2
3
0
1
2
3
4
x
trailing space: x − last = 5 − 2 =
3
add @ 2
fit 3 in [0,5]
=
✓
add @ 4
fit 2 in [0,5]
=
?
2
0
1
2
3
5
p
neighbors of 4: prev =
2
· next =
none
add @ 2
fit 3 in [0,5]
=
✓
add @ 4
fit 2 in [0,5]
=
?
2
2
0
1
2
3
5
p
gap[4] = 4 − 2 =
2
add @ 2
fit 3 in [0,5]
=
✓
add @ 4
fit 2 in [0,5]
=
?
2
2
0
1
2
3
4
size 2
x
need a free stretch of length
2
within [0, 5]
add @ 2
fit 3 in [0,5]
=
✓
add @ 4
fit 2 in [0,5]
=
?
2
2
1
0
1
2
3
4
x
trailing space: x − last = 5 − 4 =
1
add @ 2
fit 3 in [0,5]
=
✓
add @ 4
fit 2 in [0,5]
=
✓
2
2
0
1
2
3
4
5
results:
✓
✓
algo
master
.
io
Step:
Start: Process block placement queries using a segment tree (max gap per obstacle) + sorted set. Sentinel obstacle at position 0.
0 / 19
Input
Standard
All Checks
Tight Gaps
Custom
queries
=
[[1,2], [2,5,3], [1,4], [2,5,2]]
0 / 19
algo
master
.
io
Step:
Start: Process block placement queries using a segment tree (max gap per obstacle) + sorted set. Sentinel obstacle at position 0.
