Problem Statement



You are given a string input. You are to find the longest substring of input such that the reversal of the substring is also 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: string

Method signature: string findReversed(string input)

(be sure your method is public)



Notes



The substring and its reversal may overlap partially or completely.



The entire original string is itself a valid substring (see example 4).

Constraints



input will contain between 1 and 50 characters, inclusive.



Each character of input will be an uppercase letter ( A - Z ).

Examples



0)

\"XBCDEFYWFEDCBZ\"

Returns: \"BCDEF\"

We see that the reverse of BCDEF is FEDCB, which appears later in the string.

1)-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