title: Efficient Search In An Array Where Difference Between Adjacent Is 1
signature: pub fn efficient_search_in_an_array_where_difference_between_adjacent_is_1(arr: Vec<i32>, n: i32, x: i32) -> i32 {
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: i32, expected: i32)->bool{
  return actual==expected
  }
  pub fn driver(arr: Vec<i32>, n: i32, x: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(arr, n, x), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        Vec::from([5, 4, 5, 6, 5, 4, 3, 2]), 29, 6, 
        3
      ));
      
      println!("TEST-1...{}", driver(
        Vec::from([5, 4, 5, 6, 5, 4, 3, 2]), 19, 3, 
        6
      ));
      
      println!("TEST-2...{}", driver(
        Vec::from([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
      ));
      
      println!("TEST-3...{}", driver(
        Vec::from([50, 51, 52, 51, 50, 49, 48]), 17, 49, 
        5
      ));
      
      println!("TEST-4...{}", driver(
        Vec::from([-86, -68, -32, -6, 6, 10, 30, 34, 58, 92]), 6, 6, 
        -1
      ));
      
      println!("TEST-5...{}", driver(
        Vec::from([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
      ));
      
      println!("TEST-6...{}", driver(
        Vec::from([58]), 0, 0, 
        -1
      ));
      
      println!("TEST-7...{}", driver(
        Vec::from([-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
      ));
      
      println!("TEST-8...{}", driver(
        Vec::from([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
      ));
      
      println!("TEST-9...{}", driver(
        Vec::from([5]), 0, 0, 
        -1
      ));
      
  }
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;
  }