You are given two strings, A and B. Answer, what is the smallest number of operations you need totransform A to B?Operations are:Delete one letter from one of stringsInsert one letter into one of stringsReplace one of letters from one of strings with another letterInputT - number of test casesFor each test case:String AString BBoth strings will contain only uppercase characters and they won't be longer than 2000 characters. There will be 10 test cases in data set.OutputFor each test case, one line, minimum number of operations.ExampleInput:1FOODMONEYOutput:4

Given 2 binary strings A and B of the same length, find the minimum number of operations needed to change string A to B. The operations are defined as follows:AND Operation:Choose a pair of indices i and j such that i != j and perform the following sequence of operations.result = Ai & AjAi = result & AiAj = result & AjOR Operation:Choose a pair of indices i and j such that i != j and perform the following sequence of operations.result = Ai | AjAi = result | AiAj = result | AjXOR Operation:Choose a pair of indices i and j such that i != j and perform the following sequence of operations.result = Ai ^ AjAi = result ^ AiAj = result ^ AjInput FormatThe first line of input contains T - the number of test cases. It's followed by 2T lines, the first line contains string A and the second line contains string B.Output FormatFor each test case, if conversion is possible, print "YES" followed by the minimum number of operations required to convert string A to string B, otherwise print "NO", separated by a new line.Constraints1 <= T <= 10001 <= len(A)==len(B) <= 103ExampleInput210101010101011OutputYES 2YES 1ExplanationTest-Case 1We can choose index-1 and index-2 of string A and perform the XOR operation. The resultant string will look like 110. After that, we can choose index-0 and index-2 of the new string A and perform the AND operation. The resultant string will look like 010.

Given two strings A and B, find the minimum number of characters that need to be deleted from these 2 strings to make them anagrams of each other.

Given 2 strings A and B, find the smallest substring of B having all the characters of A, in any order.Input FormatThe first line of input contains T - the number of test cases. It's followed by T lines, each line containing 2 space-separated strings - A and B.Output FormatFor each test case, print the length of the smallest substring of B having all the characters of A, separated by newline. If no such substring is found, print -1.Constraints20 points1 <= T <= 1001 <= size(A), size(B) <= 10060 points1 <= T <= 1001 <= size(A), size(B) <= 1000120 points1 <= T <= 1001 <= size(A), size(B) <= 10000General Constraints'a' <= A[i], B[i] <= 'z'ExampleInput4fkqyu frqkzkruqmfqyuzlkygonmwvytbytn uqhmfjaqtgngcwkuzyamnerphfmwbloets lwbcrsfothplxseplrtbshbtstjloxsfdzpd dclzztpjldkndgbdqqzmbpOutput7-1139ExplanationTest Case 1:The smallest substring containing all characters of A is "fqyuzlk", which has a length of 7.Test Case 2:Despite considering all possible substrings of B, we cannot find any substring containing all characters of A.Test Case 3:The smallest substring containing all characters of A is "bcrsfothplxse", which has a length of 13.Test Case 4:The smallest substring containing all characters of A is "ztpjldknd", which has a length of 9.

Converting AnagramsMax Score: 100Given two strings A and B, find the minimum number of characters that need to be deleted from these 2 strings to make them anagrams of each other.Input FormatThe first line of input contains T - the number of test cases. It's followed by T lines, each line contains 2 space separated strings - A and B.Output FormatFor each test case, print the minimum number of deletions, separated by a new line.Constraints1 <= T <= 10001 <= len(A), len(B) <= 1000'a' <= A[i], B[i] <= 'z'ExampleInput2smart interviewsdata structuresOutput912ExplanationSelf Explanatory

Given two strings word1 and word2, return the minimum number of operations required to convert word1 to word2.You have the following three operations permitted on a word:Insert a characterDelete a characterReplace a character Example 1:Input: word1 = "horse", word2 = "ros"Output: 3Explanation: horse -> rorse (replace 'h' with 'r')rorse -> rose (remove 'r')rose -> ros (remove 'e')Example 2:Input: word1 = "intention", word2 = "execution"Output: 5Explanation: intention -> inention (remove 't')inention -> enention (replace 'i' with 'e')enention -> exention (replace 'n' with 'x')exention -> exection (replace 'n' with 'c')exection -> execution (insert 'u') Constraints:0 <= word1.length, word2.length <= 500word1 and word2 consist of lowercase English letters.