title: Check Array Represents Inorder Binary Search Tree Not
signature: function checkArrayRepresentsInorderBinarySearchTreeNot(arr: Array<number>, n: number): boolean {
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;
  }
question_info.test_list: [{"idx": 0, "outputs": true, "inputs": {"arr": [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], "n": 46}}, {"idx": 1, "outputs": false, "inputs": {"arr": [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], "n": 30}}, {"idx": 2, "outputs": true, "inputs": {"arr": [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "n": 13}}, {"idx": 3, "outputs": true, "inputs": {"arr": [38, 79, 76, 92, 92], "n": 2}}, {"idx": 4, "outputs": true, "inputs": {"arr": [-42, -28, 2, 32, 50, 56, 86, 96, 98], "n": 7}}, {"idx": 5, "outputs": false, "inputs": {"arr": [1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], "n": 11}}, {"idx": 6, "outputs": true, "inputs": {"arr": [1, 9, 12, 21, 21, 24, 34, 55, 60, 63, 67, 68, 88, 89, 91, 94, 98, 99], "n": 9}}, {"idx": 7, "outputs": false, "inputs": {"arr": [-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], "n": 29}}, {"idx": 8, "outputs": true, "inputs": {"arr": [0, 0, 0, 0, 1, 1], "n": 3}}, {"idx": 9, "outputs": false, "inputs": {"arr": [66, 12, 48, 82, 33, 77, 99, 98, 14, 92], "n": 7}}]
question_info.entry_cls_name: Solution
question_info.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: boolean, expected: boolean): boolean {
      return convertToString(actual) === convertToString(expected);
  }
  
  function driver(arr: Array<number>, n: number, expected:boolean): string {
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(arr, n),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver([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);
    console.log(`TEST-0...${result}`);
  
    result = driver([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);
    console.log(`TEST-1...${result}`);
  
    result = driver([0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], 13, true);
    console.log(`TEST-2...${result}`);
  
    result = driver([38, 79, 76, 92, 92], 2, true);
    console.log(`TEST-3...${result}`);
  
    result = driver([-42, -28, 2, 32, 50, 56, 86, 96, 98], 7, true);
    console.log(`TEST-4...${result}`);
  
    result = driver([1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], 11, false);
    console.log(`TEST-5...${result}`);
  
    result = driver([1, 9, 12, 21, 21, 24, 34, 55, 60, 63, 67, 68, 88, 89, 91, 94, 98, 99], 9, true);
    console.log(`TEST-6...${result}`);
  
    result = driver([-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);
    console.log(`TEST-7...${result}`);
  
    result = driver([0, 0, 0, 0, 1, 1], 3, true);
    console.log(`TEST-8...${result}`);
  
    result = driver([66, 12, 48, 82, 33, 77, 99, 98, 14, 92], 7, false);
    console.log(`TEST-9...${result}`);
  
  };
  
  main();
question_info.extension: ts
question_info.entry_fn_name: checkArrayRepresentsInorderBinarySearchTreeNot
question_info.test_case_ids: 0 1 2 3 4 5 6 7 8 9
question_info.commands: tsc --target es2020 --lib es5,dom,es2015,es2020 __FILENAME__
question_info.commands: node __FILENAME__.js