- frequency-counting, Strings, subsequence

Check if a string can be made empty by repeatedly removing given subsequence

  #include using namespace std;  void findIfPossible(int N, string str){    int countG = 0, countF = 0;    for (int i = 0; i < N; i++) {          if (str[i] == 'G')            countG++;        else            countF++;    }      if (2 * countF != countG) {        cout