title: Number Subsequences Form Ai Bj Ck
signature: int numberSubsequencesFormAiBjCk(string s) {
test_code: #include <algorithm>
  #include <assert.h>
  #include <cstdlib>
  #include <iostream>
  #include <map>
  #include <set>
  #include <string>
  #include <tuple> 
  #include <unordered_map>
  #include <vector>
  #include <math.h>
  #include <cmath>
  #include <bits/stdc++.h>
  #include <numeric>
  #include <functional>
  
  using namespace std;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual == expected;
  }
  
  string driver(string s, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(s), expected)){
              return "PASSED";
          }
          return "FAILED";
      }
      catch (const std::overflow_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::runtime_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::exception& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (...)
      {
          return "UNK_ERROR";
      }
  }
  
  int main() {
      string result = "";
  
      result = driver("", 0); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver("abbc", 3); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver("abcabc", 7); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver("agsdbkfdc ", 1); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver("ababab", 0); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver("aaaaaaa", 0); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver("aabaaabcc", 111); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver("19", 0); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver("1001100", 0); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver("DtAnuQbU", 0); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
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;
  }