Given 2 strings A and B, check if A is present as a subsequence in B.

Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0.A subsequence of a string is a new string generated from the original string with some characters (can be none) deleted without changing the relative order of the remaining characters.For example, "ace" is a subsequence of "abcde".A common subsequence of two strings is a subsequence that is common to both strings. Example 1:Input: text1 = "abcde", text2 = "ace" Output: 3 Explanation: The longest common subsequence is "ace" and its length is 3.

Given a pair of strings of equal lengths, Geek wants to find the better string. The better string is the string having more number of distinct subsequences. If both the strings have equal count of distinct subsequence then return str1.Example 1:Input:str1 = "gfg", str2 = "ggg"Output: "gfg"Explanation: "gfg" have 7 distinct subsequences whereas "ggg" have 4 distinct subsequences. Example 2:Input: str1 = "a", str2 = "b"Output: "a"Explanation: Both the strings have only 1 distinct subsequence. Your Task:You don't need to read input or print anything. Your task is to complete the function betterString() which takes str1 and str2 as input parameters and returns the better string.Expected Time Complexity: O( max( str1.length, str2.length ) )Expected Auxiliary Space: O( max( str1.length, str2.length ) )Constraints:1 <= str1.lenght , str2.length <= 30

Given a string s of length n, find all the possible subsequences of the string s in lexicographically-sorted order.

Construct the moore machine of {a,b} to count the number ofoccurrences of the substring “ab”.

Compatible StringsCompatible Strings Two strings A and B comprising of lower case English letters are compatible if they are equal or can be made equal by following this step any number of times:Select a prefix from the string A, and increase the alphabetical value of all the characters in the prefix by the same valid amount. For example, if the string is ashzb and we select the prefix ash then we can convert it to bti by increasing the alphabetical value by 1. If we select the prefix ashzb, then it will be converted into btiac. Your task is to determine if given strings A and B are compatible. Input formatRead N.Read N pairs of strings, each in a separate line . Output formatFor each pair of input strings,print YES if string A can be converted to string B, otherwise print NO. SAMPLE INPUT3abacacdbdagodzjneaaqlmcmmo SAMPLE OUTPUTYESNONO Explanation for first pair of strings:The string abaca can be converted to bcbda in one move and to cdbda in the next move. No restriction on the number of moves.