title: Find The Maximum Element In An Array Which Is First Increasing And Then Decreasing
signature: pub fn find_the_maximum_element_in_an_array_which_is_first_increasing_and_then_decreasing(arr: Vec<i32>, low: i32, high: i32) -> i32 {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: i32, expected: i32)->bool{
  return actual==expected
  }
  pub fn driver(arr: Vec<i32>, low: i32, high: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(arr, low, high), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        Vec::from([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
      ));
      
      println!("TEST-1...{}", driver(
        Vec::from([8, 92]), 1, 1, 
        92
      ));
      
      println!("TEST-2...{}", driver(
        Vec::from([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
      ));
      
      println!("TEST-3...{}", driver(
        Vec::from([84, 39, 92, 89, 38, 75, 18, 39, 83, 67, 41, 46, 49, 27]), 8, 13, 
        92
      ));
      
      println!("TEST-4...{}", driver(
        Vec::from([-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
      ));
      
      println!("TEST-5...{}", driver(
        Vec::from([0, 1, 0]), 2, 2, 
        1
      ));
      
      println!("TEST-6...{}", driver(
        Vec::from([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
      ));
      
      println!("TEST-7...{}", driver(
        Vec::from([86, 20, -50, 74, -78, 86]), 3, 5, 
        86
      ));
      
      println!("TEST-8...{}", driver(
        Vec::from([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
      ));
      
      println!("TEST-9...{}", driver(
        Vec::from([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
      ));
      
  }
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;
  }