This is the problem .
According to the accepted solution of other coders, the following test case gives a "Yes". But, shouldn't it give a "No" ?
6 1 2 1 1 1 1 1 1 6
Any help would be really appreciated.
# | User | Rating |
---|---|---|
1 | Benq | 3813 |
2 | tourist | 3768 |
3 | maroonrk | 3570 |
4 | Radewoosh | 3535 |
5 | fantasy | 3526 |
6 | jiangly | 3523 |
7 | Um_nik | 3522 |
8 | orzdevinwang | 3441 |
9 | cnnfls_csy | 3427 |
10 | zh0ukangyang | 3423 |
# | User | Contrib. |
---|---|---|
1 | awoo | 180 |
2 | -is-this-fft- | 178 |
3 | nor | 169 |
4 | Um_nik | 168 |
5 | SecondThread | 164 |
6 | maroonrk | 163 |
7 | adamant | 162 |
8 | kostka | 161 |
9 | YouKn0wWho | 158 |
10 | antontrygubO_o | 154 |
This is the problem .
According to the accepted solution of other coders, the following test case gives a "Yes". But, shouldn't it give a "No" ?
6 1 2 1 1 1 1 1 1 6
Any help would be really appreciated.
Name |
---|
Note that the non-decreasing and the non-increasing sequences are also considered ladders.
Yeah, I understand that.
But the given query is on the range of [1, 6]. In that range, the sequence is [2, 1, 1, 1, 1, 1].
So, it is decreasing, and then non-decreasing/non- increasing. Hence, this doesn't qualify as a ladder.
Because the question says, it should satisfy either of the three criteria:
But, the given is decreasing and then non- decreasing. Hence, it doesn't qualify in either of the three criteria.
"it is decreasing" --> it is non-increasing. Thus point 3 is satisfied.
It is still failing.
My submission
Can you tell your approach?