Concurrent Volley Shot

A production shot(index) call may take between one and ten seconds and returns a boolean. All shots must start concurrently, and volleyShot completes with true as soon as any shot returns true; it returns false only after every shot has returned false.
For this deterministic judge adapter, latencies[i] is the completion time of shot i and results[i] is its returned value. Process completions in increasing latency order, breaking ties by smaller index, and return the volley result.

Function
volleyShot(latencies: int[], results: boolean[]) → boolean

Examples
Example 1
latencies = [9000,1000,5000]
results = [true,false,true]
return = true
The 1-second false completes first; the 5-second true completes the volley.
Example 2
latencies = [1000,2000,3000]
results = [false,false,false]
return = false
All shots finish false.
Example 3
latencies = [7000]
results = [true]
return = true
The only shot succeeds.

Constraints
1 <= latencies.length == results.length <= 100000.
1 <= latencies[i] <= 10000 milliseconds.

The trick: the volley returns true if any result is true, and false only if all are false. Sorting by latency and breaking ties by index doesn't change that answer. The winning completion is the earliest true, but the return value is just whether a true exists. So the whole problem collapses to checking if any element in results is true. That's O(n) time and O(1) space. The pitfall is building a full event simulation with sorting, a heap, or timers because the prompt says to process completions in order. That works at 100000 elements in O(n log n), but it's wasted effort and a place to introduce tie-break bugs. Write the sorted version only if you want to mirror the spec literally. If the live OA freezes you on the framing, StealthCoder can surface the one-line answer while you stay calm. Check the single-element case and the all-false case before submitting.

StealthCoder is the hedge for the one pattern you didn't drill. It runs invisibly during the screen share.