Permutation in String | Anagram of string s1 in string s2 | Leetcode #567

This video explains a very important programming interview question which is based on strings and anagrams concept. The problem is to find if there is any permutation of string s1 present in string s2. This problem is same as finding if any substring of string s2 is an anagram of string s1. Two strings can be anagrams if they are of same length. Therefore, in order to check all substrings of s2, we need to only check substrings of size equal to length of s1. For doing this, the best algorithm is to use sliding window approach. I have explained the intuitive sliding window technique using examples and at the end of the video i have explained the CODE for this algorithm. CODE LINK is present below as usual. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)

LinkedIn: https://www.linkedin.com/in/surya-pratap-kahar-47bb01168
CODE LINK: https://gist.github.com/SuryaPratapK/0244f464e5736cae9cbd0e403df83e70
SIMILAR PROBLEMS:-
Find All Anagrams in a String: https://youtu.be/fYgU6Bi2fRg
Group anagrams: https://youtu.be/0I6IL3TnIZs
Check if two strings are anagrams: https://youtu.be/QZmh8-Auqo8

Видео Permutation in String | Anagram of string s1 in string s2 | Leetcode #567 канала TECH DOSE