Solve a Minimum Interval Problem | Dataford Interview Questions

Explain how you would solve a minimum interval algorithm problem and what edge cases you would check.

Implement min_interval(intervals, queries). For each query value, return the length of the smallest inclusive interval [left, right] such that left <= query <= right, or -1 if no interval contains it. Return answers in the same order as queries.

Input values are integers, and intervals may overlap or contain one another.

Constraints

1 <= intervals.length <= 5000
1 <= queries.length <= 5000
intervals[i] contains exactly two integers [left, right]
left <= right
-10^9 <= left, right, queries[i] <= 10^9
Intervals are inclusive

Function Signature

def min_interval(intervals, queries):

Your question is Solve a Minimum Interval Problem. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Explain how you would solve a minimum interval algorithm problem and what edge cases you would check.

Input values are integers, and intervals may overlap or contain one another.

Constraints

1 <= intervals.length <= 5000
1 <= queries.length <= 5000
intervals[i] contains exactly two integers [left, right]
left <= right
-10^9 <= left, right, queries[i] <= 10^9
Intervals are inclusive

Function Signature

def min_interval(intervals, queries):

Your question is Solve a Minimum Interval Problem. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.