How should I practice Dynamic Point-in-Range Queries?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google onsite interview problems in FastPrep.

Is Dynamic Point-in-Range Queries associated with Google?

FastPrep tags this as a Google onsite interview coding practice problem when the problem catalog has that company and stage context.

Dynamic Point-in-Range Queries

Google● MediumNEW GRADONSITE INTERVIEW

Learn

Problem statement

Process an initially empty collection of closed integer intervals.

[0,left,right] inserts the interval [left,right].
[1,point] asks whether point is covered by at least one interval inserted earlier.

Intervals may overlap and endpoints may be negative. Return one Boolean for every query operation, in operation order.

Function

processRangeQueries(operations: int[][]) → boolean[]

Examples

Example 1

operations = [[0,1,5],[1,3],[1,6],[0,4,8],[1,6]]return = [true,false,true]

Point 3 is covered by [1,5]; point 6 becomes covered only after inserting [4,8].

Example 2

operations = [[1,0],[0,-3,-1],[1,-2],[1,0]]return = [false,true,false]

The first query occurs before any insertion. The negative interval covers -2 but not 0.

Example 3

operations = []return = []

No queries produce no results.

Constraints

0 <= operations.length <= 200000.
An insert row has exactly three integers and satisfies left <= right.
A query row has exactly two integers.
Endpoints and query points are signed 32-bit integers.