You are given a string s and array queries where queries[i] = [left _i , right _i , k _i ] . We may rearrange the substring s[left _i ...right _i ] for each query and then choose up to k _i of them to replace with any lowercase English letter.
If the substring is possible to be a palindrome string after the operations above, the result of the query is true . Otherwise, the result is false .
Return a boolean array answer where answer[i] is the result of the i ^th query queries[i] .
Note that each letter is counted individually for replacement, so if, for example s[left _i ...right _i ] = "aaa" , and k _i = 2 , we can only replace two of the letters. Also, note that no query modifies the initial string s .
Example :
Input: s = "abcda", queries = [[3,3,0],[1,2,0],[0,3,1],[0,3,2],[0,4,1]]
Output: [true,false,false,true,true]
Explanation:
queries[0]: substring = "d", is palidrome.
queries[1]: substring = "bc", is not palidrome.
queries[2]: substring = "abcd", is not palidrome after replacing only 1 character.
queries[3]: substring = "abcd", could be changed to "abba" which is palidrome. Also this can be changed to "baab" first rearrange it "bacd" then replace "cd" with "ab".
queries[4]: substring = "abcda", could be changed to "abcba" which is palidrome.
1 <= s.length, queries.length <= 10 ^50 <= left _i <= right _i < s.length0 <= k _i <= s.lengths consists of lowercase English letters.