Given a string s where each character is either a plate '*' or a candle '|', and a $2$D integer array queries where queries[i] = [ left_i , right_i ] represents the substring s[left_i...right_i] inclusive.

For each query, determine the number of plates that are situated between two candles within the specified substring. A plate is considered between candles if there exists at least one candle to its left and at least one candle to its right within the substring boundaries.

Return an integer array answer where answer[i] is the solution to the ith query.

Constraints:

• $3 \leq$ s.length $\leq 10^5$

• s consists of '*' and '|' characters.

• $1 \leq$ queries.length $\leq 10^5$

• queries[i].length $= 2$

• $0 \leq$ left_i $\leq$ right_i $<$ s.length

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.