Distinct Strings With Odd and Even Swapping Allowed Problem Statement

You are provided with an array of strings, and your objective is to determine the number of unique strings within it.

A string is deemed unique if it cannot be transformed into another string within the array by applying the following operations any number of times and in any sequence:

• Swapping two characters located at odd indices.
• Swapping two characters located at even indices.

Example:

Input:

array = ["abcd", "cbad", "bdac", "adcb"]

Output:

2

Explanation:

Strings "abcd", "cbad", and "adcb" can be transformed into one another using the specified operations. However, "bdac" cannot be transformed into any other string. Therefore, there are only 2 unique strings in the array.

Input:

The first line of input consists of an integer ‘T’ representing the number of test cases.
For each test case, the first line contains an integer ‘N’ which indicates the number of strings in the array.
The second line of each test case provides ‘N’ space-separated strings from the array.

Output:

Print the number of unique strings in the array for each test case. Each output should appear on a new line.

Constraints:

• 1 <= T <= 10
• 1 <= N <= 2000
• 1 <= Length of String <= 1000
• Time Limit: 1 second

Note:

You are not required to print anything; this will be handled by the system. Your task is to return the number of unique strings.