Question

Use C++ promming language

Answer 1

Answer:

C++ CODE:

Explanation:

#include <bits/stdc++.h>

using namespace std;

int countSubstringWithEqualEnds(string s)

{

int result = 0;

int n = s.length();

// Iterating through all substrings in

// way so that we can find first and last

// character easily

for (int i=0; i<n; i++)

for (int j=i+1; j<n; j++)

if (s[i] == s[j]) {

if(s[i] == 'A' || s[i] == 'T'){

result++;

for(int k=i;k<=j;k++){

cout << s[k];

}

cout << endl;

}

}

// result++;

return result;

}

// Driver function

int main()

{

string s;

cin >> s;

cout << "Total DFA matched strings::"<< countSubstringWithEqualEnds(s);

return 0;

}

***********************************************************************************************

OUTPUT: