Ho presentato la mia candidatura tramite un selezionatore. La procedura ha richiesto 4 settimane. Ho sostenuto un colloquio presso Google (Mountain View, CA) nel mese di ott 2015
Colloquio
4 rounds of 45 min technical interviews. 45 min lunch. They asked about iOS knowledge, algorithm with tree, matrix. For matrix, it is the original question from Cracking the Coding Interview. It is in Mountain View. The difficulty is not as hard as I thought before and they are very nice
Domande di colloquio [1]
Domanda 1
First Round, 3 iOS question about delegate, method swizzling and others, then a question about chunk palindrome
Second Round, get common element from two trees and design a tree class and its function
Third Round, a matrix problem from book: Cracking the coding interview
Fourth Round, basic iOS question and a very easy question
Ho presentato la mia candidatura tramite un selezionatore. Ho sostenuto un colloquio presso Google (Sydney)
Colloquio
I applied through referral. After submitting application, had a recruiter call, then scheduled for an technical interview. The recruiter is very busy and seems to forget me so I email him and chase him down to get scheduled. Interview question is leetcode style and I failed. Afterward, I schedule with recrutier for feedback.
Ho sostenuto un colloquio presso Google (California City, CA)
Colloquio
Initial screening call with recruiter, a single algorithms coding interview, followed by three more algorithm rounds, then a systems design interview followed by a googleyness interview to check culture and leadership.
Ho presentato la mia candidatura tramite segnalazione di un dipendente. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso Google nel mese di dic 2022
Colloquio
It was a technical screen. There was 1 coding problem with few follow-ups. I was able to solve initial question and 1 follow-up, because they were super-easy. Second follow-up was tricky. Got rejected.
Domande di colloquio [1]
Domanda 1
Coding problem related to String and Characters (not from Leetcode)