Merge Sort (TLE, in O(nlogn))

#1

I have implemented O(nlog n) solution of sort using merge sort.Now its getting TLE .Any hint of how getting it AC in pyhton3?

#2

Hey @nikhil_sarda, here

while(rptr<n):
        lis.append(a[rptr])
        rptr+=1

in place of n, it should be r.

Hope this resolved your doubt.
Plz mark it as resolved in my doubts section. :blush: