Longest Alternating Subarray - Practice Coding | SlaveCode
0
0123456789
0
0123456789
:
0
0123456789
0
0123456789
2765. Longest Alternating Subarray
Easy
10 Points
Array
Enumeration
You are given a 0-indexed integer array nums. A subarray s of length m is called alternating if:
Return the maximum length of all alternating subarrays present in nums or -1 if no such subarray exists.
A subarray is a contiguous non-empty sequence of elements within an array.
Examples
Example 1
Input: nums = [2,3,4,3,4]
Output: 4
Explanation:
The alternating subarrays are [2, 3] , [3,4] , [3,4,3] , and [3,4,3,4] . The longest of these is [3,4,3,4] , which is of length 4.
Example 2
Input: nums = [4,5,6]
Output: 2
Explanation:
[4,5] and [5,6] are the only two alternating subarrays. They are both of length 2.
Constraints
2 <= nums.length <= 100
1 <= nums[i] <= 104
2765. Longest Alternating Subarray
Easy
10 Points
Array
Enumeration
You are given a 0-indexed integer array nums. A subarray s of length m is called alternating if:
Return the maximum length of all alternating subarrays present in nums or -1 if no such subarray exists.
A subarray is a contiguous non-empty sequence of elements within an array.
Examples
Example 1
Input: nums = [2,3,4,3,4]
Output: 4
Explanation:
The alternating subarrays are [2, 3] , [3,4] , [3,4,3] , and [3,4,3,4] . The longest of these is [3,4,3,4] , which is of length 4.
Example 2
Input: nums = [4,5,6]
Output: 2
Explanation:
[4,5] and [5,6] are the only two alternating subarrays. They are both of length 2.