Ho presentato la mia candidatura online. La procedura ha richiesto 2 giorni. Ho sostenuto un colloquio presso Edmunds.com (Santa Monica, CA) nel mese di lug 2018
Ho presentato la mia candidatura tramite un selezionatore. La procedura ha richiesto più di una settimana. Ho sostenuto un colloquio presso Edmunds.com
Colloquio
This interview left me with a bad taste in my mouth. I was really excited to interview with this company. They had technical issues in the beginning which made the interview start late. Then I was on video camera but they were not, so it was a bit uncomfortable for me since i was talking to google chat icons. Lastly, they didn’t give me enough time to look over the question and read the code. I maybe had maybe 2 minutes, maybe 3 and I was very confused during the technical. It didn’t leave a good impression because there were vital things I had missed had I gotten a chance to read the entire problem. The recruiter told me it would be a 15 min intro and 45 min technical. There was no intro, they didn’t ask a single question about myself. The first 20 min was the technical and then the rest of the time I got to ask questions. At the end I had one more question and the guy said we ran out of time, bye, and hung up. It was so abrupt and rude. Would not recommend to friends.
Domande di colloquio [1]
Domanda 1
Given two functions, one fast and one slow. How would you make a third one that is faster over time? (Using cache)
What are ways you optimize? (They are looking for caching answer)
Ho presentato la mia candidatura online. La procedura ha richiesto una settimana. Ho sostenuto un colloquio presso Edmunds.com (Los Angeles, CA) nel mese di nov 2017
Colloquio
There is an HR interview followed by a hire manager interview. I failed on the hire manager one...
The HR asked behavior questions and several basic java programming questions and the hire manager asked the questions about sorting algorithm.
Domande di colloquio [1]
Domanda 1
If you know the max and min of an array, can you improve the time complexity of sort algorithm?