Return the longest contiguous subarray with all distinct values

Given an array `shows` of integers, return the **longest contiguous subarray** in which all values are **distinct** (no repeats within the subarray). ### Function signature - Input: `shows: List[int]` - Output: `List[int]` (the subarray values) ### Tie-breaking If multiple subarrays have the same maximum length, return the one with the **smallest starting index**. ### Examples - `shows = [1, 2, 3, 2, 4]` → `[1, 2, 3]` - `shows = [5, 5, 5]` → `[5]` - `shows = []` → `[]` ### Constraints - Target `O(n)` time. - Extra space up to `O(n)` is allowed.