โ† BNY Mellon questions
CodingMedium

Smallest subarray with K distinct numbers

Filed under BNY Mellon

Given an array of integers, find the size of the smallest contiguous subarray that contains exactly K distinct numbers.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related BNY Mellon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.