I apologize if this is not the correct place to put this, but I was working through the introductory set of problems on Computer Science and am certain that there is an ambiguity in the fourth problem. Since the problem statement does not include a "Request clarification" link, I choose this way.

The problem statement asks to find the longest subsequence of consecutive and increasing integers in a given file of integers, and give (the absolute value of) the sum of the integers in that sequence. However, I find that there are two sequences of maximum length in the file (with different sums). So unless I have completely misunderstood the problem or have gone completely mad, something is wrong. Could someone check this please?

By the way, I'm usually not such a nag, but I only get one shot at answering and I want to (try and) avoid starting at a low level.

## Comments

Sort by:

TopNewestHi Thomas,

We will have someone look into it and they will correspond with you directly. Thanks for bringing it to our attention. – Peter Taylor Staff · 3 years, 10 months ago

Log in to reply