title: Count Ways Divide Circle Using N Non Intersecting Chords
signature: class Solution {
  
      public Long countWaysDivideCircleUsingNNonIntersectingChords(Integer a) {
source_py: def count_ways_divide_circle_using_n_non_intersecting_chords(A):
      n = (2 * A)
      dpArray = ([0] * (n + 1))
      dpArray[0] = 1
      dpArray[2] = 1
      for i in range(4, (n + 1), 2):
          for j in range(0, (i - 1), 2):
              dpArray[i] += (dpArray[j] * dpArray[((i - 2) - j)])
      return int(dpArray[n])
source_cpp: int count_ways_divide_circle_using_n_non_intersecting_chords(int A) {
    int n = 2 * A;
    int dpArray [ n + 1 ] = {
      0 };
      dpArray [ 0 ] = 1;
      dpArray [ 2 ] = 1;
      for ( int i = 4;
      i <= n;
      i += 2 ) {
        for ( int j = 0;
        j < i - 1;
        j += 2 ) {
          dpArray [ i ] += ( dpArray [ j ] * dpArray [ i - 2 - j ] );
        }
      }
      return dpArray [ n ];
    }
question_info.extension: java
question_info.entry_fn_name: countWaysDivideCircleUsingNNonIntersectingChords
question_info.entry_cls_name: Solution
question_info.test_list: [{"idx": 0, "outputs": 55534064877048198, "inputs": {"a": 32}}, {"idx": 1, "outputs": 55534064877048198, "inputs": {"a": 32}}, {"idx": 2, "outputs": 14544636039226909, "inputs": {"a": 31}}, {"idx": 3, "outputs": 1002242216651368, "inputs": {"a": 29}}]
question_info.test_code: import static java.util.Map.entry;  
  import java.util.*;
  import java.lang.*;
  // TESTING CODE 
  // ============================================
  class QuestionEvaluator {
      public static String validateSolution(Integer a, Long expected){
          try{
              Driver driver = new Driver();
              if (driver.run(a,expected)){
                  return "PASSED";
              }
              return "FAILED";
              
          } catch (Exception exception_obj){
              return exception_obj.getClass().getSimpleName();
          }
  
      }
      public static void main(String[] args) {
          String result;
          result = validateSolution(32, 55534064877048198L);
          System.out.println(String.format("%s%s","TEST-0...",result));    
      
          result = validateSolution(32, 55534064877048198L);
          System.out.println(String.format("%s%s","TEST-1...",result));    
      
          result = validateSolution(31, 14544636039226909L);
          System.out.println(String.format("%s%s","TEST-2...",result));    
      
          result = validateSolution(29, 1002242216651368L);
          System.out.println(String.format("%s%s","TEST-3...",result));    
      
      }
  }
  
  class Driver{
      public boolean run(Integer a, Long expected){
  
          PLACEHOLDER_CLS_NAME sol = new PLACEHOLDER_CLS_NAME();
          return validateSolution(sol.PLACEHOLDER_FN_NAME(a),expected);
      }
      
      public boolean validateSolution(Long actual, Long expected){
          return actual.equals(expected);
      }
  }
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
question_info.test_case_ids: 0 1 2 3
question_info.commands: java __FILENAME__