Leaderboard
Showing:
Handle Score
@Ibrahim Nash 6381
@blackshadows 6329
@mb1973 5388
@Quandray 5231
@akhayrutdinov 5111
@saiujwal13083 4510
@sanjay05 3762
@marius_valentin_dragoi 3522
@sushant_a 3459
@verma_ji 3357
@KshamaGupta 3318
Complete Leaderboard
Geek and Bridges
Easy Accuracy: 77.42% Submissions: 30 Points: 2

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.
* @ # *
|     / 
*  #

Input:
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.

Constraints:
1. 1 <= T <= 100

2. 1 <= N, M <= 100

Example:
Input:

2
*@#* *#
*** ##

Output:
2
0

to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes

All Submissions

My Submissions:

Login to access your submissions.

Geek and Bridges

Output Window