← All problemsSign in

3872. Longest Arithmetic Sequence After Changing At Most One Element

LeetCodeArrayEnumerationOpen on judge ↗

You are given an integer array nums. A subarray is arithmetic if the difference between consecutive elements in the subarray is constant. You can replace at most one element in nums with any integer. Then, you select an arithmetic subarray from nums. Return an integer denoting the maximum length of the arithmetic subarray you can select. Example 1: Input: nums = [9,7,5,10,1] Output: 5 Exp

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start