1177_Can_Make_Palindrome_from_Substring.py

class Solution:
    def canMakePaliQueries(self, s: str, queries: List[List[int]]) -> List[bool]:
        n = len(s)
        count = [0]*(n+1)
        for i in range(n):
            count[i+1] = count[i] ^ (1 << ord(s[i])-ord('a'))

        res = []
        for l, r, k in queries:
            bits = (count[r+1] ^ count[l]).bit_count()
            res.append(bits <= (k*2+1))
        return res