How should I practice Count Distinct Values in a Sorted Array?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google onsite interview problems in FastPrep.

Is Count Distinct Values in a Sorted Array associated with Google?

FastPrep tags this as a Google onsite interview coding practice problem when the problem catalog has that company and stage context.

Problem · Array

Count Distinct Values in a Sorted Array

Learn this problem

● Medium

GoogleINTERNONSITE INTERVIEW

See Google hiring insights

Problem statement

Given a nondecreasing integer array nums, return the number of distinct values in the array.

As a follow-up, let k be the number of distinct values. Design an approach that can skip long runs of duplicates and runs in O(k log n) time.

Function

countDistinct(nums: int[]) → int

Examples

Example 1

nums = [-3,-3,-1,2,2,2,8]return = 4

The distinct values are -3, -1, 2, and 8.

Example 2

nums = []return = 0

An empty array contains no distinct values.

Constraints

0 <= nums.length <= 200000
-10^9 <= nums[i] <= 10^9
nums is sorted in nondecreasing order.