Check if two strings are k-anagrams or not
Submissions: 5832   Accuracy:

27.7%

  Difficulty: Easy   Marks: 2
Associated Course(s):   Placement 100

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.

Input Format:
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.

Output Format:
For each testcase, in a new line, print the respective output.

Your Task:
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.

Constraints:
1 <= T <= 100
1 <= K <= |length of String|

Example:
Input:

1
fodr gork
2
Output:
1

Explanation:
Testcase1:
change fd to gk

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Saksham Raj Seth
Author: saksham seth


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.


to report an issue on this page.