Increasing Subsegment Problem Statement

Given a sequence ARR consisting of N integers, your task is to identify the longest subsegment of ARR, where you can change at most one number to make the subsegment strictly increasing.

Input:

The first line contains a single integer T representing the number of test cases. Each test case starts with an integer 'N' (length of 'ARR'). The second line of each test case follows with 'N' space-separated integers denoting the elements of 'ARR'.

Output:

For each test case, output the length of the longest possible subsegment after changing at most one number.

Example:

Input:

2 4 1 3 2 4 5 10 20 10 30 40

Output:

4 5

Constraints:

1

Question

Increasing Subsegment Problem Statement

Given a sequence ARR consisting of N integers, your task is to identify the longest subsegment of ARR, where you can change at most one number to make the subsegment strictly increasing.

Input:

The first line contains a single integer T representing the number of test cases.
Each test case starts with an integer 'N' (length of 'ARR').
The second line of each test case follows with 'N' space-separated integers denoting the elements of 'ARR'.

Output:

For each test case, output the length of the longest possible subsegment after changing at most one number.

Example:

Input:

2
4
1 3 2 4
5
10 20 10 30 40

Output:

4
5

Constraints:

1 <= T <= 10
1 ≤ N ≤ 10⁵
1 ≤ ARR[i] ≤ 10⁹
Time Limit: 1 sec

Note:

You do not need to print anything, it has already been taken care of. Just implement the given function.

Accepted Answer

Find the longest subsegment where at most one number can be changed to make it strictly increasing.

Iterate through the array and keep track of the longest increasing subsegment with at most one change.
If a number violates the increasing order, try changing it and check if the subsegment becomes strictly increasing.
Update the length of the longest subsegment found so far.
Return the length of the longest subsegment for each test case.

Increasing Subsegment Problem Statement

Input:

Output:

Example:

Input:

Output:

Constraints:

Note:

ACKO Software Developer Intern interview questions & answers

Popular interview questions of Software Developer Intern