title: Find Sum Even Index Binomial Coefficients
signature: findSumEvenIndexBinomialCoefficients(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(
          18, 
          131072)
      }");
  
      print("TEST-1...${driver(
          54, 
          9007199254740992)
      }");
  
      print("TEST-2...${driver(
          67, 
          0)
      }");
  
      print("TEST-3...${driver(
          17, 
          0)
      }");
  
      print("TEST-4...${driver(
          47, 
          0)
      }");
  
      print("TEST-5...${driver(
          99, 
          0)
      }");
  
      print("TEST-6...${driver(
          26, 
          33554432)
      }");
  
      print("TEST-7...${driver(
          93, 
          0)
      }");
  
      print("TEST-8...${driver(
          57, 
          0)
      }");
  
      return 0;
  }
source_py: def find_sum_even_index_binomial_coefficients(n):
      C = [[0 for x in range((n + 1))] for y in range((n + 1))]
      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)):
          if ((n % 2) == 0):
              sum = (sum + C[n][i])
      return sum
source_cpp: int find_sum_even_index_binomial_coefficients(int n) {
    int C [ n + 1 ] [ n + 1 ];
    int i, j;
    for ( i = 0;
    i <= n;
    i ++ ) {
      for ( 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 += 2 ) sum += C [ n ] [ i ];
    return sum;
  }