1968B - Prefiquence - CodeForces Solution


greedy two pointers

Please click on ads to support us..

Python Code:

t = int(input())
for test in range(t):
    nm = list(map(int,input().split()))
    n = nm[0]
    m = nm[1]
    arr_a = list(input())
    arr_b = list(input())
    p1=0
    p2=0
    ans=0
    while p1<n and p2<m:
        if arr_a[p1]==arr_b[p2]:
            p1+=1
            ans+=1
        p2+=1
    print(ans)


Comments

Submit
0 Comments
More Questions

1157E - Minimum Array
1661D - Progressions Covering
262A - Roma and Lucky Numbers
1634B - Fortune Telling
1358A - Park Lighting
253C - Text Editor
365B - The Fibonacci Segment
75A - Life Without Zeros
1519A - Red and Blue Beans
466A - Cheap Travel
659E - New Reform
1385B - Restore the Permutation by Merger
706A - Beru-taxi
686A - Free Ice Cream
1358D - The Best Vacation
1620B - Triangles on a Rectangle
999C - Alphabetic Removals
1634C - OKEA
1368C - Even Picture
1505F - Math
1473A - Replacing Elements
959A - Mahmoud and Ehab and the even-odd game
78B - Easter Eggs
1455B - Jumps
1225C - p-binary
1525D - Armchairs
1257A - Two Rival Students
1415A - Prison Break
1271A - Suits
259B - Little Elephant and Magic Square