Given a string S, find the longest palindromic substring in S.
Substring of string S:
0 <= i <= j < len(S)
A string which reads the same backwards. More formally, S is palindrome if
reverse(S) = S.
Incase of conflict, return the substring which occurs first ( with the least starting index ).
Input : "aaaabaaa" Output : "aaabaaa"