LeetCode
Question
·
Dec 2021
·
Los Angeles
Uber | OA | find subarrays with at least k unique numbers
4 upvotes
1,605 views
7 replies
Question Details
Giving an array and an int k; find how mang subarrays which has at least k unique numbers(unique number means this number only appear once in this subarray) for example: [1, 2,1,1] k...
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Arrays
Two Pointers