I applied online.

There was a coding challenge after a resume screen.

After the resume screen, there was a phone interview (one large question with three or four parts and follow-up questions).

About a week later, I had my video call interview (two questions).

Given a string S and a string T, implement a function search(string s, string t) that returns all occurrences of T or T's permutations in S. Assume that characters in S and T comprise only lowercase and uppercase English letters.