CPMagical CP Library

Problem solution · C++

Longest Alternating Subarray After Removing at Most One Element

Longest Alternating Subarray After Removing at Most One Element: a C++ solution using sliding window or two pointers. Learn the idea, check the complexity, and read the full code, with credit to Kamyu LeetCode Solutions.

Technique
Sliding window or two pointers
Source
Kamyu LeetCode Solutions
Length
84 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Sliding window or two pointers

For Longest Alternating Subarray After Removing at Most One Element, the implementation maintains a moving interval and updates only the information that enters or leaves the window.

  1. Choose the invariant that makes a window valid or useful.
  2. Advance the right boundary and add the new element.
  3. Move the left boundary only as needed while maintaining the invariant and updating the answer.

Code notes

  • 84 lines of C++ from the credited upstream file longest-alternating-subarray-after-removing-at-most-one-element.cpp.
  • The implementation visibly relies on sequence storage.
  • 5 loop blocks detected.

Complexity

Confirm that neither pointer moves backwards; if so, the scan is usually linear apart from the window’s data-structure operations.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from Kamyu LeetCode Solutions by kamyu104 and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeLongest Alternating Subarray After Removing at Most One Element · C++C++
Use this to learn the idea, then write your own version.
// Time:  O(n)// Space: O(1) // dpclass Solution {public:    int longestAlternating(vector<int>& nums) {        int result = 1, up1 = 1, up0 = 1, down1 = 1, down0 = 1;        for (int i = 0; i + 1 < size(nums); ++i) {            if (nums[i] < nums[i + 1]) {                tie(up1, up0, down1, down0) = tuple(down1 + 1, down0 + 1, down0, 1);            } else if (nums[i] > nums[i + 1]) {                tie(up1, up0, down1, down0) = tuple(up0, 1, up1 + 1, up0 + 1);            } else {                tie(up1, up0, down1, down0) = tuple(up0, 1, down0, 1);            }            result = max({result, up1, down1});        }        return result;    }}; // Time:  O(n)// Space: O(1)// dpclass Solution2 {public:    int longestAlternating(vector<int>& nums) {        int result = 1, up0 = 1, down0 = 1;        int up1 = 0, down1 = 0;        for (int i = 0; i + 1 < size(nums); ++i) {            if (nums[i] < nums[i + 1]) {                tie(up1, up0, down1, down0) = tuple(down1 + 1, down0 + 1, down0, 1);            } else if (nums[i] > nums[i + 1]) {                tie(up1, up0, down1, down0) = tuple(up0, 1, up1 + 1, up0 + 1);            } else {                tie(up1, up0, down1, down0) = tuple(up0, 1, down0, 1);            }            result = max({result, up1, down1, up0, down0});        }        return result;    }}; // Time:  O(n)// Space: O(n)// prefix sumclass Solution3 {public:    int longestAlternating(vector<int>& nums) {        const auto& cmp = [](int a, int b) {            return (a > b) - (a < b);        };         vector<int> left(size(nums), 1);        for (int i = 1; i < size(nums); ++i) {            const auto& diff = cmp(nums[i - 1], nums[i]);            if (!diff) {                continue;            }            left[i] = (i - 2 >= 0 && cmp(nums[i - 2], nums[i - 1]) == -diff) ? left[i - 1] + 1 : 2;        }        vector<int> right(size(nums), 1);        for (int i = size(nums) - 2; i >= 0; --i) {            const auto& diff = cmp(nums[i], nums[i + 1]);            if (!diff) {                continue;            }            right[i] = (i + 2 < size(nums) && cmp(nums[i + 1], nums[i + 2]) == -diff) ? right[i + 1] + 1 : 2;        }        int result = ranges::max(left);        for (int i = 1; i + 1 < size(nums); ++i) {            const auto& diff = cmp(nums[i - 1], nums[i + 1]);            if (!diff) {                continue;            }            const auto& l = (i - 2 >= 0 && cmp(nums[i - 2], nums[i - 1]) == -diff) ? left[i - 1] : 1;            const auto& r = (i + 2 < size(nums) && cmp(nums[i + 1], nums[i + 2]) == -diff) ? right[i + 1] : 1;            result = max(result, l + r);        }        return result;    }};

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗