← Pointer Manipulation

Micro-Drill #5 — Check if sorted

Pointer Manipulation Target: 10s

Sortedness check is a precondition guard for binary search and merge operations.

all(a[i] <= a[i+1] for i in range(len(a)-1))

Type it from memory. Go.

Practice Problems

• 896. Monotonic Array
• 1752. Check if Array Is Sorted and Rotated

Related Coding Drills

• Drill #5 — Check palindrome string Easy
• Drill #32 — Merge two sorted arrays Easy
• Drill #4 — Two sum (sorted array) Easy