665. Non-decreasing Array (25/06/2022)
Problem:
Given an array nums with n integers, your task is to check if it could become non-decreasing by modifying at most one element.
We define an array is non-decreasing if nums[i] <= nums[i + 1] holds for every i (0-based) such that (0 <...
leetcodes.hashnode.dev2 min read