Question

Hello,

The C++ question is:

-------------------------------------------------------------------------------

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.

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.

---------------------------------------------------------------------------------

I have completed the first part but I am unsure on how to also determine if each string is all unique characters

-------------------------------------------------------------------------------

#include <iostream>
#include <algorithm>

using namespace std;

// Checking if two strings are permutation
bool permutationcheck(string in1, string in2)
{
// Length of both of the strings
int n1 = in1.length();
int n2 = in2.length();

if (n1 != n2)
return false;

// Sorting
std::sort(in1.begin(), in1.end());
std::sort(in2.begin(), in2.end());

// comparing now that they are sorted
for (int i = 0; i < n1; i++)
if(in1[i] != in2[i])
return false;

return true;
}

int main()
{
string in1;
string in2;
cout << "Enter two strings: " << endl;
cin >> in1 >> in2;

if(permutationcheck(in1, in2))
cout << "Yes" << endl;
else
cout << "No" << endl;

return 0;
}
-------------------------------------------------------------------------------------------------

Answer 1

#include <iostream>
#include <algorithm>

using namespace std;

bool unique_chars(string str){
   int n = str.length(), i, j;
   for(i = 0;i<n;i++){
      for(j = 0;j<i;j++){
         if(i!=j && str[i] == str[j]){
            return false;
         }
      }
   }
   return true;
}

// Checking if two strings are permutation
bool permutationcheck(string in1, string in2)
{
// Length of both of the strings
int n1 = in1.length();
int n2 = in2.length();

if (n1 != n2)
return false;

// Sorting
std::sort(in1.begin(), in1.end());
std::sort(in2.begin(), in2.end());

// comparing now that they are sorted
for (int i = 0; i < n1; i++)
if(in1[i] != in2[i])
return false;

return true;
}

int main()
{
string in1;
string in2;
cout << "Enter two strings: " << endl;
cin >> in1 >> in2;

if(permutationcheck(in1, in2)){
   cout << "Yes" << endl;
   if(unique_chars(in1)){
      cout<<"All unique characters"<<endl;
   }
   else{
      cout<<"String does not have all unique characters"<<endl;
   }
}
else
cout << "No" << endl;

return 0;
}