← Back to Directory

LinkedIn interview notes, page 24 of 32

Large Enterprises

Most of these LinkedIn write-ups come from Software Engineers (156), then Product Managers (66) and Data Scientists (37). The most reported rounds are the technical phone screen (169), the product sense round (62), the system design round (42) and the behavioral / leadership round (20).

316 interview notes · updated Oct 2026

LinkedIn·Software Engineer·Technical Phone Screen

Jun 2026
LinkedIn coding interview, pretty much just one algorithmic problem the whole session. Nothing too crazy but it's the kind of question that has a slick O(n) solution that you either know or you don't.
  • Given an array containing only the values 0, 1, and 2, sort it in place.

“Classic Dutch national flag problem.”

View Post

LinkedIn·Product Manager·Onsite - Product Sense / Strategy

Jun 2026
PM interview at LinkedIn, product sense round. Single question but it had more layers than I expected going in.
  • Why should users fill out their LinkedIn profile completely? Walk through both the individual user's incentives and what it means for enterprise customers.

“I jumped straight to the user side and talked about discoverability, recruiter reach, that kind of thing.”

View Post

LinkedIn·Product Manager·Onsite - Product Sense / Strategy

Jun 2026
Product strategy question for what seemed like a senior PM role at LinkedIn. Just one question but it was a meaty one, the kind where you can tell they're watching how you structure tradeoffs under pressure.
  • You're the CEO of Airbnb. How do you decide whether to expand into cities that host major football events versus entering capital cities of new countries?

“This one took me a second to get my footing.”

View Post

LinkedIn·Software Engineer·Technical Phone Screen

Jun 2026
LinkedIn coding interview, one question about reconstructing a binary tree from an ancestor matrix. Pretty niche topic, felt underprepared for it.
  • Given an ancestor matrix representing relationships between nodes, construct the corresponding binary tree.

“Stared at this for a solid minute before remembering how ancestor matrices even work.”

View Post

LinkedIn·AI Engineer·Onsite - Behavioral / Leadership

Jun 2026
Behavioral round for an AI Engineer role at LinkedIn. The whole thing was project-deep-dives, but with a specific twist: they wanted to hear about impact well beyond just shipping the thing, think org-level ripple effects, not just latency numbers.
  • Walk me through a project you worked on. What was the business or user problem, what did you specifically do, and what was the measurable impact?
  • Beyond your direct contribution, what broader organizational influence came out of this project? Did other teams reuse your work, or did it affect hiring or mentorship in any way?
  • How did you connect the technical decisions you made on this project to outcomes the company actually cared about, like revenue, reliability, or productivity?

“This sounds like a standard behavioral prompt until you realize they're not satisfied with 'we reduced latency by 30%.' They kept pushing on what happened after.”

View Post

LinkedIn·Software Engineer·Hiring Manager Screen

Jun 2026
Hiring manager chat at LinkedIn for a software engineer role, basically a resume walkthrough where you go project by project and explain what you did, why you made certain calls, and what came out of it.
  • Walk me through your resume and the projects you've worked on across each role.
  • What were your individual contributions on that project, separate from what the team delivered?
  • What technical decisions did you personally own, and why did you make them?
  • What was the measurable impact of your work?
  • What did you take away from that project, and what would you do differently?

“This sounds easy until you're actually doing it and realize your memory of a two-year-old project is mostly vibes.”

View Post

LinkedIn·Product Manager·Onsite - Product Sense / Strategy

Jun 2026
LinkedIn PM interview, one question about designing an accessible Spotify experience for blind users. Pretty open-ended and I wasn't fully prepared for the accessibility angle specifically.
  • How would you design the Spotify mobile app experience for users who are blind?

“I went straight to screen reader compatibility and audio cues, which felt safe but probably too narrow.”

View Post

LinkedIn·AI Engineer·Onsite - Behavioral / Leadership

Jun 2026
Behavioral round at LinkedIn for an AI Engineer role. Just one question but it had real teeth to it, the kind where a vague answer is obvious immediately.
  • Tell me about a time you were blocked by a dependency outside your control, like another team's deliverable or missing infrastructure. How did you diagnose what was actually blocking you, what did you do to move things forward, and what happened?

“The diagnosis part is what tripped me up.”

View Post

LinkedIn·Software Engineer·Technical Phone Screen

Jun 2026
LinkedIn SWE interview with a tree problem that sounds straightforward until you realize there's no root pointer handed to you. The key insight is basically the linked list intersection trick in disguise, which I did not see coming.
  • Given two nodes in a binary tree where each node has a parent pointer, find their lowest common ancestor without access to the root.

“I stared at this for a bit because my brain kept wanting to do the standard LCA recursion from the root, which you just...”

View Post

LinkedIn·Software Engineer·Onsite - Coding / Algorithms

Jun 2026
LinkedIn coding round for a software engineer role, three algorithmic problems back to back. The problems weren't exactly easy and complexity analysis was expected for all of them.
  • Design a cache that supports get and put operations in O(1) average time, evicting the least frequently used key when full. Ties in frequency should be broken by recency.
  • Given two strings, find the shortest contiguous substring of the first string that contains all characters of the second string, including duplicates. Return an empty string if none exists.
  • Given two sorted integer arrays and an integer k, return the k pairs (one element from each array) with the smallest sums. Return all pairs if fewer than k exist.

“This is the LFU cache problem and it's nasty if you haven't seen it.”

View Post