title: Number Subsequences Form Ai Bj Ck
signature: function numberSubsequencesFormAiBjCk(s) {
test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value) {
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual, expected){
      return convertToString(actual)===convertToString(expected);
  }
  
  function driver(s, expected){
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(s),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver("", 0);
    console.log(`TEST-0...${result}`);
  
    result = driver("abbc", 3);
    console.log(`TEST-1...${result}`);
  
    result = driver("abcabc", 7);
    console.log(`TEST-2...${result}`);
  
    result = driver("agsdbkfdc ", 1);
    console.log(`TEST-3...${result}`);
  
    result = driver("ababab", 0);
    console.log(`TEST-4...${result}`);
  
    result = driver("aaaaaaa", 0);
    console.log(`TEST-5...${result}`);
  
    result = driver("aabaaabcc", 111);
    console.log(`TEST-6...${result}`);
  
    result = driver("19", 0);
    console.log(`TEST-7...${result}`);
  
    result = driver("1001100", 0);
    console.log(`TEST-8...${result}`);
  
    result = driver("DtAnuQbU", 0);
    console.log(`TEST-9...${result}`);
  
    process.exit(0);
  };
  
  if (require.main === module) {
    main();
  }
source_py: def number_subsequences_form_ai_bj_ck(s):
      aCount = 0
      bCount = 0
      cCount = 0
      for i in range(len(s)):
          if (s[i] == 'a'):
              aCount = (1 + (2 * aCount))
          elif (s[i] == 'b'):
              bCount = (aCount + (2 * bCount))
          elif (s[i] == 'c'):
              cCount = (bCount + (2 * cCount))
      return cCount
source_cpp: int number_subsequences_form_ai_bj_ck(string s) {
    int aCount = 0;
    int bCount = 0;
    int cCount = 0;
    for ( unsigned int i = 0;
    i < s . size ( );
    i ++ ) {
      if ( s [ i ] == 'a' ) aCount = ( 1 + 2 * aCount );
      else if ( s [ i ] == 'b' ) bCount = ( aCount + 2 * bCount );
      else if ( s [ i ] == 'c' ) cCount = ( bCount + 2 * cCount );
    }
    return cCount;
  }