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.

First, I would like state that my code is C# not Python. I am at 50 points on the first half of the test cases. I take approximately my whole alloted time of 3 seconds for most of the test cases. Three seconds sounds like a pretty tight time constraint for C#. I am using Kadane's algorithm which is Order(n) where n is the length of the array to be searched for a maximum sum. I could perhaps use parallel tasks to speed things up in some cases. I will complete, if possible. the Project Euler Problem 149 with this code, and report my runtime in this forum. Thanks in advance for any useful advice.

## Project Euler #149: Searching for a maximum-sum subsequence.

You are viewing a single comment's thread. Return to all comments →

First, I would like state that my code is C# not Python. I am at 50 points on the first half of the test cases. I take approximately my whole alloted time of 3 seconds for most of the test cases. Three seconds sounds like a pretty tight time constraint for C#. I am using Kadane's algorithm which is Order(n) where n is the length of the array to be searched for a maximum sum. I could perhaps use parallel tasks to speed things up in some cases. I will complete, if possible. the Project Euler Problem 149 with this code, and report my runtime in this forum. Thanks in advance for any useful advice.