mediumIntroduction to ArraysPattern: Mixed

Contiguous Unique Element Counts Solution

Problem Statement

Given a list of integers `values`, determine the total count of distinct groups of unique elements that appear consecutively without any interruption.

Examples

Example 1:

Input:[1,2,3,1,2,3,4,5]

Output:3

Explanation: There are three groups of unique elements: [1,2,3], [1,2,3], and [4,5]

Example 2:

Input:[1,1,2,3,4,5]

Output:1

Explanation: There is one group of unique elements: [1,2,3,4,5] since duplicate elements are ignored in a group but 1 is not interrupted by another element

Example 3:

Input:[1,2,3,4,5,1,2,3,4]

Output:2

Explanation: There are two groups of unique elements: [1,2,3,4,5] and [1,2,3,4]

Constraints

A will not contain any zeros
The number of elements in A will be at most 1000

Time: O(n) Space: O(1)

Analyze constraints and compute optimal solutions step-by-step.

Run, Test & Submit Code

Ready to practice this challenge? Launch our interactive compilation environment with compiler validation.

Solve on Interactive Workspace

Tested Solutions

No solution code is currently loaded.

Complete this code in the workspace editor.