# Check whether an array can be made strictly increasing by removing at most one element

Check whether an array can be made strictly increasing by removing at most one elementGiven an array arr[] consisting of N integers, the task is to check whether it is possible to make the given array strictly increasing by removing at most one element. If it is possible to make the array strictly increasing, then print “Yes”. Otherwise, print “No”.Examples:Input: arr[] = {1, 1, 2}Output: YesExplanation: Removing an occurrence of 1 modifies the array to {1, 2}, which is strictly increasing array.Input: arr[] = {2, 2, 3, 4, 5, 5} Output: NoApproach: The given problem can be solved by traversing the array arr[] and count the indices satisfying the condition arr[i-1] ≥ arr[i]. Follow the steps below to solve the problem:Initialize two variables, say count as 0 and index as -1, to store the count of elements needed to be removed and the index of the removed element respectively.Traverse the given array over the range [1, N – 1] and if the value of arr[i – 1] is at least arr[i] increment the value of count by 1 and update the value of the index as i.If the value of count is greater than 1, then print “No” and return.Otherwise, check for the following conditions:If the value of count is equal to 0, then print “Yes” and return.If the index is either equal to (N – 1) or equal to 0, then print “Yes” and return.Check if removing the element at index makes the arr[index – 1] < arr[index + 1], then print “Yes” and return.Check if removing the element at index – 1 makes the arr[index – 2] < arr[index], then print “Yes” and return.After completing the above steps, if none of the above cases are satisfied, then print “No”.Below is the implementation of the above approach:C++#include using namespace std;bool check(int arr[], int n){            int count = 0;            int index = -1;        for (int i = 1; i < n - 1; i++) {                        if (arr[i - 1] >= arr[i]) {                        count++;                        index = i;        }    }        if (count > 1)        return false;        if (count == 0)        return true;            if (index == n – 1 || index == 1)        return true;        if (arr[index – 1] < arr[index + 1])        return true;        if (arr[index - 2] < arr[index])        return true;    return false;}int main(){    int arr[] = { 1, 2, 5, 3, 5 };    int N = sizeof(arr) / sizeof(arr[0]);    if (check(arr, N))        cout 1)        return false;        if (count == 0)        return true;            if (index == n - 1 || index == 1)        return true;        if (arr[index - 1] < arr[index + 1])        return true;        if (arr[index - 2] < arr[index])        return true;    return false;}public static void main(String args[]){    int []arr = { 1, 2, 5, 3, 5 };    int N = arr.length;         if (check(arr, N))        System.out.println("Yes");    else        System.out.println("No");}}Output: YesTime Complexity: O(N)Auxiliary Space: O(1)