title: Sum Of All Elements Up To Nth Row In A Pascals Triangle 1
signature: def sumOfAllElementsUpToNthRowInAPascalsTriangle1(n: Int) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Long , expected: Long): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(n: Int, expected: Long): 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(
        53, 
        9007199254740991L    
      )}")   
  
  
      println(s"TEST-1...${driver(
        3, 
        7L    
      )}")   
  
  
      println(s"TEST-2...${driver(
        28, 
        268435455L    
      )}")   
  
  
      println(s"TEST-3...${driver(
        44, 
        17592186044415L    
      )}")   
  
  
      println(s"TEST-4...${driver(
        46, 
        70368744177663L    
      )}")   
  
  
      println(s"TEST-5...${driver(
        3, 
        7L    
      )}")   
  
  
      println(s"TEST-6...${driver(
        16, 
        65535L    
      )}")   
  
  }
  
source_py: def sum_of_all_elements_up_to_nth_row_in_a_pascals_triangle_1(n):
      sum = 0
      sum = (1 << n)
      return (sum - 1)
source_cpp: long long int sum_of_all_elements_up_to_nth_row_in_a_pascals_triangle_1(int n) {
    long long int sum = 0;
    sum = 1 << n;
    return ( sum - 1 );
  }