SP26772 ANGRMTST - Lets Be An Anagrammatist

Do you know what is an anagram? _**An anagram is a rearrangement of letters of one word to form another word.**_ For example: one of the anagram of the word “CODEMASK” can be “DEMOCSAK”. So, we can find different kinds of anagram of a word. Now, you are given two array S & T. You have to find a **lexicographically smallest** contiguous subsequence of S which is an anagram of array T. Between two sequence A & B, where length(A) == length(B), A will be lexicographically smaller than B if we can find an index i (1

N/A

N/A