Split the String Problem Statement

You are given a string str consisting of N lowercase alphabets. Your task is to determine if it is possible to divide the string into three non-empty substrings such that one of them is a substring of the other two substrings.

Example:

Input:

str = 'abcabab'

Output:

true

Explanation:

We can split the string into three parts a = 'abc', b = 'ab', and c = 'abc', where b is a substring of both a and c.

Constraints:

• 1 <= T <= 5
• 1 <= N <= 10^5

Note:

A substring is a contiguous sequence of characters within a string. For example, 'ab', 'b', and 'abc' are substrings of the string 'abc', but 'ac' is not a substring of 'abc'. A non-empty substring means a substring with a size greater than 0.

Function Implementation:

You do not need to print anything; it has already been taken care of. Just implement the given function and return the answer.

Input:

The first line of input contains an integer 'T' representing the number of test cases. Each test case includes a single integer 'N' indicating the size of the string, followed by the string 'str' of size 'N'.

Output:

For each test case, return "true" if the split is possible, or "false" otherwise.