title: Position Of Rightmost Set Bit 1
signature: func positionOfRightmostSetBit1(n int) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(n int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(n),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver(17, 1)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(97, 1)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(73, 1)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(68, 3)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver(6, 2)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver(84, 3)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver(72, 4)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver(66, 2)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver(57, 1)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver(11, 1)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
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;
  }