1. You are given two strings s1, s2, and a number K. 2. You have to find if two strings are K-anagrams of each other or not. 3. Two strings are called K-anagrams if -> Both s1 and s2 have the same number of characters. -> After changing K characters in any string, s1 and s2 become anagram of each other. Note -> Both s1 ad s2 consist of lowercase English letters only.
1 <= length of string s1 and s2 <= 20,000 1 <= K <= length of strings
Two strings s1 and s2 A number K
fodr gork 2