#333 Finding a String Anagram in Text

Companies:
Yandex
Themes:
AlgorithmsStringsPractice

A text T and a string S are given. Find a substring S' in T that matches S up to a permutation of characters and return the starting index of the substring.

Checks:

"a", "a" => 0
"abcd", "aaa" => -1
"abcd", "cbd" => 1
"abcdda", "bcdd" => 1

Question review

Mentor
Answer as you would in a real interview. I’ll ask follow-up questions, then compare your answer with the reference answer and show your accuracy as a %.
Sign in to start the dialogue The mentor keeps the context of the current question and your previous messages.
Sign in