This video explains a very important programming interview problem which is to find all anagrams of a string P in another string S. We need to record the starting indices of all anagrams of string P in string S and then return the recorded array of indices. The most intuitive approach of solving this problem is by using sliding window technique and i have explained the same using examples. At the end of the video, i have explained the code for the sliding window 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: [ Ссылка ]

CODE LINK: [ Ссылка ]

свернуть