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.
Once again - sorting is increasing the complexity of the solution to O(N log N). In your example you are doing it twice, which if not optimised by compiler/runtime would result in two times poorer performance.
It could be solved without sorting with complexity O(N).
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Mini-Max Sum
You are viewing a single comment's thread. Return to all comments →
Once again - sorting is increasing the complexity of the solution to O(N log N). In your example you are doing it twice, which if not optimised by compiler/runtime would result in two times poorer performance.
It could be solved without sorting with complexity O(N).