Breaking News: Grepper is joining You.com. Read the official announcement!

A function receives a strings and a series of queries. For each query, there will be a beginning and ending index and a number of substitutions. A palindrome is a string spelled the same way forward or backward, like a, mom or abba. For each substring rep

namespace void answered on September 19, 2023 Popularity 2/10 Helpfulness 8/10

answer A function receives a strings and a series of queries. For each query, there will be a beginning and ending index and a number of substitutions. A palindrome is a string spelled the same way forward or backward, like a, mom or abba. For each substring rep

A function receives a strings and a series of queries. For each query, there will be a beginning and ending index and a number of substitutions. A palindrome is a string spelled the same way forward or backward, like a, mom or abba. For each substring rep

Comment

def palindrome_checker(s, start_index, end_index, subs):
    # A function to count the number of set (i.e., 1) bits in a value
    def count_set_bits(value):
        return bin(value).count("1")

    # To make a string palindrome, we will look at the character counts.
    # If there is more than 1 character in the string with an odd count,
    # it will be impossible to make the string palindrome.
    odd_counts = dict()
    offset = ord('a')
    answer_string = ""
    str_par = []
    bit_parity = 0
    str_par.append(bit_parity)

    for char in s:
        # Given any substring, let's say odd_count of the chars have an odd count.
        # We should reduce the odd count as much as possible.
        # With one replacement, we can make two odd counts even.
        char_idx = ord(char) - offset
        bit_parity = (bit_parity ^ (1 << char_idx))
        str_par.append(bit_parity)

    q = len(start_index)
    for i in range(0, q):
        c1 = str_par[start_index[i]]
        c2 = str_par[end_index[i] + 1]
        diff = (c1 ^ c2)
        odd_count = count_set_bits(diff)
        result = (odd_count - subs[i] * 2) <= 1

        # If the result is True, then we will add '1' to the answer string.
        # Otherwise, we will add '0' to the answer string.
        if result:
            answer_string += '1'
        else:
            answer_string += '0'

    return answer_string

# For this input
s = "cdecd"
start_index = [0, 0, 0, 0]
end_index = [0, 1, 2, 3]
subs = [0, 1, 1, 0]

# Calling the function to get the answer string and printing it
print(palindrome_checker(s, start_index, end_index, subs))

Popularity 2/10 Helpfulness 8/10 Language python

Source: exedustack.nl

Tags: each forward function mom palindrome python rep series string substring

Link to this answer
Share Copy Link

Contributed on Sep 19 2023

namespace void

0 Answers Avg Quality 2/10

A function receives a strings and a series of queries. For each query, there will be a beginning and ending index and a number of substitutions. A palindrome is a string spelled the same way forward or backward, like a, mom or abba. For each substring rep

Contents

More Related Answers

A function receives a strings and a series of queries. For each query, there will be a beginning and ending index and a number of substitutions. A palindrome is a string spelled the same way forward or backward, like a, mom or abba. For each substring rep

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.