valid mountain leetcode

valid-mountain.cpp

bool validMountain(vector<int>& arr) {

  int n = arr.size();
  int start = 0;

int end = n - 1;


//urcare

while(start != n - 1 && arr[start+1] > arr[start]) start++;

while(end != 0 && arr[end-1] > arr[end]) end--

    //0 2 3 4 5 2 1 0
            


return start == end && end != n-1 && start != 0;            
}