Question: C++ help // Header Files #include #include #include using namespace std; /* * inputStr, represents the given string for the puzzle */ void funcSubstring (string

C++ help

C++ help // Header Files #include #include #include using namespace std; /*

// Header Files

#include

#include

#include

using namespace std;

/*

* inputStr, represents the given string for the puzzle

*/

void funcSubstring (string inputStr)

{

// Write your code here

}

int main()

{

//input for inputStr

string inputStr;

getline(cin,inputStr);

funcSubstring(inputStr);

return 0;

Question Ray likes puzzles. One day, he challenged Ansh with a puzzle to find a string that is the same when read forwards and backwards. Write an algorithm to find the substring from the given string that is the same when read forwards and backwards. Input The input consists of a stringinputstr, representing the given string for the puzzle. Output From the given string, print a substring which is the same when read forwards and backwards. Note If there are multiple sub-strings of equal length, choose the lexicographically smallest one. If there are multiple sub-strings of different length, choose the one with maximum length. If there is no sub-string that is the same when read forwards and backwards print "None". Sub-string is only valid if its length is more than 1. Strings only contain uppercase characters (A-Z). Examples Example 1 : Input: YABCCBAZ Output: BCCBA Explanation: Given string is "YABCCBAZ", in this only sub-string which is same when read forward and backward is "ABCCBA". Example 2: input: ABC Output: Nome Explanation: Given strine is "ABC", and no substring is present which is same when read forward and backward. So. the output is "None

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!