title: Search An Element In An Array Where Difference Between Adjacent Elements Is 1
signature: pub fn search_an_element_in_an_array_where_difference_between_adjacent_elements_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([8, 7, 6, 7, 6, 5, 4, 3, 2, 3, 4, 3]), 12, 3, 
        7
      ));
      
      println!("TEST-1...{}", driver(
        Vec::from([6, 90]), 1, 1, 
        -1
      ));
      
      println!("TEST-2...{}", driver(
        Vec::from([1, 2, 3, 4, 5, 4]), 6, 5, 
        4
      ));
      
      println!("TEST-3...{}", driver(
        Vec::from([97, 35, 60, 96, 3, 67, 72, 95, 55, 9, 69, 28, 15, 91, 31, 59]), 15, 9, 
        -1
      ));
      
      println!("TEST-4...{}", driver(
        Vec::from([-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
      ));
      
      println!("TEST-5...{}", driver(
        Vec::from([1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1]), 5, 7, 
        -1
      ));
      
      println!("TEST-6...{}", driver(
        Vec::from([55, 64, 76, 79, 93, 96]), 4, 4, 
        -1
      ));
      
      println!("TEST-7...{}", driver(
        Vec::from([66, -90, 98, -50, 0, 46, 42, 64, -96, -80, -96, 20, -10, -84]), 8, 13, 
        -1
      ));
      
      println!("TEST-8...{}", driver(
        Vec::from([0, 0, 0, 0, 0, 0, 1]), 6, 5, 
        -1
      ));
      
      println!("TEST-9...{}", driver(
        Vec::from([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
      ));
      
  }
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;
  }