title: Check Array Represents Inorder Binary Search Tree Not
signature: pub fn check_array_represents_inorder_binary_search_tree_not(arr: Vec<i32>, n: i32) -> bool {
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: bool, expected: bool)->bool{
  return actual==expected
  }
  pub fn driver(arr: Vec<i32>, n: i32, expected: bool)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(arr, n), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        Vec::from([2, 3, 4, 10, 11, 13, 17, 19, 23, 26, 28, 29, 30, 34, 35, 37, 38, 38, 43, 49, 49, 50, 52, 53, 55, 55, 57, 58, 58, 59, 64, 66, 67, 70, 72, 72, 75, 77, 77, 87, 89, 89, 90, 91, 98, 99, 99, 99]), 46, 
        true
      ));
      
      println!("TEST-1...{}", driver(
        Vec::from([56, -94, -26, -52, 58, -66, -52, -66, -94, 44, 38, -66, 70, -70, -80, -78, -72, -60, -76, 68, -50, 32, -16, 84, 74, -42, 98, -8, 72, 26, 24, 6, 24, 86, 86, 78, -92, 80, 32, -74, 26, 50, 92, 4, 2, -34, -2, -18, -10]), 30, 
        false
      ));
      
      println!("TEST-2...{}", driver(
        Vec::from([0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]), 13, 
        true
      ));
      
      println!("TEST-3...{}", driver(
        Vec::from([38, 79, 76, 92, 92]), 2, 
        true
      ));
      
      println!("TEST-4...{}", driver(
        Vec::from([-42, -28, 2, 32, 50, 56, 86, 96, 98]), 7, 
        true
      ));
      
      println!("TEST-5...{}", driver(
        Vec::from([1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1]), 11, 
        false
      ));
      
      println!("TEST-6...{}", driver(
        Vec::from([1, 9, 12, 21, 21, 24, 34, 55, 60, 63, 67, 68, 88, 89, 91, 94, 98, 99]), 9, 
        true
      ));
      
      println!("TEST-7...{}", driver(
        Vec::from([-96, 96, -98, -42, -74, 40, 42, 50, -46, -52, 8, -46, 48, 88, -78, -72, -10, -20, 98, -40, -18, 36, 4, 46, 52, 28, -88, -28, -28, -86]), 29, 
        false
      ));
      
      println!("TEST-8...{}", driver(
        Vec::from([0, 0, 0, 0, 1, 1]), 3, 
        true
      ));
      
      println!("TEST-9...{}", driver(
        Vec::from([66, 12, 48, 82, 33, 77, 99, 98, 14, 92]), 7, 
        false
      ));
      
  }
source_py: def check_array_represents_inorder_binary_search_tree_not(arr, n):
      if ((n == 0) or (n == 1)):
          return True
      for i in range(1, n, 1):
          if (arr[(i - 1)] > arr[i]):
              return False
      return True
source_cpp: bool check_array_represents_inorder_binary_search_tree_not(vector<int> arr, int n) {
    if ( n == 0 || n == 1 ) return true;
    for ( int i = 1;
    i < n;
    i ++ ) if ( arr [ i - 1 ] > arr [ i ] ) return false;
    return true;
  }