Solicité el puesto a través de la recomendación de un empleado. El proceso duró 3 semanas. Acudí a una entrevista en LinkedIn (Bengaluru) en sept 2017
Entrevista
Smooth, well organized. Recruiter contacted me after I submitted my application via referral. Phone screen was setup on a convenient date. After the phone screen was done, on-site interview was scheduled. On-screen interviews went smooth and was well organized.
At this time, I was not informed which team I was interviewing for. Recruiter promised to get me an update within a certain date. He was late by a couple days and hence I reached out. Feedback was shared with me. A couple days later, an offer was made and we took things from there.
Preguntas de entrevista [1]
Pregunta 1
Problem solving and coding rounds included questions on Binary Search Tree, arrays etc
Acudí a una entrevista en LinkedIn (San Francisco, CA)
Entrevista
The interview process started with a screening round featuring one LeetCode medium problem and an SQL challenge. This was followed by a comprehensive onsite with five rounds: a LeetCode coding challenge, an SQL assessment, a system design interview, a hiring manager conversation to evaluate cultural fit, and finally a team matching phase to find the right team.
Acudí a una entrevista en LinkedIn (Sunnyvale, CA)
Entrevista
Interviewed for an SDE role. The process was well-organized and the recruiters were responsive throughout. That said, the technical rounds were significantly more challenging than expected — definitely come prepared to go deep. Overall a valuable experience regardless of the outcome.
That was a real stroke of luck — when I got to the coding round and encountered a question on finding the maximum subarray sum, I had literally seen this exact problem on prachub.com a few days earlier. The interview kicked off with a recruiter screen, followed by a technical phone interview. It was intense, especially with the focus on algorithms and data structures. I also faced some behavioral questions that challenged my experience. After a final onsite round, I received an offer and happily accepted. Overall, it was tough but rewarding.
Preguntas de entrevista [1]
Pregunta 1
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Walk through Kadane's algorithm and explain the O(n) approach.