LinkedIn SWE Infra Interview experience
- Posted
- 5 Jan 2026
Summary
I shared my recent interview experience for a Software Engineer role at LinkedIn, which took place in Nov-Dec. I successfully received an offer after completing screening and four onsite rounds focusing on projects, behavioral questions, system design, and coding.
How it went
Sharing my recent interview experience for a Software Engineer role at LinkedIn. Hope this helps others preparing for similar roles.
Screening Round
First 30 mins : Deep dive into past projects
Second half :
https://leetcode.com/problems/nested-list-weight-sum-ii
Self evaluation : Hire
Onsite 1 – Hiring Manager
Detailed discussion on projects (design decisions, failures, learnings)
Why are you leaving my current company?
Why LinkedIn?
What does on-call look like in my current team?
Self evaluation : Strong Hire
Onsite 2 – System Design
Design a fast key-value store with some custome requirements.
Focus was more on LLD part than the HLD.
Self evaluation : Strong Hire
Onsite 3 – Coding
First Problem similar to:
https://leetcode.com/problems/letter-combinations-of-a-phone-number/
Second:
https://leetcode.com/problems/minimum-knight-moves/description/
Self evaluation : Strong Hire
Onsite 4 – Coding
Problem
Find the maximum length of a good subarray
A subarray is good if all its elements are less than the length of that subarray.
Couldn't found the similar problem on leetcode.
Was able to do it after some hints.
Expected TC - O(n)
Self evaluation : Lean Hire
Result
Hire
Whole process took place in Nov-Dec, Recently got an offer.
Questions asked (8)
- 01
Nested List Weight Sum II
Data Structures & Algorithms
Open the problemSolve the problem: Nested List Weight Sum II.
- 02
Why are you leaving my current company?
Behavioral
Why are you leaving my current company?
- 03
Why LinkedIn?
Behavioral
Why LinkedIn?
- 04
On-call in current team
Behavioral
What does on-call look like in my current team?
- 05
Design a fast key-value store
System Design
Design a fast key-value store with some custome requirements. Focus was more on LLD part than the HLD.
- 06
Letter Combinations of a Phone Number
Data Structures & Algorithms
Open the problemSolve the problem: Letter Combinations of a Phone Number.
- 07
Minimum Knight Moves
Data Structures & Algorithms
Open the problemSolve the problem: Minimum Knight Moves.
- 08
Maximum Length of a Good Subarray
Data Structures & Algorithms
Find the maximum length of a good subarray. A subarray is good if all its elements are less than the length of that subarray. Expected TC - O(n).