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

Question

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:

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.

Accepted Answer

Count the number of unique strings in an array by allowing swapping of characters at odd and even indices.

Iterate through each string in the array and check if it can be transformed into another string by swapping characters at odd and even indices.
Keep track of unique strings using a set data structure.
Return the size of the set as the number of unique strings.

Accepted Answer

Hamburger Menu
AmbitionBox Logo

Search
companydesignation
Asked inInfosys,System Engineer

Distinct Strings With Odd and Even Swapping Allowed
You are given an array of strings. Your task is to find the number of unique strings.
A string is considered unique if it cannot be formed from any other string, present in the array, even after applying the following operations any number of times and in any order:
1. Swapping two characters present at odd indices.
2. Swapping two characters present at even indices.
Note:
Strings contain only lowercase English alphabets.
Example:
Let the array of strings be [“abcd”, “cbad”, “bdac”, “adcb”]. From the given array, strings “abcd”, “cbad”, and “adcb” can be transformed into one another by applying the given operations. But “bdac” cannot be transformed into any other string. Hence, there are only 2 unique strings in the array.
Input format:
The very first line of input contains an integer ‘T’ denoting the number of test cases. The first line of every test case contains an integer ‘N’ denoting the number of strings present in the array. The second line of every test case contains ‘N’ space-separated strings, which are present in the array.
Output format:
For each test case, the number of unique strings present in the array is printed. Output for each test case is printed on a separate line.

Accepted Answer

https://private-user-images.githubusercontent.com/77439575/317746643-92b2f4f6-19e6-4d34-a546-a97b7f08f82b.png?jwt=eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJnaXRodWIuY29tIiwiYXVkIjoicmF3LmdpdGh1YnVzZXJjb250ZW50LmNvbSIsImtleSI6ImtleTUiLCJleHAiOjE3MTE2MzM2ODUsIm5iZiI6MTcxMTYzMzM4NSwicGF0aCI6Ii83NzQzOTU3NS8zMTc3NDY2NDMtOTJiMmY0ZjYtMTllNi00ZDM0LWE1NDYtYTk3YjdmMDhmODJiLnBuZz9YLUFtei1BbGdvcml0aG09QVdTNC1ITUFDLVNIQTI1NiZYLUFtei1DcmVkZW50aWFsPUFLSUFWQ09EWUxTQTUzUFFLNFpBJTJGMjAyNDAzMjglMkZ1cy1lYXN0LTElMkZzMyUyRmF3czRfcmVxdWVzdCZYLUFtei1EYXRlPTIwMjQwMzI4VDEzNDMwNVomWC1BbXotRXhwaXJlcz0zMDAmWC1BbXotU2lnbmF0dXJlPTQyMDk0ZjZmZGM1Zjk0MjU1MTQxMmIwODkwYTUzZTQzODQzYTU1NDcyZmU3NTM3OTk2YWIzZTExNTc5MDQ5M2QmWC1BbXotU2lnbmVkSGVhZGVycz1ob3N0JmFjdG9yX2lkPTAma2V5X2lkPTAmcmVwb19pZD0wIn0.D18Rp3NJH8HAVdYiBOPyfUcXIqdGR4TO24ty-_UU37M