Find longest unique show window

Q: Find longest unique show window

This is a Coding & Algorithms interview question from Netflix for Software Engineer roles. View the full question and solution on PracHub.

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

Given an array of show names (strings) representing a user's viewing history, return the start and end indices of a longest contiguous subarray that contains no repeated show names (case-insensitive). If multiple answers exist, return any one. Achieve O(n) time and O(min(n, m)) space where n is the length and m is the number of distinct shows. Follow-up: adapt your solution to a streaming input API that yields one show name at a time and must always be able to report the current longest unique-name window; describe data structures, update complexity, and memory bounds.

Find longest unique show window

Comments (0)