You are given a string of length 'n'.
If a string contains at least one character whose frequency is greater than or equal to the half of the length of the string, then the string is called superior.
You are required to find the length of the longest superior substring available in the given string.
Note: Here half is considered under integer division i.e. 5/2=2 , etc.
The string contains only lowercase English alphabets.
I have tried O(n^2) solution(s) with some optimization(s) which obviously got timed out. I realized that there are better:- O(nlogn) or O(n) approaches,can anybody explain them?