title: Searching Array Adjacent Differ K
signature: func searchingArrayAdjacentDifferK(arr []int, n int, x int, k int) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(arr []int, n int, x int, k int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(arr, n, x, k),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver([]int{1, 5, 9, 11, 14, 18, 19, 21, 26, 32, 38, 38, 43, 47, 49, 52, 55, 61, 65, 67, 69, 73, 74, 79, 84, 90, 91, 91, 92, 93, 94, 99}, 
  	22, 
  	19, 
  	26, 6)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver([]int{12, -86, -66, -50, -48, 78, -92, -56, -2, 66, 64}, 
  	5, 
  	10, 
  	5, -1)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver([]int{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, 1, 1, 1, 1, 1, 1}, 
  	35, 
  	37, 
  	43, -1)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver([]int{10, 87, 39, 87, 45, 33, 5, 37, 70, 69, 88, 78, 90, 3}, 
  	9, 
  	8, 
  	10, -1)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver([]int{-78, -70, -68, -60, -52, -34, -24, -4, 12, 18, 58, 58, 64, 76, 84, 94}, 
  	14, 
  	9, 
  	13, -1)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver([]int{0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0}, 
  	26, 
  	36, 
  	32, -1)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver([]int{5, 5, 7, 11, 11, 15, 22, 23, 28, 38, 41, 53, 54, 57, 59, 68, 71, 89}, 
  	16, 
  	17, 
  	16, -1)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver([]int{-4, 0, 60, -14, -48, 54, -96, -68, -40, 64, -50, -74, -20, -22, 48, -48, 42, 62, 66, 84, 54, -52, -52, 6, 46, -90, -18, 90}, 
  	18, 
  	14, 
  	23, -1)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver([]int{0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1}, 
  	9, 
  	8, 
  	9, -1)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver([]int{30, 91, 34, 44, 3, 76, 43, 75, 49, 33, 74, 72, 68, 79, 26, 62, 23, 5, 32, 75, 82, 25, 7, 19, 32, 87, 87, 94, 34, 62, 3, 32, 59}, 
  	32, 
  	30, 
  	24, 0)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
source_py: def searching_array_adjacent_differ_k(arr, n, x, k):
      i = 0
      while (i < n):
          if (arr[i] == x):
              return i
          i = (i + max(1, int((abs((arr[i] - x)) / k))))
      print('number is not present!')
      return (- 1)
source_cpp: int searching_array_adjacent_differ_k(vector<int> arr, int n, int x, int k) {
    int i = 0;
    while ( i < n ) {
      if ( arr [ i ] == x ) return i;
      i = i + max ( 1, abs ( arr [ i ] - x ) / k );
    }
    return - 1;
  }