title: Sum Of All Elements Up To Nth Row In A Pascals Triangle
signature: fun sumOfAllElementsUpToNthRowInAPascalsTriangle(n: Int): Long {
test_code: package main
  
  import kotlin.text.*
  import kotlin.math.*
  
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  fun validateSolution(actual:Long, expected:Long):Boolean{
    return actual.equals(expected)
  }
  fun driver(n: Int, expected:Long):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver(21, 2097151)
      println("TEST-0...${result}")
      
      result = driver(4, 15)
      println("TEST-1...${result}")
      
      result = driver(31, 2147483647)
      println("TEST-2...${result}")
      
      result = driver(38, 274877906943)
      println("TEST-3...${result}")
      
      result = driver(36, 68719476735)
      println("TEST-4...${result}")
      
      result = driver(32, 4294967295)
      println("TEST-5...${result}")
      
      result = driver(23, 8388607)
      println("TEST-6...${result}")
      
          
  }
  
  main()
source_py: def sum_of_all_elements_up_to_nth_row_in_a_pascals_triangle(n):
      sum = 0
      for row in range(n):
          sum = (sum + (1 << row))
      return sum
source_cpp: long long int sum_of_all_elements_up_to_nth_row_in_a_pascals_triangle(int n) {
    long long int sum = 0;
    for ( int row = 0;
    row < n;
    row ++ ) {
      sum = sum + ( 1 << row );
    }
    return sum;
  }