give string s find disjoint palindromic subsequence s product length maximize the subsequence disjoint pick character indexReturn maximum possible product length palindromic subsequencesA subsequence string derive string delete character change order remain character a string palindromic read forward backward Example 1input s leetcodecomOutput 9explanation an optimal solution choose ete 1st subsequence cdc 2nd subsequencethe product length 3 3 9example 2input s bbOutput 1explanation an optimal solution choose b character 1st subsequence b second character 2nd subsequencethe product length 1 1 1example 3input s accbcaxxcxxoutput 25explanation an optimal solution choose accca 1st subsequence xxcxx 2nd subsequencethe product length 5 5 25 constraints2 slength 12 consists lowercase english letter