Tap here to switch tabs
Problem
Submissions

Problem: Subarrays with K Different Integers

Subarrays with K Different Integers asks you to count contiguous subarrays in an integer array that contain exactly k distinct values, then return the number of such good subarrays.

Statement

You are given an integer array nums and an integer k. Your task is to return the number of good subarrays of nums.

A good subarray is a contiguous subarray that contains exactly k distinct integers. For example, in the array [1,2,3,1,2][1, 2, 3, 1, 2], the subarray [1,2,3][1, 2, 3]contains 33 distinct integers: 11, 22, and 33.

Constraints:

  • 1≤1 \leq nums.length ≤2∗104\leq 2 * 10^{4}

  • 1≤1 \leq nums[i], k ≤\leq nums.length

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Subarrays with K Different Integers

Subarrays with K Different Integers asks you to count contiguous subarrays in an integer array that contain exactly k distinct values, then return the number of such good subarrays.

Statement

You are given an integer array nums and an integer k. Your task is to return the number of good subarrays of nums.

A good subarray is a contiguous subarray that contains exactly k distinct integers. For example, in the array [1,2,3,1,2][1, 2, 3, 1, 2], the subarray [1,2,3][1, 2, 3]contains 33 distinct integers: 11, 22, and 33.

Constraints:

  • 1≤1 \leq nums.length ≤2∗104\leq 2 * 10^{4}

  • 1≤1 \leq nums[i], k ≤\leq nums.length