title: Swap Bits In A Given Number
signature: def swapBitsInAGivenNumber(x: Int, p1: Int, p2: Int, n: Int) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Int , expected: Int): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(x: Int, p1: Int, p2: Int, n: Int, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(x, p1, p2, n),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        95, 88, 97, 92, 
        95    
      )}")   
  
  
      println(s"TEST-1...${driver(
        16, 26, 59, 42, 
        16    
      )}")   
  
  
      println(s"TEST-2...${driver(
        55, 56, 40, 41, 
        55    
      )}")   
  
  
      println(s"TEST-3...${driver(
        75, 35, 79, 30, 
        75    
      )}")   
  
  
      println(s"TEST-4...${driver(
        90, 12, 59, 34, 
        90    
      )}")   
  
  
      println(s"TEST-5...${driver(
        58, 65, 25, 19, 
        58    
      )}")   
  
  
      println(s"TEST-6...${driver(
        69, 64, 17, 94, 
        69    
      )}")   
  
  
      println(s"TEST-7...${driver(
        36, 33, 97, 44, 
        36    
      )}")   
  
  
      println(s"TEST-8...${driver(
        62, 69, 66, 9, 
        62    
      )}")   
  
  }
  
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;
  }