t = int(input())
for i in range(t):
e = input()
f = input()
e_dict = {}
f_dict = {}
for j in range(len(e)):
if e[j] in e_dict:
e_dict[e[j]] += 1
else:
e_dict[e[j]] = 1
for j in range(len(f)):
if f[j] in f_dict:
f_dict[f[j]] += 1
else:
f_dict[f[j]] = 1
count = 0
for j in e_dict:
if j in f_dict:
count += max(e_dict[j], f_dict[j]) - min(e_dict[j], f_dict[j])
else:
count += e_dict[j]
for j in f_dict:
if j not in e_dict:
count+= f_dict[j]
print(count)
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |
112. Path Sum | 1556A - A Variety of Operations |
136. Single Number | 169. Majority Element |
119. Pascal's Triangle II | 409. Longest Palindrome |
1574A - Regular Bracket Sequences | 1574B - Combinatorics Homework |
1567A - Domino Disaster | 1593A - Elections |
1607A - Linear Keyboard | EQUALCOIN Equal Coins |
XOREQN Xor Equation | MAKEPAL Weird Palindrome Making |
HILLSEQ Hill Sequence | MAXBRIDGE Maximise the bridges |
WLDRPL Wildcard Replacement | 1221. Split a String in Balanced Strings |