Geek wants to build bridges between two banks of a river to help migrants to reach their homes. But, he can build a bridge only between two similar posts. Bridges can't overlap. The task is to find the maximum number of bridges geek can build.
Note: Each of the posts is represented by either '*' or '@' or '#'.
Example: Let str1 = "*@#*", str2 = "*#". Then output will be 2.
* @ # *
1. The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
2. The first line of each test case contains two space-separated strings representing the posts in each bank
Output: For each test case, print the maximum number of bridges geek can build.
1. 1 <= T <= 100
2. 1 <= N, M <= 100
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?Yes