Pregunta de entrevista de Quotient
1)Two Sum 2)Longest Substring Without Repeating Characters
Respuesta de la entrevista
Anónimo
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.