Pergunta de entrevista da empresa Quotient
1)Two Sum 2)Longest Substring Without Repeating Characters
Resposta da entrevista
Sigiloso
20 de ago. de 2020
For two sum they were looking for at least 2 approaches and for the second one they were selected candidates who solved the problem using Sliding Window Approach.