Equivalent Subarrays

medium

Hashmap and Heaps

Question Solve Solutions

1. You are given an array of integers(arr).
2. You have to find the count of equivalent subarrays.
3. A subarray is equivalent if,
   count of unique integers in the subarray = count of unique integers in the given array.

Input Format

A number N arr1 arr2... N numbers

Output Format

A number representing count of equivalent subarrays.

Constraints

1 <= N <= 10^5
-2^31 <= arr[i] <= 2^31-1

Example

Input

5
2 1 3 2 3

Output

Count Of Substrings With Exactly K Unique Characters

Maximum Consecutive Ones - 1

Related Questions

easy Double Pair Array easy Subdomain Visit Count easy Group Anagrams easy Isomorphic Strings easy Valid Anagram easy Longest Subarray With Sum Divisible By K easy The Skyline Problem easy Word Pattern easy Number Of Employees Under Every Manager easy Find Itinerary From Tickets easy Check If An Array Can Be Divided Into Pairs Whose Sum Is Divisible By K easy Largest Subarray With Zero Sum easy Count Distinct Elements In Every Window Of Size K easy Largest Subarray With Contiguous Elements medium Count Of All Subarrays With Zero Sum hard Smallest Substring Of A String Containing All Characters Of Another String