LeetCode

Practice › LeetCode › LeetCode 37xx › LeetCode 3738 - Longest Non-Decreasing Subarray After Replacing at Most One Element

LeetCode 3738 - Longest Non-Decreasing Subarray After Replacing at Most One Element

assert Solution().

leetcode medium array dynamic-programming

LeetCode Problem 3738

Difficulty: 🟡 Medium
Topics: Array, Dynamic Programming

Solution

Problem Understanding == 5 # already non-decreasing

edge cases

assert Solution().

← Previous LeetCode 3737 - Count Subarrays With Majority Element I Next → LeetCode 3739 - Count Subarrays With Majority Element II

© brain Built with tago