for _ in range(int(input())):
n = int(input())
d = ''
for i in range(n):
w = input()
d += w
s = list(set(d))
count = 0
for i in range(0, len(s)):
if d.count(s[i]) % n == 0:
count += 1
if count == len(s):
print("YES")
else:
print("NO")#include <bits/stdc++.h>
using namespace std;
int main(){
int tc;
cin >> tc;
int str;
while (tc > 0) {
cin >> str;
string strs[str];
int bigchars[26] = {0};
for (int x = 0; x < str; x++) {
cin >> strs[x];
}
for (string bs: strs) {
for (char c: bs) {
bigchars[c - 'a']++;
}
}
bool acc = true;
for (int ct: bigchars) {
if (ct % str) {
acc = false;
}
}
if (acc) {
cout << "YES";
} else {
cout << "NO";
}
cout << endl;
tc--;
}
} 1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |