1. Given an array and its length, return 1 if its possible if its possible to split the array at any index such that all the elements in the left half are strictly decreasing and all elements in right half are strictly increasing
#include <iostream>
using namespace std;
int isSplitPossible(int arr[], int len) {
bool increased = false;
prev = arr[0];