title: Find The Maximum Element In An Array Which Is First Increasing And Then Decreasing
signature: findTheMaximumElementInAnArrayWhichIsFirstIncreasingAndThenDecreasing :: [Integer] -> Integer -> Integer -> Integer
  findTheMaximumElementInAnArrayWhichIsFirstIncreasingAndThenDecreasing arr low high = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Integer -> Integer -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: [Integer] -> Integer -> Integer -> Integer -> String
  driver arr low high expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME arr low high) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (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) )
  
      printf "TEST-1...%s\n" (driver ([8, 92]) (1) (1) (92) )
  
      printf "TEST-2...%s\n" (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) )
  
      printf "TEST-3...%s\n" (driver ([84, 39, 92, 89, 38, 75, 18, 39, 83, 67, 41, 46, 49, 27]) (8) (13) (92) )
  
      printf "TEST-4...%s\n" (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) )
  
      printf "TEST-5...%s\n" (driver ([0, 1, 0]) (2) (2) (1) )
  
      printf "TEST-6...%s\n" (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) )
  
      printf "TEST-7...%s\n" (driver ([86, 20, -50, 74, -78, 86]) (3) (5) (86) )
  
      printf "TEST-8...%s\n" (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) )
  
      printf "TEST-9...%s\n" (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) )
  
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;
  }