Available question text
The source lists this question by title. A full statement is not available in this collection.
Check the source for more detail. You can use the workspace to record questions, notes, and an approach.
This entry contains problem metadata. Read the source for the complete statement.
Related questions
Continue with questions that share topics or the same question type.
- Count Subarrays With K Distinct Integers
Coding · Array · Counting · Hash Table
- Minimum Operations to Reduce X to Zero
Coding · Array · Binary Search · Hash Table
- Valid Subarrays With Matching Sum Digits I
Coding · Array · Enumeration · Hash Table
- Count Number of Nice Subarrays
Coding · Array · Hash Table · Math
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
LeetCode · 1 record
No company association
Official problem listing
Minimum Subarray Length With Distinct Sum At Least K
Source snapshot: Nov 13, 2026
Verified official problem metadata. This is not evidence of a recent interview ask.
View source
LeetCode company tags · 1 record
Amazon
Archived company tags
Minimum Subarray Length With Distinct Sum At Least K
Source window: all_time
Source snapshot: Oct 20, 2026
Historical tags, not proof of a recent interview ask. Snapshot: 2026-10-20.
View source