Given a String S and an integer k we need to find that whether the string can be changed into Pangram string by performing at most k changes and that changes can be only modification in a string (ie In one change we can remove existing character and add new character).
first line of input contains of an integer 'T' denoting number od test cases
first line of each testcase contains String 'S'.
second line of each testcase contains an integer 'k' denoting the number of changes that are allowed.
for each case in a new line print 1 for Yes and 0 for No .
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.