Distinct Values Subarrays

CSESSorting and SearchingOpen on judge ↗

Given an array of n integers, count the number of subarrays where each element is distinct. Input The first line has an integer n: the array size. The second line has n integers x_1,x_2,\dots,x_n: the array contents. Output Print the number of subarrays with distinct elements. Constraints - 1 \le n \le 2 \cdot 10^5 - 1 \le x_i \le 10^9 Example Input: 4 1 2 1 3 Output: 8 Explanation:

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI