Split the Str Ing codechef October Cook off challenge solution

 Split the Str Ing codechef October Cook off challenge solution -

Problem Statement-

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

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

Note: B$B$ is a substring of A$A$ if B$B$ can be obtained from A$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$T$ denoting the number of test cases. The description of T$T$ test cases follows.
• The first line of each test case contains a single integer N$N$.
• The second line contains a single string S$S$.

Output

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

Constraints

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

Example Input

5
6
cabdab
21
yourcrushlovesyouback
16
wubbalubbadubdub
5
split
7
splitit

Example Output

YES
NO
YES
NO
YES

Explanation

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

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

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

Problem link=https://www.codechef.com/COOK123B/problems/SPLITIT

Join Telegram For Competetive Programming Guide and Update-https://t.me/competitiveProgrammingDiscussion

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-