Is This Slice Sorted — 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 > Is This Slice Sorted > Editorial

Is This Slice Sorted — Solution & Editorial

Back to the Problem

Prefix-count the DESCENT positions (a_i < a_i−1); a slice is sorted iff it contains none strictly inside.

Complexity: O(N + Q)