Given a string $s$Plz share segment tree approach for this question of length $N$ consisting only of lowercase English alphabets.

Additionally, you have $q$ queries. In each query, you are provided a substring represented by indices I and $r$ and a character $x$ Your task is to minimize the final length of this substring by performing the following operation any number of times:

Remove any two consecutive occurrences of the character $x$ by a single occurrence in the given substring.

Note. The length of the substring reduces by one after each operation.

All the queries are independent of each other.

Find the minimum length of the substring that can be formed for each query.

Function descriptionComplete the solveo function. The function takes $5$ parameters and returns a single integer denoting the answer to the question.

N$.$ Represents the length of the string

$s$ Represents the string

q$.$ Represents the number of queries

queries. Represents a $2$D array of size $q$ denoting the subarray for each query

characters. Represents an array of size $q$ denoting the character for each query

Input format for custom testingNote: Use this input format if you are testing against custom input or writing code in a language where we don't provide bollerplate code.

The first tine contains an integer $N,$ denoting the length of the string.

The second line contains a string $s,$ denoting the string.

The third line contains a single integer $q.$ denoting the number of querles

Next $q$ lines contain $2$ space$-$separated integers $l,t,$ denoting a query.

Next line contains q space$-$separated characters, where i$-$th character denotes the character for the $1-$th query. Code in javaPlz share segment tree approach for this question