LC-1177 Medium LeetCode

1177. Can Make Palindrome from Substring

Array Hash Table String Bit Manipulation Prefix Sum

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 40% Topics: Array, Hash Table, String, Bit Manipulation, Prefix Sum

Reading material

Arrays & Hashing 12 min Strings 12 min Bit Manipulation 10 min

Reference solution (spoiler · python)

# Time:  O(m + n), m is the number of queries, n is the length of s
# Space: O(n)

import itertools


class Solution(object):
    def canMakePaliQueries(self, s, queries):
        """
        :type s: str
        :type queries: List[List[int]]
        :rtype: List[bool]
        """
        CHARSET_SIZE = 26
        curr, count = [0]*CHARSET_SIZE, [[0]*CHARSET_SIZE]
        for c in s:
            curr[ord(c)-ord('a')] += 1
            count.append(curr[:])
        return [sum((b-a)%2 for a, b in itertools.izip(count[left], count[right+1]))//2 <= k
                for left, right, k in queries]

Solution from kamyu104/LeetCode-Solutions · MIT