Implement Concurrent Any-True Shot
Company: Temporal
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Technical Screen
You are given a function `shot(index) -> bool`. Each call may take between 1 and 10 seconds to return.
Implement `volleyShot(indices) -> bool` for a list of indices.
Requirements:
- Start multiple `shot` calls concurrently.
- Return `True` as soon as any call returns `True`.
- Return `False` only after all calls have completed and every call returned `False`.
- If the answer is already known, do not keep waiting for slower calls when the runtime allows best-effort cancellation.
- If `indices` is empty, return `False`.
The focus is on concurrency and early termination.
Quick Answer: This question evaluates proficiency in concurrent programming, focusing on coordination, synchronization, early termination, and best-effort cancellation when racing multiple asynchronous boolean-returning calls.
Given shot records [index, duration, result], return whether volleyShot would return True. Empty input returns False.
Constraints
- Inputs are Python literals matching the function signature.
- Return a deterministic exact-match value.
Examples
Input: ([(1,5,False),(2,2,True),(3,9,False)],)
Expected Output: True
Explanation: A true shot exists.
Input: ([],)
Expected Output: False
Explanation: No shots.
Input: ([(1,1,False),(2,3,False)],)
Expected Output: False
Explanation: All false.
Hints
- Choose a representation that makes the requested operation direct.
- Handle empty inputs and boundary cases first.