Click here to see the full article post
Why is sorting O(nlogn)? Is the worst case O(nlogn*x) when you have to compare s1 and s2 for n/2 times?
@zestypanda Yes, you are right. Updated. Thanks
Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.