Please enter your email address or userHandle.
Given two strings, find if the first string can be made from second by deleting some characters from second and rearranging remaining characters.
The first line consists of an integer T i.e number of test cases. The first line of each test case consists of string s1. The next line consists of string s2.
If s1 could be made by s2 print "1" else print "0".
1<=|Length of strings|<=1000
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Login to access your submissions.
Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.