992. Subarrays with K Different Integers

Hard

4.1K

61

Given an integer array `nums`

and an integer `k`

, return *the number of good subarrays of *

`nums`

.A **good array** is an array where the number of different integers in that array is exactly `k`

.

- For example,
`[1,2,3,1,2]`

has`3`

different integers:`1`

,`2`

, and`3`

.

A **subarray** is a **contiguous** part of an array.

**Example 1:**

Input:nums = [1,2,1,2,3], k = 2Output:7Explanation:Subarrays formed with exactly 2 different integers: [1,2], [2,1], [1,2], [2,3], [1,2,1], [2,1,2], [1,2,1,2]

**Example 2:**

Input:nums = [1,2,1,3,4], k = 3Output:3Explanation:Subarrays formed with exactly 3 different integers: [1,2,1,3], [2,1,3], [1,3,4].

**Constraints:**

`1 <= nums.length <= 2 * 10`

^{4}`1 <= nums[i], k <= nums.length`

Accepted

90.9K

Submissions

166.4K

Acceptance Rate

54.6%

Seen this question in a real interview before?

1/4

Yes

No

Discussion (0)

Related Topics

Copyright ©️ 2023 LeetCode All rights reserved