We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
We should consider worst case complexity the run time complexity will be O(nmlogn) where m is the length which are equal and the last 1 letter are different.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Big Sorting
You are viewing a single comment's thread. Return to all comments →
We should consider worst case complexity the run time complexity will be O(nmlogn) where m is the length which are equal and the last 1 letter are different.