1)Two Sum
2)Longest Substring Without Repeating Characters

Question

1)Two Sum
2)Longest Substring Without Repeating Characters

Anonym · Accepted Answer

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.

Quotient

Frage im Vorstellungsgespräch bei Quotient

Antwort im Vorstellungsgespräch

Beobachtete Unternehmen

Jobsuchen