title: Swap Bits In A Given Number
signature: fun swapBitsInAGivenNumber(x: Int, p1: Int, p2: Int, n: Int): Int {
test_code: package main
  
  import kotlin.text.*
  import kotlin.math.*
  
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  fun validateSolution(actual:Int, expected:Int):Boolean{
    return actual.equals(expected)
  }
  fun driver(x: Int, p1: Int, p2: Int, n: Int, expected:Int):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(x, p1, p2, n), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver(95, 88, 97, 92, 95)
      println("TEST-0...${result}")
      
      result = driver(16, 26, 59, 42, 16)
      println("TEST-1...${result}")
      
      result = driver(55, 56, 40, 41, 55)
      println("TEST-2...${result}")
      
      result = driver(75, 35, 79, 30, 75)
      println("TEST-3...${result}")
      
      result = driver(90, 12, 59, 34, 90)
      println("TEST-4...${result}")
      
      result = driver(58, 65, 25, 19, 58)
      println("TEST-5...${result}")
      
      result = driver(69, 64, 17, 94, 69)
      println("TEST-6...${result}")
      
      result = driver(36, 33, 97, 44, 36)
      println("TEST-7...${result}")
      
      result = driver(62, 69, 66, 9, 62)
      println("TEST-8...${result}")
      
          
  }
  
  main()
source_py: def swap_bits_in_a_given_number(x, p1, p2, n):
      set1 = ((x >> p1) & ((1 << n) - 1))
      set2 = ((x >> p2) & ((1 << n) - 1))
      xor = (set1 ^ set2)
      xor = ((xor << p1) | (xor << p2))
      result = (x ^ xor)
      return result
source_cpp: int swap_bits_in_a_given_number(unsigned int x, unsigned int p1, unsigned int p2, unsigned int n) {
    unsigned int set1 = ( x >> p1 ) & ( ( 1U << n ) - 1 );
    unsigned int set2 = ( x >> p2 ) & ( ( 1U << n ) - 1 );
    unsigned int Xor = ( set1 ^ set2 );
    Xor = ( Xor << p1 ) | ( Xor << p2 );
    unsigned int result = x ^ Xor;
    return result;
  }