Back to course home
0% completed
Vote For New Content
Maximum Distinct Elements (medium)
Problem Statement
Given an array of numbers nums and an integer K, find the maximum number of distinct elements after removing exactly K elements from the nums array.
Example 1:
- Input: nums = [7, 3, 5, 8, 5, 3, 3], K=2
- Expected Output: 3
- Explanation: We can remove two occurrences of 3 to be left with 3 distinct numbers [7, 3, 8], we have to skip 5 because it is not distinct and occurred twice
.....
.....
.....
Like the course? Get enrolled and start learning!
On this page