Check if two Strings are K Anagrams | Hashmap Interview Questions Playlist

[@ravitiwari2160]

Hey, Thank you so much all your knowledge sharing. I am able to perform very nice in all my interviews. Keep up the good work. More power to you.
Keep rocking!!!

[@Pepcoding]

Best of luck!

[@suyashlale7315]

I believe we need to remove the key from the map when the value = 0 after subtraction. Otherwise, it will affect the count that is calculated later.

[@bhavikasadhwani2562]

Do this instead
for(auto i : m)
count += abs(i.second);
if(count

[@akanshi_gupta]

no it will not as 0 will be added in the sum

[@akashdas1138]

Mast solution hai so easy to implement

[@AmanKumar-ht8xi]

Mza aa gya sir..

[@MohitSharma-rz1uq]

What if the question is about shifting.....that is you can shift position of elements in a string to make both strings same

[@codeblooded6760]

7:56 Sandeep Maheshwari🤣🤣🤣

[@Pepcoding]

😅

[@somith16]

Bhaiya will u solve next permutations question

[@Pepcoding]

han beta, level2 mei

[@varunsinghal5641]

bool areKAnagrams(string str1, string str2, int k)
{
if(str1.length()> str2.length() || str1.length()second-minimum_f;
its->second= its->second-minimum_f;

}
}
for(auto x:m1){
count = count+x.second;
}
if(count

[@aman6561]

kaafi khud se hogya tha ye.