You are given a string s and a $2$D integer array queries where queries[i] $= [l_i, r_i]$.

A same end substring is a substring whose first character and last character are identical.

For each query, determine the number of same end substrings contained within the substring extending from index $l_i$ to index $r_i$ inclusive.

Return an array of integers representing the answer to each query in the order they appear.

Constraints:

• $2 \leq$ s.length $\leq 3 \times 10^4$

• s consists only of lowercase English letters.

• $1 \leq$ queries.length $\leq 3 \times 10^4$

• queries[i] $= [l_i, r_i]$

• $0 \leq l_i \leq r_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.