Question

Multi Part question for c++ thank you and yes I'm going to rate you up thanks ^^

Part A

Question #1

Write a program that takes as input 2 strings from the user. Then it determines if one string is a permutation of the other string.

Question #2

If the program answers "yes" to the previous question, meaning the two strings are permutations of each other, determine if each string has all unique characters.

Hint: For comparing strings you can use functions like length(), strcmp(), or write your own check_equality(string, string) function.

Answer 1

// C++ program to check if two strings are permutation of each other or not, and if they are check if the strings have unique characters

#include <iostream>

#include <string>

using namespace std;

// function declaration

bool check_equality(string str1, string str2);

int main() {

               string str1, str2;

               // input of both strings

               cout<<" Enter string 1 : ";

               cin>>str1;

               cout<<" Enter string 2 : ";

               cin>>str2;

               bool result = check_equality(str1,str2);

               bool unique = true;

               if(result) // if strings are permutation of each other

               {

                              cout<<" The two string are permutation of each other"<<endl;

                              int count=0;

                              // loop to get the count of each character in str1

                              for(size_t i=0;i<str1.length();i++)

                              {

                                             count=0;

                                             for(size_t j=0;j<str1.length();j++)

                                                            if(str1.at(i) == str1.at(j))

                                                                           count++;

                                             if(count > 1) // if count > 1, then non-unique characters

                                             {

                                                            unique = false;

                                                            break;

                                             }

                              }

                              if(unique)

                                             cout<<" Strings have unique characters"<<endl;

                              else

                                             cout<<" Strings do not unique characters"<<endl;

               }else

                              cout<<" The two string are not permutation of each other"<<endl;

               return 0;

}

// function to check if two strings are permutation of each other or not

bool check_equality(string str1, string str2)

{

               int count1, count2;

               if(str1.length() != str2.length()) // check if length of both strings are same

                              return false;

               // loop over string 1

               for(size_t i=0;i<str1.length();i++)

               {

                              count1=0, count2 = 0;

                              // count the frequency of character at ith position in str1 in str1

                              for(size_t j=0;j<str1.length();j++)

                                             if(str1.at(i) == str1.at(j))

                                                            count1++;

                              // count the frequency of character at ith position in str1 in str2

                              for(size_t j=0;j<str2.length();j++)

                                             if(str2.at(j) == str1.at(i))

                                                            count2++;

                              // if count doesn't match, then they are not permutation of each other

                              if(count1 != count2)

                                             return false;

               }

               return true; // strings are permutation of each other

}

//end of program

Output: