Question

Q)Supposed we have a string seq= "ACGTGT" . Given a value n, find all posible outcomes of N'mers. Write a C++ function to do so. You can only use loops or nested loops.

For example if n=3 then the posible combinations are and your output should be ACG CGT GTG TGT.

Note: You can only use loops/nested loops to do so.

Answer 1

#include <iostream>
#include <string>

using namespace std;

int main() {
   string str = "ACGTGT";
   cout << "Enter value of n: ";
   int n;
   cin >> n;
   for(int i = 0; i < str.size()-n+1; ++i) {
       for(int j = 0; j < n; ++j) {
           cout << str[i+j];
       }
       cout << " ";
   }
   cout << endl;
   return 0;
}

Enter value of n: 3 ACG CGT GTG TGT Process exited after .949 seconds with return ualue Press any key to continue - - -