question: palindromic triples
given a string S , 3 palindromes (start(i),end(j)) such that i1<=j1<i2<=j2<i3<=j3 .
return how many such palindromic triples present.
answer will be long long int
constriants:
1<len<1e5
S contains lower case letters
Comments (8)