title: Next Power Of 2
signature: nextPowerOf2(n) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          74, 
          128)
      }");
  
      print("TEST-1...${driver(
          70, 
          128)
      }");
  
      print("TEST-2...${driver(
          85, 
          128)
      }");
  
      print("TEST-3...${driver(
          78, 
          128)
      }");
  
      print("TEST-4...${driver(
          71, 
          128)
      }");
  
      print("TEST-5...${driver(
          32, 
          32)
      }");
  
      print("TEST-6...${driver(
          97, 
          128)
      }");
  
      print("TEST-7...${driver(
          90, 
          128)
      }");
  
      print("TEST-8...${driver(
          64, 
          64)
      }");
  
      print("TEST-9...${driver(
          48, 
          64)
      }");
  
      return 0;
  }
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;
  }