Check if two Strings are K Anagrams | Hashmap Interview Questions Playlist
Автор: Pepcoding
Загружено: 2020-10-18
Просмотров: 13729
Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that.
NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this video, we discuss the problem where we are required to check if two strings are K anagrams or not. In this problem,
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.
To attempt and to submit this question, click here: https://www.pepcoding.com/resources/d...
For a better experience and more exercises, VISIT:
#hashmaps #datastructure #algorithms
Have a look at our result:
Follow us on our FB page: / pepcoding
Follow us on Instagram: / pepcoding
Follow us on LinkedIn: / pepcoding-education
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке:
