TNP CHALLENGE 303

CodeChefOpen on judge ↗

Given a string S consisting of only uppercase letters, find the number of substrings which start and end both in X. ###Input: First line contains T, the number of test cases. Each test case consists of an integer, N(the length of string) in one line and a string in the second line. ###Output: For each test case, print the answer in seperate lines. ###Constraints 1 ≤ T ≤ 10

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI