Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Audatic (Berlino) nel mese di feb 2021
Colloquio
Super weird way to test all of the technical candidates with the same task. I had been extremely surprised to find exactly the same problem to solve as software engineers are asked to tackle. How can finding permutation of the matrix could by any means show my data science capabilities?
Want to play hard? Give interesting machine learning problems. I didn't even try to solve the tasks after reading the other interview stories from software engineers.
Domande di colloquio [1]
Domanda 1
1. Finding permutation of the matrix with 3 levels of difficulty.
2. Finding the average of the nested list.
Ho presentato la mia candidatura online. La procedura ha richiesto 2 mesi. Ho sostenuto un colloquio presso Audatic (Berlino)
Colloquio
Extremely long, about 6 different stages including 1 difficult coding exam, 1 take home stats project. 2 technical interviews and another interview with the CEO. Last is a presentation to the team.
Domande di colloquio [1]
Domanda 1
They asked about a bounded regression problem with discrete data, can't remember the exact details.
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Audatic nel mese di feb 2021
Colloquio
Waste of time. As usual for complacent startups you'll be asked to complete a few coding tasks online before getting the chance to talk to anyone or ask any questions regarding the role and company. The tasks per se are not super difficult. The problem, however, is the extremely bad coding environment. The platforms neither shows you console output nor exit codes/error messages. Also don't bother to open an issue, not even that works.
I am not sure what they are trying to achieve with this. I hope that any developer and data scientist with a bit of self respect drops out and spends their time on an application for a company that values their competence and time.
Domande di colloquio [1]
Domanda 1
Q1: Check if a given matrix is a permutation matrix with increasing time and memory constraints.
Q2. Find average of a nested list
