Refreshed monthly, last refreshed on June 13, 2026
| Problem | Patterns | Difficulty | |
|---|---|---|---|
| 716. Max Stack | Hard | ||
| 1473. Paint House III | Hard | ||
| 1478. Allocate Mailboxes | Hard | ||
| 977. Squares of a Sorted Array | Easy | ||
| 364. Nested List Weight Sum II | Medium | ||
| 449. Serialize and Deserialize BST | Medium | ||
| 2539. Count the Number of Good Subsequences | Medium | ||
| 17. Letter Combinations of a Phone Number | Medium | ||
| 2939. Maximum Xor Product | Medium | ||
| 1797. Design Authentication Manager | Medium | ||
| π | 432. All O`one Data Structure | Basic DSA | Hard |
| π | 272. Closest Binary Search Tree Value II | Depth-First SearchTwo Pointers | Hard |
| π | 256. Paint House | Dynamic Programming | Medium |
| π | 1117. Building H2O | Basic DSA | Medium |
| π | 366. Find Leaves of Binary Tree | Depth-First Search | Medium |
| π | 244. Shortest Word Distance II | Two Pointers | Medium |
| π | 1041. Robot Bounded In Circle | Simulation | Medium |
| π | 611. Valid Triangle Number | Misc.Two PointersBinary SearchBasic DSA | Medium |
| π | 277. Find the Celebrity | GraphTwo Pointers | Medium |
| π | 636. Exclusive Time of Functions | Basic DSA | Medium |
| π | 1974. Minimum Time to Type Word Using Special Typewriter | Misc. | Easy |
| π | 339. Nested List Weight Sum | Depth-First SearchBreadth-First Search | Medium |
| π | 724. Find Pivot Index | Two Pointers | Easy |
| π | 341. Flatten Nested List Iterator | Depth-First Search | Medium |
| π | 149. Max Points on a Line | Basic DSA | Hard |
| π | 1197. Minimum Knight Moves | Breadth-First Search | Medium |
| π | 200. Number of Islands | Depth-First SearchBreadth-First SearchAdv. Data Structure | Medium |
| π | 297. Serialize and Deserialize Binary Tree | Depth-First SearchBreadth-First Search | Hard |
| π | 127. Word Ladder | Breadth-First Search | Hard |
| π | 261. Graph Valid Tree | Depth-First SearchBreadth-First SearchAdv. Data StructureGraph | Medium |
| π | 763. Partition Labels | Misc.Two Pointers | Medium |
| π | 215. Kth Largest Element in an Array | Misc.Basic DSA | Medium |
| π | 658. Find K Closest Elements | Two PointersBinary SearchBasic DSA | Medium |
| π | 698. Partition to K Equal Sum Subsets | BacktrackingDynamic Programming | Medium |
| π | 380. Insert Delete GetRandom O(1) | Basic DSA | Medium |
| π | 65. Valid Number | Basic DSA | Hard |
| π | 349. Intersection of Two Arrays | Two PointersBinary SearchBasic DSA | Easy |
| π | 516. Longest Palindromic Subsequence | Dynamic Programming | Medium |
| π | 367. Valid Perfect Square | Binary Search | Easy |
| π | 605. Can Place Flowers | Misc. | Easy |
| π | 33. Search in Rotated Sorted Array | Binary Search | Medium |
| π | 235. Lowest Common Ancestor of a Binary Search Tree | Depth-First Search | Medium |
| π | 152. Maximum Product Subarray | Dynamic Programming | Medium |
| π | 146. LRU Cache | Basic DSA | Medium |
| π | 236. Lowest Common Ancestor of a Binary Tree | Depth-First Search | Medium |
| π | 104. Maximum Depth of Binary Tree | Depth-First SearchBreadth-First Search | Easy |
| π | 695. Max Area of Island | Depth-First SearchBreadth-First SearchAdv. Data Structure | Medium |
| π | 61. Rotate List | Basic DSATwo Pointers | Medium |
| π | 53. Maximum Subarray | Misc.Dynamic Programming | Medium |
| π | 20. Valid Parentheses | Basic DSA | Easy |
| π | 213. House Robber II | Dynamic Programming | Medium |
| π | 72. Edit Distance | Dynamic Programming | Medium |
| π | 150. Evaluate Reverse Polish Notation | Basic DSA | Medium |
| π | 205. Isomorphic Strings | Basic DSA | Easy |
| π | 56. Merge Intervals | Basic DSA | Medium |
| π | 88. Merge Sorted Array | Two PointersBasic DSA | Easy |
| π | 76. Minimum Window Substring | Two Pointers | Hard |
| π | 101. Symmetric Tree | Depth-First SearchBreadth-First Search | Easy |
Sign up for free to track your progress, then upgrade to Pro for all 58 questions with detailed solutions.
Sign Up FreeLinkedIn's interview process initiates with a resume screening to ensure candidates' backgrounds align with the job requirements. Those who advance typically face an Online Assessment (OA) comprising coding challenges and technical questions. This phase rigorously tests algorithmic skills and problem-solving capabilities, setting the stage for further evaluation.
Following the OA, candidates undergo one or two phone screens with a focus on technical skills and cultural fit, assessing both coding proficiency and the ability to mesh with LinkedIn's core values. Successful candidates are then invited to the onsite rounds, which usually include multiple technical interviews and a system design assessment. These rounds are known for their difficulty and depth, aimed at thoroughly vetting the candidate's capabilities across various dimensions of software engineering.
LinkedIn's initial resume screening emphasizes skilled endorsements and a clear demonstration of past project impacts. Resumes are parsed by algorithms that seek specific keywords related to the job role.
Applicants who meet criteria undergo online assessments (OAs), testing coding aptitude and problem-solving skills. Top performers are then invited for preliminary screening calls, which assess cultural fit and communication abilities.
At LinkedIn, the interview process typically begins with one or two phone screens. These initial calls focus on assessing the candidate's technical skills and problem-solving abilities, often involving coding exercises or algorithmic questions to solve in real-time.
The phone screen is crucial as it determines whether the applicant progresses to the onsite interviews. It's a chance to showcase not only technical expertise but also communication skills and cultural fit for the LinkedIn environment.
LinkedIn's onsite interview process typically consists of four to six interviews, each focusing on different areas such as coding, system design, and behavioral skills. These sessions are usually conducted back-to-back and can last an entire day.
During the onsite interviews, candidates will face two coding rounds that test their problem-solving abilities using algorithms and data structures, one or two system design rounds focusing on their capability to design scalable systems, and at least one behavioral interview to assess cultural fit and soft skills.
After completing the interview rounds at LinkedIn, candidates may undergo team matching and discussions with executives. Final steps include negotiating the job offer and reviewing company policies before onboarding.

In preparation for the LinkedIn inteview, itβs crucial to prioritize depth-first and breadth-first search techniques respectively. Basic data structures and binary search often form the foundation of coding assessments with very feasible difficulty levels. What sets LinkedIn apart is the relatively higher emphasis on breadth-first search, which could signal the value they place on algorithmic efficiency and scalability in real-world scenarios.
Describe a time when you had to learn a new technology to complete a project.
Tell me about a time when you disagreed with a decision that was made at work.
Can you provide an example of a project where you had to manage multiple deadlines?
Describe a time when you had to collaborate with a team on a challenging project. What was the project and what role did you play in the team?
Tell me about a moment when you helped resolve a dispute among team members. How did you handle it?
LinkedIn values transformation through collaboration. Can you share an experience where teamwork led to an innovative solution at a previous job?
Describe a time when you had to use your programming skills to solve a problem that had no clear solution.
How do you ensure the quality and reliability of your code?
LinkedIn values transformation and creating economic opportunity. Can you talk about a project or initiative you've undertaken that aligns with LinkedIn's vision?