Problem Statement-

You are given a string $S$ with length $N$. Determine if it is possible to find two non-empty strings $A$ and $B$ which satisfy the following conditions:

• $A+B=S$, where $+$ denotes string concatenation
• $B$ is a substring of $A$

Note: $B$ is a substring of $A$ if $B$ can be obtained from $A$ by deleting several (possibly zero) characters from the beginning and several (possibly zero) characters from the end. For example, "ab" is a substring of "cabd", but "ad" is not.

Input

• The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows.
• The first line of each test case contains a single integer $N$.
• The second line contains a single string $S$.

Output

For each test case, print a single line containing the string "YES" if it is possible to find strings $A$ and $B$ satisfying the given conditions or "NO" otherwise (without quotes).

Constraints

• $1\le T\le {10}^{4}$
• $2\le N\le {10}^{5}$
• $|S|=N$
• $S$ contains only lowercase English letters
• the sum of $N$ over all test cases does not exceed ${10}^{6}$

Example Input

5
6
cabdab
21
yourcrushlovesyouback
16
5
split
7
splitit


Example Output

YES
NO
YES
NO
YES


Explanation

Example case 1: We can choose "cabd" as $A$ and "ab" as $B$. We can see that $A+B=S$ and $B$ is a substring of $A$.

Example case 2: It is impossible to find two strings which satisfy the constraints. For example, when $A$ is "yourcrushlovesyou" and $B$ is "back", then $A+B=S$, but $B$ is not a substring of $A$.

Example case 3: We can choose "wubbalubbadub" as $A$ and "dub" as $B$.

Join Telegram For Competetive Programming Guide and Update

Split the Str Ing codechef solution-

Actually do not think So much its ways problem as mentioned in A+B=S and  B is a substring of A.
So My Logic is it is necessary that is if B is a substring of A so Las character of B must be present in A otherwise B cannot be a Substring of A.
So
I will check only for last charter of string S if it is present in A I will Print Yes Otherwise I will Print NO.

Here Is my Code-

codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster

Codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster- Codeforces is one of the most popular platforms for competitive programmers and  codeforces rating matters a lot  .  Competitive Programming  teaches you to find the easiest solution in the quickest possible way. CP enhances your problem-solving and debugging skills giving you real-time fun. It's brain-sport. As you start solving harder and harder problems in live-contests your analytical and rational thinking intensifies. To have a good codeforces profile makes a good impression on the interviewer. If you have a good  codeforces profile so it is very easy to get a referral for product base company like amazon, google , facebook etc.So in this blog I have explained everything about codeforces rating system. What are different titles on codeforces- based on rating codeforces divide rating into 10 part. Newbie Pupil Specialist Expert Candidate Codemaster Master International Master Grandmaster Internat

Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code

Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code - Apple Division CSES Problem Solution Easy Explanation. Apple division is problem is taken form cses introductory problem set.Let's Read Problem statement first. Problem Statement- Time limit:  1.00 s   Memory limit:  512 MB There are  n n  apples with known weights. Your task is to divide the apples into two groups so that the difference between the weights of the groups is minimal. Input The first input line has an integer  n n : the number of apples. The next line has  n n  integers  p 1 , p 2 , … , p n p 1 , p 2 , … , p n : the weight of each apple. Output Print one integer: the minimum difference between the weights of the groups. Constraints 1 ≤ n ≤ 20 1 ≤ n ≤ 20 1 ≤ p i ≤ 10 9 1 ≤ p i ≤ 10 9 Example Input: 5 3 2 7 4 1 Output: 1 Explanation: Group 1 has weights 2, 3 and 4 (total weight 9), and group 2 has weights 1 and 7 (total weight 8). Join Telegram channel for code discussi

Concert Tickets Cses Problem set solution | Concert Tickets Cses Problem set solution Using multiset

Concert Tickets Cses Problem set solution- Porblem statement- Time limit:  1.00 s   Memory limit:  512 MB There are  n n  concert tickets available, each with a certain price. Then,  m m  customers arrive, one after another. Each customer announces the maximum price he or she is willing to pay for a ticket, and after this, they will get a ticket with the nearest possible price such that it does not exceed the maximum price. Input The first input line contains integers  n n  and  m m : the number of tickets and the number of customers. The next line contains  n n  integers  h 1 , h 2 , … , h n h 1 , h 2 , … , h n : the price of each ticket. The last line contains  m m  integers  t 1 , t 2 , … , t m t 1 , t 2 , … , t m : the maximum price for each customer. Output Print, for each customer, the price that they will pay for their ticket. After this, the ticket cannot be purchased again. If a customer cannot get any ticket, print  − 1 − 1 . Constraints 1 ≤ n , m ≤ 2 ⋅ 10 5 1 ≤ n , m ≤ 2 ⋅