title: Next Power Of 2
signature: pub fn next_power_of_2(n: i32) -> i32 {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: i32, expected: i32)->bool{
  return actual==expected
  }
  pub fn driver(n: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(n), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        74, 
        128
      ));
      
      println!("TEST-1...{}", driver(
        70, 
        128
      ));
      
      println!("TEST-2...{}", driver(
        85, 
        128
      ));
      
      println!("TEST-3...{}", driver(
        78, 
        128
      ));
      
      println!("TEST-4...{}", driver(
        71, 
        128
      ));
      
      println!("TEST-5...{}", driver(
        32, 
        32
      ));
      
      println!("TEST-6...{}", driver(
        97, 
        128
      ));
      
      println!("TEST-7...{}", driver(
        90, 
        128
      ));
      
      println!("TEST-8...{}", driver(
        64, 
        64
      ));
      
      println!("TEST-9...{}", driver(
        48, 
        64
      ));
      
  }
source_py: def next_power_of_2(n):
      count = 0
      if (n and (not (n & (n - 1)))):
          return n
      while (n != 0):
          n >>= 1
          count += 1
      return (1 << count)
source_cpp: unsigned int next_power_of_2(unsigned int n) {
    unsigned count = 0;
    if ( n && ! ( n & ( n - 1 ) ) ) return n;
    while ( n != 0 ) {
      n >>= 1;
      count += 1;
    }
    return 1 << count;
  }