Implement the function to modify and return the string ‘ str’ in such a way that all occurrences of ‘ch1’ in original string are replaced by ‘ch2’ and all occurrences of ‘ch2’ in original string are ...

# you can replace any letter in the string with another letter at most k times. # Find the length of a longest substring containing all repeating letters # you can get after performing the above ...