Count Integers Appearing in a Single Block | Leetcode 4038 | Weekly Contest 517 | DRY RUN
VIJAY KUMAR [IIT-BHU]
6:44199 views
6 video solutions available
Count Integers Appearing in a Single Block - Video Solution
Watch 6 video solutions for Count Integers Appearing in a Single Block, a easy level problem. This walkthrough by VIJAY KUMAR [IIT-BHU] has 199 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.
Problem Statement
You are given an integer array nums.
An integer x is special if all occurrences of x in nums appear in a single contiguous block.
Return the number of distinct special integers in nums.
Example 1:
Input: nums = [1,2,2,1]
Output: 1
Explanation:
- 1 appears at indices 0 and 3, forming two separate blocks, so it is not special.
- 2 appears in a single contiguous block at indices
[1, 2], so it is special.
Therefore, there is one special integer.
Example 2:
Input: nums = [3,3,1,2,2,1]
Output: 2
Explanation:
- 3 appears in a single contiguous block at indices
[0, 1], so it is special. - 1 appears at indices 2 and 5, forming two separate blocks, so it is not special.
- 2 appears in a single contiguous block at indices
[3, 4], so it is special.
Therefore, there are two special integers.
Constraints:
1 <= nums.length <= 1001 <= nums[i] <= 100