Since the size of the string in problem = 100000; and we are using the O(n^2) approach, shouldn’t this create a TLE. Are test cases not good to verify for extreme cases? I mean for such large input and O(n^2) approach would generally give TLE on CP platforms.
Time complexity
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.