25 30 minutes medium leetcode problem but doesn't include all algoritms. In my case there was slinding window, hash and arays, lists, two pointers, binary trees, stack.
and another 25 30 minutes of theoretical questions based on experience.
Preguntas de entrevista [1]
Pregunta 1
Having 2 strings, implement the solution to see the indexes of the anagrams of the second string in first string.
Explain how you approached a hard task.