Recursive call to find the longest Palindromic string by including one corner character at a time
return max ( longestPalindromic ( str , i + 1 , j , 0 ) , longestPalindromic ( str , i , j - 1 , 0 ) ) ; }