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.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Hi Thomas,
We will have someone look into it and they will correspond with you directly. Thanks for bringing it to our attention.