Ho presentato la mia candidatura online. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso AppsFlyer nel mese di mar 2020
Colloquio
It started with a phone call with the hr, 2 technical interviews and a final interview with the hr. The process was handled professionaly and they were responsive and fair.
La procedura ha richiesto una settimana. Ho sostenuto un colloquio presso AppsFlyer (Herzliya)
Colloquio
Phone call with a recruiter, a technical Interview with the hiring manager, another technical Interview with a team member and a group manager, HR Interview. All were very nice and the experience was great. They also invited me to a zoom meeting to meet the other team members and to let me ask questions.
Domande di colloquio [1]
Domanda 1
Question about creating a system for shortening links
Ho sostenuto un colloquio presso AppsFlyer (Herzliyya)
Colloquio
Phone call with the HR to introduce yourself, home leetcode style test in codility with 2 questions and time limit, 2 whiteboard interviews in the company place with working staff
Ho presentato la mia candidatura tramite segnalazione di un dipendente. La procedura ha richiesto 7 settimane. Ho sostenuto un colloquio presso AppsFlyer (Herzliya) nel mese di giu 2022
Colloquio
I applied to a student position @ AppsFlyer via referral. AppsFlyer just opened a program from student, hiring 10+ students.
The process took 50 days (from applying my CV to final answer), and included:
1. Phone interview with HR.
2. Home Assignment via Codility.
3. 2 technical interviews on-site.
4. Final HR interview
Everybody I interacted with was nice and welcoming, I also got a tour of the office while on the on-site interview day.
Only reason I describe the experience as neutral is due to the time I had to invest with the process (50 days) which was substantial and should be a lot shorter.
Domande di colloquio [1]
Domanda 1
Home assignment:
1. easy question: find the maximum 1 digit number in an array of numbers. focus on correctness and not performance.
2. medium question: find the longest sub-array of alternating 2 numbers (i.e [6, 2,3,2,3,5,8] should return [2,3,2,3])
On-site interview 1:
1. TwoSum with variations
2. Implement a stack with a max function in O(1).
3. You have tons of data that you need to process concurrently. How would you split the data?
On-site interview 2:
Design a modular scoring methodology to events at the AppsFlyer system.
