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.
Even with the fastest solution recommended here by Marty, test-cases 3 (7693 items) & 4 (9446 items) fail on Python 3.7 with "Your code did not execute within the time limits".
Just can't see how to streamline it further with Python...? Runtime for case 3 on my laptop is 5s. So HR is being kinda mean calling that too long?
Not so "easy" after all. Is the only solution to go for a faster language? (I've done probably 100+ other problems successfully with Python3, to date).
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 →
Even with the fastest solution recommended here by Marty, test-cases 3 (7693 items) & 4 (9446 items) fail on Python 3.7 with "Your code did not execute within the time limits".
Just can't see how to streamline it further with Python...? Runtime for case 3 on my laptop is 5s. So HR is being kinda mean calling that too long?
Not so "easy" after all. Is the only solution to go for a faster language? (I've done probably 100+ other problems successfully with Python3, to date).