Quick Overview

This question evaluates understanding of array algorithms, handling of distinct-element counting, and the ability to design time- and space-efficient solutions for constrained subarray queries.

Find shortest subarray with ≥k distinct integers

Company: Google

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Technical Screen

Overview: This question evaluates understanding of array algorithms, handling of distinct-element counting, and the ability to design time- and space-efficient solutions for constrained subarray queries.

Read the full Google Software Engineer interview experience this question came from

Loading…