Can You Make a Palindrome

A function receives a string s 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 represented by the

beginning and ending index of the string s

$,$

$$determine if

it is possible to rearrange it to a palindrome after

performing up to the given number of substitutions.

Start with an empty result string. After each query,

append a

$1$

$$or

$0$

$$to indicate whether the substring can

be converted to a palindrome. A

$1$

$$represents yes and a

O represents no

$.$

$$Return the results string after all

queries have been processed. with code