title: Search An Element In An Array Where Difference Between Adjacent Elements Is 1
signature: function search_an_element_in_an_array_where_difference_between_adjacent_elements_is_1(arr, n, x)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(arr, n, x, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(arr, n, x), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver([8, 7, 6, 7, 6, 5, 4, 3, 2, 3, 4, 3], 12, 3, 7);
      @printf("TEST-0...%s\n",result);
      
      result = driver([6, 90], 1, 1, -1);
      @printf("TEST-1...%s\n",result);
      
      result = driver([1, 2, 3, 4, 5, 4], 6, 5, 4);
      @printf("TEST-2...%s\n",result);
      
      result = driver([97, 35, 60, 96, 3, 67, 72, 95, 55, 9, 69, 28, 15, 91, 31, 59], 15, 9, -1);
      @printf("TEST-3...%s\n",result);
      
      result = driver([-84, -78, -74, -70, -68, -60, -56, -54, -48, -46, -28, -16, -6, 0, 0, 8, 8, 8, 12, 16, 26, 30, 32, 34, 36, 40, 46, 48, 70, 70, 72, 76, 78, 78, 80, 84, 84, 86], 22, 31, -1);
      @printf("TEST-4...%s\n",result);
      
      result = driver([1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1], 5, 7, -1);
      @printf("TEST-5...%s\n",result);
      
      result = driver([55, 64, 76, 79, 93, 96], 4, 4, -1);
      @printf("TEST-6...%s\n",result);
      
      result = driver([66, -90, 98, -50, 0, 46, 42, 64, -96, -80, -96, 20, -10, -84], 8, 13, -1);
      @printf("TEST-7...%s\n",result);
      
      result = driver([0, 0, 0, 0, 0, 0, 1], 6, 5, -1);
      @printf("TEST-8...%s\n",result);
      
      result = driver([94, 4, 34, 87, 32, 3, 92, 68, 57, 76, 24, 33, 3, 4, 30, 70, 49, 30, 72, 82, 16, 53, 6, 24, 92, 96, 89, 28, 21, 8, 36, 9, 40, 85, 51, 1, 63, 68, 74, 26, 40, 3, 9, 32, 67, 4, 6, 73], 25, 25, -1);
      @printf("TEST-9...%s\n",result);
      
  end
  
  main()
source_py: def search_an_element_in_an_array_where_difference_between_adjacent_elements_is_1(arr, n, x):
      i = 0
      while (i < n):
          if (arr[i] == x):
              return i
          i = (i + abs((arr[i] - x)))
      print('number is not present!')
      return (- 1)
source_cpp: int search_an_element_in_an_array_where_difference_between_adjacent_elements_is_1(vector<int> arr, int n, int x) {
    int i = 0;
    while ( i < n ) {
      if ( arr [ i ] == x ) return i;
      i = i + abs ( arr [ i ] - x );
    }
    return - 1;
  }