title: Sum Binomial Coefficients
signature: function sumBinomialCoefficients(n: number): number {
test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value: any): string{
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual: number, expected: number): boolean {
      return convertToString(actual) === convertToString(expected);
  }
  
  function driver(n: number, expected:number): string {
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver(8, 256);
    console.log(`TEST-0...${result}`);
  
    result = driver(39, 549755813888);
    console.log(`TEST-1...${result}`);
  
    result = driver(25, 33554432);
    console.log(`TEST-2...${result}`);
  
    result = driver(44, 17592186044416);
    console.log(`TEST-3...${result}`);
  
    result = driver(6, 64);
    console.log(`TEST-4...${result}`);
  
    result = driver(48, 281474976710656);
    console.log(`TEST-5...${result}`);
  
    result = driver(39, 549755813888);
    console.log(`TEST-6...${result}`);
  
  };
  
  main();
source_py: def sum_binomial_coefficients(n):
      C = [([0] * (n + 2)) for i in range(0, (n + 2))]
      for i in range(0, (n + 1)):
          for j in range(0, (min(i, n) + 1)):
              if ((j == 0) or (j == i)):
                  C[i][j] = 1
              else:
                  C[i][j] = (C[(i - 1)][(j - 1)] + C[(i - 1)][j])
      sum = 0
      for i in range(0, (n + 1)):
          sum += C[n][i]
      return sum
source_cpp: int sum_binomial_coefficients(int n) {
    int C [ n + 1 ] [ n + 1 ];
    for ( int i = 0;
    i <= n;
    i ++ ) {
      for ( int j = 0;
      j <= min ( i, n );
      j ++ ) {
        if ( j == 0 || j == i ) C [ i ] [ j ] = 1;
        else C [ i ] [ j ] = C [ i - 1 ] [ j - 1 ] + C [ i - 1 ] [ j ];
      }
    }
    int sum = 0;
    for ( int i = 0;
    i <= n;
    i ++ ) sum += C [ n ] [ i ];
    return sum;
  }