Target Interval Conflict

You are given a target half-open interval [target[0], target[1]) and an unsorted collection of half-open intervals intervals. Return true if the target conflicts with at least one interval. Otherwise, return false.
Two half-open intervals conflict when they share at least one point. Endpoints that only touch are not a conflict. Equivalently, [aStart, aEnd) and [bStart, bEnd) do not conflict when aEnd <= bStart or bEnd <= aStart.
This is a single query. The input does not need to be sorted.

Function
hasIntervalConflict(target: int[], intervals: int[][]) → boolean

Examples
Example 1
target = [4,8]
intervals = [[8,10],[1,4],[6,7]]
return = true
The intervals [1,4) and [8,10) only touch the target at an endpoint, but [6,7) shares points with [4,8).
Example 2
target = [4,8]
intervals = [[10,12],[1,4],[8,10]]
return = false
Every interval is disjoint from the target. In particular, [1,4) ends when the target begins, and [8,10) begins when the target ends.

Constraints
target.length == 2.
Every row of intervals has length 2.
Every target and collection interval is valid: start < end.
intervals may be empty and may appear in any order.

The trick is to flip the question. Instead of defining overlap, define non-overlap, which the problem hands you: two intervals are disjoint when aEnd <= bStart or bEnd <= aStart. So a conflict is the negation: target[0] < end and start < target[1]. Loop through every interval, return true on the first one that satisfies that, and return false after the loop. That's O(n) time and O(1) space, and an empty list returns false naturally. The common pitfall is using <= instead of <, which turns touching endpoints into conflicts and breaks both examples. Example 1 only returns true because of [6,7), not [1,4) or [8,10). Sorting first is wasted effort for a single query. If the boundary logic slips on the live OA, StealthCoder is the safety net that shows the correct condition so you can type it and move on.

If you see this problem in your OA tomorrow, the play is to recognize the pattern in 30 seconds. StealthCoder buys you that recognition.