Solicité el puesto a través de un captador. El proceso duró 4 semanas. Acudí a una entrevista en LinkedIn (Sunnyvale, CA) en sept 2023
Entrevista
1. Online Assessment (OA) shared by recruiter after recruiter reached out on LinkedIn and told me to apply for the job.
OA had 2 questions - 1 easy, 1 easy-med
2. 1 technical and 1 behavioral round back to back. 1 hr each.
Technical - 15 min technical deep dive into project on resume. 1 leetcode easy-med question. Had to handle edge cases properly. Coded in python, was okay if didn't rem exact syntax, code didn't have to be run.
Behavioral - 45 min of asking questions about how I handled technical/other challenges at work in the past, to explain my interests, talk about resume projects and in the end got to ask questions.
Be sure to be clear with basics of your resume projects and basics of data structures and algorithms.
Preguntas de entrevista [1]
Pregunta 1
What was a time you faced difficulty/coflict at work and how did you handle it?
Acudí a una entrevista en LinkedIn (Mountain View, CA) en nov 2025
Entrevista
Pretty chill overall. Recruiter call -> OA -> 1h behavioral and 1h technical, back-to-back. 2 LC mediums for technical. Was asked to dry-run the code and follow-up questions after solving it optimally.
Solicité el puesto a través de un captador. Acudí a una entrevista en LinkedIn en nov 2025
Entrevista
Starts with OA, then goes to phone screen. After phone screen, there is a super day with behavioral with hiring manager and then a technical with a senior engineer with two medium LC questions.
Preguntas de entrevista [1]
Pregunta 1
They asked why I was interested in an internship at LinkedIn.
Acudí a una entrevista en LinkedIn (Sunnyvale, CA)
Entrevista
Recruiter screen (20 min) basic behavioral questions, Virtual Onsite (40 min w/ Hiring Manger, 40 min for technical). HM portion was very laid-back and conversational. technical included 1 lc easy and 1 lc medium
Preguntas de entrevista [1]
Pregunta 1
Why did you choose Computer Science?
Binary search problem
set union/intersection problem
