Download to read offline
![2. Almost Equivalent Strings Two strings are considered "almost equivalent" if they have the
same length AND for each lowercase letter x, the number of occurrences of x in the two strings
differs by no more than 3 . There are two arrays of n strings, arrays s and t. Strings s[i] and t[i]
make the ith pair. They are of equal length and consist of lowercase English letters. For each pair
of strings, determine if they are almost equivalent. Return an array of istrings, either 'YES' or
'NO', one for each pair. Example s=[aabaab,aaaaabb]t=[bbabbc,abb] The number of occurrences
of ' a ', ' b ', and ' c ' in (s[0],t[0]) never differs by more than 3 . This pair is almost equivalent. In
(s[1], t[1]), 'a'violates the condition. The return array is ['YES', 'NO']. Language Environment 1 >
#!/bin/python ' 10 11 1>#!/ bin/python *." 10 11# 12 # Complete the 'areAlmostEquivalent'
function below. 13# 14 # The function is expected to return a STRING_ARRAY. 15 # The
function accepts following parameters: 16# 1. STRING_ARRAY s17# 2. STRING_ARRAY
t18# 19 20 def areAlmostEquivalent (s,t) : 21 # Write your code here 22 23> if __name_-_ ==
'_main_-_' :
Sample Case 0 Sample Input Sample Output YES Explanation Only letters ' a ' and ' b ' are
present in the two strings. The number of occurrences of each differs by 1 . Sample Case 1
Sample Input For Custom Testing
STDIN1adeaaefabcdef1aefaffbcdfdffFunctions[]sizen=1s=[adeaaefabcdef]t[]sizen=1t=[aefaffbc
dfdff]=1 STDIN Function 1s[] size n=1 adeaaefabcdef s= ['adeaaefabcdef'] 1t[] size n=1
aefaffbcdfdff t= ['aefaffbcdfdff'] Sample Output Explanation The letter ' f ' violates the condition:
26=4.
Function Description Complete the function areAlmostEquivalent in the editor below.
areAlmostEquivalent has the following parameters: string s[n] : an array of strings string t[n] : an
array of strings Returns: string[n]: an array of strings, either 'YES' or 'NO' in answer to each test
case Constraints - 1n5 - 1 length of any string in the input 105 Input Format For Custom Testing
In the first line, there is a single integer n, the size of s. In the ith of the following n lines, there is
a string s[i]. In the next line, there is a single integer n, the size of t. In the ith of the following n
lines, there is a string t[i].](https://image.slidesharecdn.com/2-231006090330-8e87a395/75/2-Almost-Equivalent-Strings-Two-strings-are-considered-almost-equiv-pdf-1-2048.jpg)
2. Almost Equivalent Strings Two strings are considered almost equiv.pdf
- 1. 2. Almost EquivalentStrings Two strings are considered "almost equivalent" if they have the same length AND for each lowercase letter x, the number of occurrences of x in the two strings differs by no more than 3 . There are two arrays of n strings, arrays s and t. Strings s[i] and t[i] make the ith pair. They are of equal length and consist of lowercase English letters. For each pair of strings, determine if they are almost equivalent. Return an array of istrings, either 'YES' or 'NO', one for each pair. Example s=[aabaab,aaaaabb]t=[bbabbc,abb] The number of occurrences of ' a ', ' b ', and ' c ' in (s[0],t[0]) never differs by more than 3 . This pair is almost equivalent. In (s[1], t[1]), 'a'violates the condition. The return array is ['YES', 'NO']. Language Environment 1 > #!/bin/python ' 10 11 1>#!/ bin/python *." 10 11# 12 # Complete the 'areAlmostEquivalent' function below. 13# 14 # The function is expected to return a STRING_ARRAY. 15 # The function accepts following parameters: 16# 1. STRING_ARRAY s17# 2. STRING_ARRAY t18# 19 20 def areAlmostEquivalent (s,t) : 21 # Write your code here 22 23> if __name_-_ == '_main_-_' : Sample Case 0 Sample Input Sample Output YES Explanation Only letters ' a ' and ' b ' are present in the two strings. The number of occurrences of each differs by 1 . Sample Case 1 Sample Input For Custom Testing STDIN1adeaaefabcdef1aefaffbcdfdffFunctions[]sizen=1s=[adeaaefabcdef]t[]sizen=1t=[aefaffbc dfdff]=1 STDIN Function 1s[] size n=1 adeaaefabcdef s= ['adeaaefabcdef'] 1t[] size n=1 aefaffbcdfdff t= ['aefaffbcdfdff'] Sample Output Explanation The letter ' f ' violates the condition: 26=4. Function Description Complete the function areAlmostEquivalent in the editor below. areAlmostEquivalent has the following parameters: string s[n] : an array of strings string t[n] : an array of strings Returns: string[n]: an array of strings, either 'YES' or 'NO' in answer to each test case Constraints - 1n5 - 1 length of any string in the input 105 Input Format For Custom Testing In the first line, there is a single integer n, the size of s. In the ith of the following n lines, there is a string s[i]. In the next line, there is a single integer n, the size of t. In the ith of the following n lines, there is a string t[i].