Check if current sub - string can be arranged into a palindrome
if ( canBePalindrome ( count ) ) { count . put ( ( int ) str . charAt ( end ) , count . get ( ( int ) str . charAt ( end ) ) == null ? 1 : count . get ( ( int ) str . charAt ( end ) ) + 1 ) ; return Math . max ( end - start , maxPal ( str , start , end + 1 , count ) ) ; } else { count . put ( ( int ) str . charAt ( end ) , count . get ( ( int ) str . charAt ( end ) ) == null ? 1 : count . get ( ( int ) str . charAt ( end ) ) + 1 ) ; return maxPal ( str , start , end + 1 , count ) ; } }