Given an array of integers, count how many distinct values exist in the array.
Example:
Input: [1, 5, -3, 1, -4, 2, -4, 7, 7] Output: 6 Explanation: the distinct values in the array are [1, 5, -3, -4, 2, 7]
Note:
Your algorithm should run in O(n) time and use O(n) extra space.
Walkthroughs of the solution. Try the steps first, then watch to compare approaches.
Free plan: 30 tutor messages. PRO is unlimited.
Saved
Ctrl + Enter to check
