Given two string of equal length i.e s1 and s2, you need to find how many time the corresponding position in two strings hold exactly the same characters and if a string contains any uppercase character convert that into lowercase and then find the count.
The First line of the input contains an integer T denoting the number of test cases. For each test case, there are two strings input s1 and s2 of equal length.
For each test case, the output is an integer value displaying the number of times characters are same at the corresponding position.
The string should contain only alphabets.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.