Question

Longest Subarray using Python or C Given an array of integers, what is the length of the longest subarray containing no more than two distinct values such that the distinct values differ by no more than 1? Example arr = [0,1,2,1,2,3] The largest such subarray has length 4: [1,2,1,2]. arr = [1, 1, 1, 3, 3, 2, 2] The largest such subarray has length 4: [3, 3, 2, 2]. The values 1 and 3 differ by more than 1 so [1, 1, 1, 3, 3] is not valid. Function Description Complete the function longestSubarray in the editor below. longestSubarray has the following parameter(s): int arr[n]: an array of integers Returns: int: the length of the longest subarray Constraints The longest subarray will have fewer than 35 elements. $1 \le n \le 10^5$ $1 \le arr[i] \le 10^9$ ? Sample Case Sample Input For Custom Testing 5 1 2 3 4 5 Sample Output 2 Explanation n = 5 arr = [1, 2, 3, 4, 5] All elements are distinct, so any subarray of length 2 is the maximum.

          Longest Subarray
using Python or C
Given an array of integers, what is the length of the longest subarray containing no more
than two distinct values such that the distinct values differ by no more than 1?
Example
arr = [0,1,2,1,2,3]
The largest such subarray has length 4: [1,2,1,2].
arr = [1, 1, 1, 3, 3, 2, 2]
The largest such subarray has length 4: [3, 3, 2, 2]. The values 1 and 3 differ by more than 1
so [1, 1, 1, 3, 3] is not valid.
Function Description
Complete the function longestSubarray in the editor below.
longestSubarray has the following parameter(s):
int arr[n]: an array of integers
Returns:
int: the length of the longest subarray
Constraints
The longest subarray will have fewer than 35 elements.
$1 \le n \le 10^5$
$1 \le arr[i] \le 10^9$
? Sample Case
Sample Input For Custom Testing
5
1
2
3
4
5
Sample Output
2
Explanation
n = 5
arr = [1, 2, 3, 4, 5]
All elements are distinct, so any subarray of length 2 is the maximum.

Longest Subarray
using Python or C
Given an array of integers, what is the length of the longest subarray containing no more
than two distinct values such that the distinct values differ by no more than 1?
Example
arr = [0,1,2,1,2,3]
The largest such subarray has length 4: [1,2,1,2].
arr = [1, 1, 1, 3, 3, 2, 2]
The largest such subarray has length 4: [3, 3, 2, 2]. The values 1 and 3 differ by more than 1
so [1, 1, 1, 3, 3] is not valid.
Function Description
Complete the function longestSubarray in the editor below.
longestSubarray has the following parameter(s):
int arr[n]: an array of integers
Returns:
int: the length of the longest subarray
Constraints
The longest subarray will have fewer than 35 elements.
1 ≤ n ≤ 10^5
1 ≤ arr[i] ≤ 10^9
? Sample Case
Sample Input For Custom Testing
5
1
2
3
4
5
Sample Output
2
Explanation
n = 5
arr = [1, 2, 3, 4, 5]
All elements are distinct, so any subarray of length 2 is the maximum.

Added by Pamela B.

Question

Please give Ace some feedback