Return the longest contiguous subarray with all distinct values

Q: Return the longest contiguous subarray with all distinct values

This question evaluates a candidate's understanding of array-processing algorithms, duplicate detection, and maintaining state to identify the longest contiguous subarray with distinct values, assessing algorithmic thinking and data structure usage.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Loading...

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.

Return the longest contiguous subarray with all distinct values

Quick Overview

Function signature

Tie-breaking

Examples

Constraints

Comments (0)