title: Position Of Rightmost Set Bit 1
signature: def positionOfRightmostSetBit1(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(n: Int, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        17, 
        1    
      )}")   
  
  
      println(s"TEST-1...${driver(
        97, 
        1    
      )}")   
  
  
      println(s"TEST-2...${driver(
        73, 
        1    
      )}")   
  
  
      println(s"TEST-3...${driver(
        68, 
        3    
      )}")   
  
  
      println(s"TEST-4...${driver(
        6, 
        2    
      )}")   
  
  
      println(s"TEST-5...${driver(
        84, 
        3    
      )}")   
  
  
      println(s"TEST-6...${driver(
        72, 
        4    
      )}")   
  
  
      println(s"TEST-7...${driver(
        66, 
        2    
      )}")   
  
  
      println(s"TEST-8...${driver(
        57, 
        1    
      )}")   
  
  
      println(s"TEST-9...${driver(
        11, 
        1    
      )}")   
  
  }
  
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;
  }