https://leetcode.com/problems/non-decreasing-array/ class Solution: def checkPossibility(self, nums: List[int]) -> bool: changed = False for i in range(len(nums) - 1): if nums[i] = nums[i-1]: nums[i] = nums[i+1] else: nums[i+1] = nums[i] changed = True return Truewhen considering pair, we can either adjust lef..