title: Sum Of All Elements Up To Nth Row In A Pascals Triangle
signature: func sumOfAllElementsUpToNthRowInAPascalsTriangle(n int) int64 {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int64, expected int64) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(n int, expected int64) 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(21, 2097151)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(4, 15)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(31, 2147483647)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(38, 274877906943)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver(36, 68719476735)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver(32, 4294967295)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver(23, 8388607)
      fmt.Printf("TEST-6...%s\n", result)
      
          
  }
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;
  }