title: Count Set Bits In An Integer
signature: func countSetBitsInAnInteger(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(58, 4)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(92, 4)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(73, 3)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(52, 3)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver(24, 2)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver(14, 3)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver(58, 4)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver(11, 3)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver(8, 1)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver(52, 3)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
source_py: def count_set_bits_in_an_integer(n):
      count = 0
      while n:
          count += (n & 1)
          n >>= 1
      return count
source_cpp: unsigned int count_set_bits_in_an_integer(unsigned int n) {
    unsigned int count = 0;
    while ( n ) {
      count += n & 1;
      n >>= 1;
    }
    return count;
  }