Longest Non-Decreasing Run — Solution & Editorial | Jobs at Avian IT

Hiring process8 levels

1 IQ Test
2 Additional Online Test (If Required)
3 Office Interview with Hiring Manager
4 Unpaid Test Task (Motivation Check)
5 Paid Test Task and Follow-Up Interview
6 Iterative Paid Test Tasks
7 Office Verification
8 Final Interview with the Founder

Problems > Longest Non-Decreasing Run > Editorial

Longest Non-Decreasing Run — Solution & Editorial

Back to the Problem

Keep the length of the current run; extend it while a_i ≥ a_i-1, otherwise reset to 1.

Complexity: O(N)

Watch out: Non-decreasing allows equal neighbours — use ≥, not >.