Skip to main content
LeetCode 896, Easy. Topics: Array. View on LeetCode. Generate this problem as a practice environment: tested reference solution, 17 parametrized pytest cases, and a playground notebook:

Problem

An array is <strong>monotonic</strong> if it is either monotone increasing or monotone decreasing.</p> <p>An array <code>nums</code> is monotone increasing if for all <code>i <= j</code>, <code>nums[i] <= nums[j]</code>. An array <code>nums</code> is monotone decreasing if for all <code>i <= j</code>, <code>nums[i] >= nums[j]</code>.</p> <p>Given an integer array <code>nums</code>, return <code>true</code> <em>if the given array is monotonic, or</em> <code>false</code> <em>otherwise</em>.</p>

Examples

Constraints

  • 1 <= nums.length <= 10^5
  • -10^5 <= nums[i] <= 10^5

Solution

Reference implementation from solution.py on GitHub, full suite in test_solution.py:

Complexity

Tags

NeetCode All.
Last modified on September 7, 2026