Given two strings of lowercase alphabets and a value K, your task is to complete the given function which tells if two strings are K-anagrams of each other or not.
Two strings are called K-anagrams if both of the below conditions are true.
1. Both have same number of characters.
2. Two strings can become anagram by changing at most K characters in a string.
The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. The first line of input contains two Strings Str1 and Str2. And next line contains an integer K, which denotes number of characters can be replaced.
For each testcase, in a new line, print the respective output.
Since this is a function problem, you don't need to take any input. Just complete the given function areKAnagrams that returns true if the strings can be turned into K-anagrams, else return false.
1 <= T <= 100
1 <= K <= |length of String|
Testcase1: change fd to gk
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?Yes