Introduction - If you have any usage issues, please Google them yourself
Problem Statement You are given a string in put. You are to find the longest substring of proficient ut such that the reversal of the substring is als o a substring of input. In case of a tie. return the string that occurs earliest in input . Definition Class : ReverseSubstring Method : findReversed Parameters : string Returns : Method signature string : string findReversed (string input) (be sure yo ur method is public) The Notes and its substring reversal may overlap partially or completely. The entire original string is itself a valid sub string (see example 4). Constraints will input contain between 1 and 50 characters, inclusive. Each character of input will be an up percase letter (A-Z). Examples 0) "XBCDEFYWFE DCBZ "Returns : "BCDEF" We see the reverse of that is
Packet : 45665975reversesubstring.rar filelist
ReverseSubstring.cpp
[300]ReverseSubstring.txt