It is total of 3 rounds and it's pretty good and interviewers are very supportive.
In interview ,they tested my data structures and algorithms knowledge and questions about my previous projects and questions about those tools
Preguntas de entrevista [1]
Pregunta 1
find the first non repeating charecter in a string by optimal time and space complexity.
