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.
  • Hackerrank Home
  • Prepare
    NEW
  • Certify
  • Compete
  • Career Fair
  • Hiring developers?
  1. All Contests
  2. ProjectEuler+
  3. Project Euler #149: Searching for a maximum-sum subsequence.
  4. Discussions

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

Problem
Submissions
Leaderboard
Discussions

Sort 3 Discussions, By:

recency

Please Login in order to post a comment

  • jamespate
    6 years ago+ 2 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.

    0|
    Permalink
  • gops987
    6 years ago+ 1 comment

    for 8th i am getting 397 instead of 430 plz check my algo is correct cuz its giving all other answer as correct

    0|
    Permalink
  • rexdeorum
    6 years ago+ 1 comment

    Can anyone explain how the 7th answer is 334?....coz i am getting 330 in the first column. Thanks.

    0|
    Permalink

No more comments

Need Help?


View top submissions
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy
  • Request a Feature