Block Placement Queries: coding question

Available question text

Support inserting obstacles at points on the nonnegative number line and, for each query, determine whether there exists any obstacle-free interval of length >= sz fully inside [0, x] (touching obstacles is allowed). Algorithmically this reduces to maintaining an ordered set of obstacle positions and checking if the maximum consecutive gap within [0, x] is at least sz.

Continue with questions that share topics or the same question type.

Reverse Pairs
Coding · Array · Binary Indexed Tree · Binary Search
132 Pattern
Coding · Array · Binary Search · Monotonic Stack
Number of Flowers in Full Bloom
Coding · Array · Binary Search · Hash Table
Partition Array Into Two Arrays to Minimize Sum Difference
Coding · Array · Binary Search · Bit Manipulation

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 3161. Block Placement Queries
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source

LeetCode company tags · 6 records

Hudson River Trading
Block Placement Queries
Reported date not specified · Source window: 3mo
Source snapshot: Oct 20, 2026
Source frequency score: 100. This is not an interview probability.
View source
Hudson River Trading
Block Placement Queries
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 100. This is not an interview probability.
View source
Roblox
Block Placement Queries

Available question text

Block Placement Queries

Available question text

Related questions

Block Placement Queries

Available question text

Related questions