Quick Overview

Find the shortest contiguous subarray containing at least k distinct values. Practice sliding-window invariants, frequency maps, and linear-time minimization.

Shortest Subarray with at Least K Distinct Values

Company: Squarepoint

Role: Quantitative Researcher

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Technical Screen

Overview: Find the shortest contiguous subarray containing at least k distinct values. Practice sliding-window invariants, frequency maps, and linear-time minimization.

Read the full Squarepoint Quantitative Researcher interview experience this question came from

Loading…