You are given a string s consisting of lower case letters and an integer k

- A non-empty zero-indexed
**string S**is**given**.**String S**consists of N characters from the set of upper-**case**English**letters**A, C, G, T. This**string**actually represents a DNA sequence, and the upper-**case letters**represent single nucleotides.**You**are also**given**non-empty zero-indexed arrays P and Q**consisting**of M integers. **You are given a string s consisting**of lowercase English**letters**and a number**k**. ... We**are given a string S consisting**of N lowercase**letters**. ... The program shall prompt user for a plaintext**string consisting**of mix-**case letters**only; compute the ciphertext; and print the ciphertext in uppercase. For example, Enter a plaintext**string**: ...- In this problem, we
**are given**two strings β**s**β & βtβ**consisting of lower**-**case**English characters. In one operation, we can choose any character in**string**βtβ and change it to some other character. We need to find the minimum number of such operations to make βtβ an anagram of β**s**β. Example**s**= "bab", t = "aba" 1 **Given a string S**, consider all duplicated substrings: (contiguous) substrings of**S**that occur 2 or more times. (The occurrences may overlap.) Return any duplicated substring that has the longest possible length. (If**S**does not have a duplicated substring, the answer is "".). "/>