title: Efficient Search In An Array Where Difference Between Adjacent Is 1
signature: function efficientSearchInAnArrayWhereDifferenceBetweenAdjacentIs1(arr: Array<number>, n: number, x: number): number {
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: number, expected: number): boolean {
      return convertToString(actual) === convertToString(expected);
  }
  
  function driver(arr: Array<number>, n: number, x: number, expected:number): string {
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(arr, n, x),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver([5, 4, 5, 6, 5, 4, 3, 2], 29, 6, 3);
    console.log(`TEST-0...${result}`);
  
    result = driver([5, 4, 5, 6, 5, 4, 3, 2], 19, 3, 6);
    console.log(`TEST-1...${result}`);
  
    result = 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], 37, 1, 14);
    console.log(`TEST-2...${result}`);
  
    result = driver([50, 51, 52, 51, 50, 49, 48], 17, 49, 5);
    console.log(`TEST-3...${result}`);
  
    result = driver([-86, -68, -32, -6, 6, 10, 30, 34, 58, 92], 6, 6, -1);
    console.log(`TEST-4...${result}`);
  
    result = driver([1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0], 27, 22, -1);
    console.log(`TEST-5...${result}`);
  
    result = driver([58], 0, 0, -1);
    console.log(`TEST-6...${result}`);
  
    result = driver([-64, 78, 58, 36, 48, 80, -80, 74, -98, 46, -48, 24, 80, 72, 90, -46, 14, 68, 38, 58, -54, 80, 44, -62, 34, -28, 92, 84, 90, 44, -26, 88, 18, 22, -32, 54, 58, 92], 24, 34, -1);
    console.log(`TEST-7...${result}`);
  
    result = driver([0, 0, 0, 0, 0, 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], 35, 1, 21);
    console.log(`TEST-8...${result}`);
  
    result = driver([5], 0, 0, -1);
    console.log(`TEST-9...${result}`);
  
  };
  
  main();
source_py: def efficient_search_in_an_array_where_difference_between_adjacent_is_1(arr, n, x):
      i = 0
      while (i <= (n - 1)):
          if (arr[i] == x):
              return i
          i += abs((arr[i] - x))
      return (- 1)
source_cpp: int efficient_search_in_an_array_where_difference_between_adjacent_is_1(vector<int> arr, int n, int x) {
    int i = 0;
    while ( i <= n - 1 ) {
      if ( arr [ i ] == x ) return i;
      i += abs ( arr [ i ] - x );
    }
    return - 1;
  }