Can someone please help with this problem.
Given a string (s) and some queries where each query is of the form [l, r] we need to find the number of palindromic substrings, where the length of each substring lies in between [l, r].
1 <= |S| <= 100000
1 <= |q| <= 100000
1 <= l < r <= |S|
s = "zz"
q = 1
[l, r] = [1, 2]
For this, the answer must be 3. 'z', 'z', 'zz' are the three substrings which are palindrome and their length in between [1, 2].
The substrings to be considered may not be distinct, i.e if s = "zzz" then "zz" is to be considered twice.
Thanks in Advance!