int main() { string str; int count = 0; // user input cout << "Enter string: "; cin >> str; int n = str.length(); // iterating over the string for (int i = 0; i < n - 1; i++) { // calling the fucntion to find the palidrome strings from the user input if (isPalindrome(0, i, str) && isPalindrome(i + 1, n - 1, str)) { // if 2 substring are palindrome then print them and increment count for (int x = 0; x < i + 1; x++) cout << str[x]; cout << " "; for (int x = i + 1; x < n; x++) cout << str[x]; count++; // break the loop after printing the palindrom string break; } } // if count is 0 then no palindrome subtring pair found if (count == 0) cout << "NO"; } change this code to stdio.h string.h
int main()
{
string str;
int count = 0;
// user input
cout << "Enter string: ";
cin >> str;
int n = str.length();
// iterating over the string
for (int i = 0; i < n - 1; i++)
{
// calling the fucntion to find the palidrome strings from the user input
if (isPalindrome(0, i, str) && isPalindrome(i + 1, n - 1, str))
{
// if 2 substring are palindrome then print them and increment count
for (int x = 0; x < i + 1; x++)
cout << str[x];
cout << " ";
for (int x = i + 1; x < n; x++)
cout << str[x];
count++;
// break the loop after printing the palindrom string
break;
}
}
// if count is 0 then no palindrome subtring pair found
if (count == 0)
cout << "NO";
}
change this code to stdio.h string.h
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images
