title: Check Possible Sort Array Conditional Swapping Adjacent Allowed
signature: function checkPossibleSortArrayConditionalSwappingAdjacentAllowed(arr: Array<number>, n: number): boolean {
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([1, 4, 12, 16, 37, 44, 47, 51, 55, 57, 57, 62, 62, 62, 64, 69, 69, 70, 72, 81, 81, 88, 89, 97], 15, true);
    console.log(`TEST-0...${result}`);
  
    result = driver([-86, 0, 14, -16, -12, -72, 62, -34, -72, 30, 84, -60, 84, -64, 50, 74, 18, -82, -64, -64, -74, -56, 86, 84, -32, -10, 20, 4, 8, 96, 82, 26, 42], 18, false);
    console.log(`TEST-1...${result}`);
  
    result = driver([0, 0, 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, 1, 1, 1, 1, 1, 1, 1, 1], 31, true);
    console.log(`TEST-2...${result}`);
  
    result = driver([48, 66, 83, 12, 77, 98, 18, 33, 21, 16, 28, 24, 46, 43], 13, false);
    console.log(`TEST-3...${result}`);
  
    result = driver([-92, -58, -36, -28, -6, 2, 4, 26, 48, 58, 60, 62, 62, 98], 10, true);
    console.log(`TEST-4...${result}`);
  
    result = driver([0, 0, 0, 1, 0, 1], 4, true);
    console.log(`TEST-5...${result}`);
  
    result = driver([22, 38, 41, 41, 42, 51, 54, 58, 68, 76, 80, 85], 9, true);
    console.log(`TEST-6...${result}`);
  
    result = driver([84, -38, 52, -72, -24, 82, 54, 74, 0], 8, false);
    console.log(`TEST-7...${result}`);
  
    result = driver([0, 1, 1], 2, true);
    console.log(`TEST-8...${result}`);
  
    result = driver([63, 31, 14, 19, 77, 64, 62, 23, 22, 19, 39, 9, 79, 1, 87, 29, 58, 3, 3, 39, 1, 39, 35, 64, 64], 13, false);
    console.log(`TEST-9...${result}`);
  
  };
  
  main();
source_py: def check_possible_sort_array_conditional_swapping_adjacent_allowed(arr, n):
      for i in range(0, (n - 1)):
          if (arr[i] > arr[(i + 1)]):
              if ((arr[i] - arr[(i + 1)]) == 1):
                  (arr[i], arr[(i + 1)]) = (arr[(i + 1)], arr[i])
              else:
                  return False
      return True
source_cpp: bool check_possible_sort_array_conditional_swapping_adjacent_allowed(vector<int> arr, int n) {
    for ( int i = 0;
    i < n - 1;
    i ++ ) {
      if ( arr [ i ] > arr [ i + 1 ] ) {
        if ( arr [ i ] - arr [ i + 1 ] == 1 ) swap ( arr [ i ], arr [ i + 1 ] );
        else return false;
      }
    }
    return true;
  }