title: Position Of Rightmost Set Bit 1
signature: function positionOfRightmostSetBit1(n) {
test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value) {
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual, expected){
      return convertToString(actual)===convertToString(expected);
  }
  
  function driver(n, expected){
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver(17, 1);
    console.log(`TEST-0...${result}`);
  
    result = driver(97, 1);
    console.log(`TEST-1...${result}`);
  
    result = driver(73, 1);
    console.log(`TEST-2...${result}`);
  
    result = driver(68, 3);
    console.log(`TEST-3...${result}`);
  
    result = driver(6, 2);
    console.log(`TEST-4...${result}`);
  
    result = driver(84, 3);
    console.log(`TEST-5...${result}`);
  
    result = driver(72, 4);
    console.log(`TEST-6...${result}`);
  
    result = driver(66, 2);
    console.log(`TEST-7...${result}`);
  
    result = driver(57, 1);
    console.log(`TEST-8...${result}`);
  
    result = driver(11, 1);
    console.log(`TEST-9...${result}`);
  
    process.exit(0);
  };
  
  if (require.main === module) {
    main();
  }
source_py: def position_of_rightmost_set_bit_1(n):
      position = 1
      m = 1
      while (not (n & m)):
          m = (m << 1)
          position += 1
      return position
source_cpp: int position_of_rightmost_set_bit_1(int n) {
    int position = 1;
    int m = 1;
    while ( ! ( n & m ) ) {
      m = m << 1;
      position ++;
    }
    return position;
  }