Longest distinct subarray

Hard

Given an array of numbers, write a function that returns the indices of the longest subarray with unique elements.

For example, given the array:

[4, 9, 9, 3, 4, 7]

Your function's output should return the tuple (2, 5) since the subarray between those indices: [9, 3, 4, 7] is the longest one with distinct entries.

Note that if there are multiple subarrays with the same length, return the indices of the first subarray found.

Try it first

def distinct_subarray(arr: list[int]) -> tuple[int, int]:
    # implement distinct_subarray
    return (None, None)

1def distinct_subarray(arr: list[int]) -> tuple[int, int]:
2    # implement distinct_subarray
3    return (None, None)
4

Solution

6 Essential Hash Tables Coding Interview Problems

Master Hash Tables by trying the coding challenges below.

Want to confidently pass your next coding interview?

Stack Bash helps new and veteran software engineers master data structures and algorithms for technical interviews.