title: Find The Maximum Element In An Array Which Is First Increasing And Then Decreasing
signature: function findTheMaximumElementInAnArrayWhichIsFirstIncreasingAndThenDecreasing(arr: Array<number>, low: number, high: number): number {
test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value: any): string{
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual: number, expected: number): boolean {
      return convertToString(actual) === convertToString(expected);
  }
  
  function driver(arr: Array<number>, low: number, high: number, expected:number): string {
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(arr, low, high),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver([11, 15, 16, 19, 24, 25, 26, 28, 34, 34, 43, 61, 63, 66, 67, 72, 77, 79, 81, 83, 87, 94, 99], 15, 21, 94);
    console.log(`TEST-0...${result}`);
  
    result = driver([8, 92], 1, 1, 92);
    console.log(`TEST-1...${result}`);
  
    result = driver([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], 23, 15, 1);
    console.log(`TEST-2...${result}`);
  
    result = driver([84, 39, 92, 89, 38, 75, 18, 39, 83, 67, 41, 46, 49, 27], 8, 13, 92);
    console.log(`TEST-3...${result}`);
  
    result = driver([-98, -94, -88, -84, -74, -72, -58, -52, -48, -48, -46, -42, -42, -32, -30, -30, -18, -10, -8, -8, -6, -4, 4, 6, 28, 30, 34, 38, 44, 48, 56, 58, 60, 64, 86], 31, 34, 86);
    console.log(`TEST-4...${result}`);
  
    result = driver([0, 1, 0], 2, 2, 1);
    console.log(`TEST-5...${result}`);
  
    result = driver([5, 9, 10, 16, 18, 19, 23, 24, 26, 33, 37, 44, 46, 54, 55, 57, 58, 59, 63, 64, 70, 75, 77, 81, 83, 84, 85, 85, 88, 89, 96, 97, 99], 20, 31, 97);
    console.log(`TEST-6...${result}`);
  
    result = driver([86, 20, -50, 74, -78, 86], 3, 5, 86);
    console.log(`TEST-7...${result}`);
  
    result = driver([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], 19, 18, 1);
    console.log(`TEST-8...${result}`);
  
    result = driver([16, 57, 65, 61, 17, 63, 7, 35, 69, 91, 30, 44, 99, 80, 6, 80, 56, 8, 84, 95, 20, 73, 30, 62, 77, 26, 66, 61, 61, 45], 28, 22, 99);
    console.log(`TEST-9...${result}`);
  
  };
  
  main();
source_py: def find_the_maximum_element_in_an_array_which_is_first_increasing_and_then_decreasing(arr, low, high):
      max = arr[low]
      i = low
      for i in range((high + 1)):
          if (arr[i] > max):
              max = arr[i]
      return max
source_cpp: int find_the_maximum_element_in_an_array_which_is_first_increasing_and_then_decreasing(vector<int> arr, int low, int high) {
    int max = arr [ low ];
    int i;
    for ( i = low + 1;
    i <= high;
    i ++ ) {
      if ( arr [ i ] > max ) max = arr [ i ];
      else break;
    }
    return max;
  }