Smallest Substring Of A String Containing All Unique Characters Of Itself

medium
Question Solve Solutions 
1. You are given a string str.
2. You have to find the smallest window length that contains all the unique characters of the given string.

Input Format

A string

Output Format

A number representing smallest window length that contains all unique characters of the given string.

Constraints

1 <= length of string <= 10^6

Example

Input
aabcbcdbca
Output
4
Previous
Smallest Substring Of A String Containing All Characters Of Another String
Next
Longest Substring With Non Repeating Characters

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