Ho presentato la mia candidatura tramite segnalazione di un dipendente. La procedura ha richiesto una settimana. Ho sostenuto un colloquio presso Persado (New York, NY) nel mese di set 2016
Colloquio
I interviewed at Persado in September. There were three stages, each conducted by a different engineer. It was relatively light on algorithms and data structures and focused more on short questions to assess your familiarity with the particular language (opposed to testing how you think as a programmer). I would consider the difficulty of the questions to be on the easy-side overall, although you are of course being compared against other applicants so that does not necessarily mean that it reflects on the difficulty of getting an offer. Each interviewer was very approachable and friendly, in their own way, and I would consider this one of the much more enjoyable interviews I've had.
Domande di colloquio [2]
Domanda 1
How would you protect against the possibility of two users signing up for your website with the exact same email address at the exact same time?
If you have two two tables in a SQL database for users and tasks, where users have many tasks, how would you word a query that returned all users that had no tasks?
Ho presentato la mia candidatura online. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso Persado (Atene, , Attica) nel mese di apr 2021
Colloquio
One call with the HR, one call with the teams leader and one technical call with two Senior software engineers. The overall process was pretty pleasant and I felt like I could be my self.
Ho presentato la mia candidatura tramite segnalazione di un dipendente. Ho sostenuto un colloquio presso Persado
Colloquio
Step one - skype session. Asked about background and several technical questions.
Step two - onsite. 3 tech interviews by 3 different engineers
The onsite was not hard. However they also look at cultural fit in addition to your technical ability. So make sure you sound enthusiastic.
Domande di colloquio [1]
Domanda 1
Write a function that when given N (number of steps) and M (maximum steps a person can take at a time), return the total number of possible sequences where the person can go from level 0 to level N.
