title: Swap Bits In A Given Number
signature: swapBitsInAGivenNumber :: Integer -> Integer -> Integer -> Integer -> Integer
  swapBitsInAGivenNumber x p1 p2 n = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Integer -> Integer -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: Integer -> Integer -> Integer -> Integer -> Integer -> String
  driver x p1 p2 n expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME x p1 p2 n) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver (95) (88) (97) (92) (95) )
  
      printf "TEST-1...%s\n" (driver (16) (26) (59) (42) (16) )
  
      printf "TEST-2...%s\n" (driver (55) (56) (40) (41) (55) )
  
      printf "TEST-3...%s\n" (driver (75) (35) (79) (30) (75) )
  
      printf "TEST-4...%s\n" (driver (90) (12) (59) (34) (90) )
  
      printf "TEST-5...%s\n" (driver (58) (65) (25) (19) (58) )
  
      printf "TEST-6...%s\n" (driver (69) (64) (17) (94) (69) )
  
      printf "TEST-7...%s\n" (driver (36) (33) (97) (44) (36) )
  
      printf "TEST-8...%s\n" (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;
  }