In problem Equivalent string , I am using Divide and Conquer approach to solve.
I am checking all four cases , left_left , right_right , left_right , right_left
by the code is giving time limit exeeded . Since we are not making more than log n divisions , why it is giving TLE and how to optimize it . Can anyone tell me . Thanks
Pseudo code
[this is educational](https://www.wolframalpha.com/input/?i=T(n)%3D4*T(n%2F2))
...codeforces markdown is really buggy lol