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.
The code for the ProjectEuler Problem 149 seems to scale well. Here are my results for n = 5000 instead of 2000. Could someone check the number before the time in milliseconds?
-393027 86613
89385246
time in milliseconds = 1609
Press any key to continue . . .
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #149: Searching for a maximum-sum subsequence.
You are viewing a single comment's thread. Return to all comments →
The code for the ProjectEuler Problem 149 seems to scale well. Here are my results for n = 5000 instead of 2000. Could someone check the number before the time in milliseconds?
-393027 86613 89385246 time in milliseconds = 1609 Press any key to continue . . .