title: Swap Bits In A Given Number
signature: def swap_bits_in_a_given_number(x, p1, p2, n):
test_code: import array
  import bisect
  import collections
  import datetime
  import functools
  import heapq
  import itertools
  import math
  import queue
  import re
  import string
  import sys
  from typing import Any, Dict, List, Optional, Set
  
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  def validate_solution(actual, expected):
      return actual == expected
  
  def driver(x, p1, p2, n, expected):
      try:
          if validate_solution(PLACEHOLDER_FN_NAME(
              x, p1, p2, n),
              expected
          ):
              return "PASSED"
          return "FAILED"
      except Exception as exception_obj:
          return type(exception_obj).__name__
      
  if __name__ == "__main__":
      result = driver(95, 88, 97, 92, 95)
      print(f"TEST-0...{result}")
  
      result = driver(16, 26, 59, 42, 16)
      print(f"TEST-1...{result}")
  
      result = driver(55, 56, 40, 41, 55)
      print(f"TEST-2...{result}")
  
      result = driver(75, 35, 79, 30, 75)
      print(f"TEST-3...{result}")
  
      result = driver(90, 12, 59, 34, 90)
      print(f"TEST-4...{result}")
  
      result = driver(58, 65, 25, 19, 58)
      print(f"TEST-5...{result}")
  
      result = driver(69, 64, 17, 94, 69)
      print(f"TEST-6...{result}")
  
      result = driver(36, 33, 97, 44, 36)
      print(f"TEST-7...{result}")
  
      result = driver(62, 69, 66, 9, 62)
      print(f"TEST-8...{result}")
  
      sys.exit(0)
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;
  }