J'ai postulé via un recruteur. Le processus a pris 2 semaines. J'ai passé un entretien chez LinkedIn (Sunnyvale, CA) en déc. 2016
Entretien
I was contacted by the recruiter and scheduled a phone screen. After the phone screen I had a full day onsite. The process was smooth and the recruiter, although slow to respond, was very helpful throughout the process. The questions varied between traditional algorithms/data structures and data engineering (data warehousing, SQL).
Questions d'entretien [1]
Question 1
Given a list of employee id and manager id pairs, and given a manager id print/return the manager hierarchy, starting at that manager. For example, given (manager_id, employee_id) as [(1,3), (2,3), (3,4)] and manager_id 4, return {4:[3], 3:[1,2]}. How would you handle the opposite direction, i.e. given an employee_id print the hierarchy of managers.
J'ai postulé via un recruteur. J'ai passé un entretien chez LinkedIn (Sunnyvale, CA) en sept. 2025
Entretien
After talking with the hr, I was scheduled for one hour coding round, with 25 min algorithm questions leetcode question 3: Longest Substring Without Repeating Characters, and 25 mins sql with followup
Questions d'entretien [1]
Question 1
leetcode 3: Longest Substring Without Repeating Characters
1st round was coding. The interview process was smooth. Asked some SQL and Python questions. SQL interview went well but Python interview didn't go well. They didn't call me for the second round. Overall I enjoyed the experience.
Questions d'entretien [1]
Question 1
SQL: Window functions
Python: Basic Data Structures
J'ai postulé en ligne. J'ai passé un entretien chez LinkedIn (Bengaluru) en avr. 2022
Entretien
I applied by giving a test on hackerrank platform. Test had 4 sections.
2 - coding questions
1 - sql question
1- MCQ
Within a week, I received a call from HR to schedule my interview for further steps. My interview was scheduled after 10 days.
Questions d'entretien [1]
Question 1
Interviewer asked me SQL questions involving group by, aggregate functions and multiple join questions.