LinkedIn Software Engineer Coding & Algorithms Interview Questions
Practice 37 real Coding & Algorithms interview questions for Software Engineer roles at LinkedIn.
"I got asked a hardcore MCM DP question and I saw it on PracHub as well. Solved that question in 5 minutes. Without PracHub I doubt I could solve it in 5 hours. Though somehow didn't get hired, perhaps I guess I solved it too fast? /s"
"Believe me i'm a student here jn US. Recently interviewed for MSFT. They asked me exact question from PracHub. I saw it the night before and ignored it cause why waste time on random sites. I legit wanna go back and redo this whole thing if I had chance. Not saying will work for everyone but there is certainly some merit to that website. And i'm gonna use it in future prep from now on like lc tagged"
"10 years of experience but never worked at a top company. PracHub's senior-level questions helped me break into FAANG at 35. Age is just a number."
"I was skeptical about the 'real questions' claim, so I put it to the test. I searched for the exact question I got grilled on at my last Meta onsite... and it was right there. Word for word."
"Got a Google recruiter call on Monday, interview on Friday. Crammed PracHub for 4 days. Passed every round. This platform is a miracle worker."
"I've used LC, Glassdoor, and random Discords. Nothing comes close to the accuracy here. The questions are actually current — that's what got me. Felt like I had a cheat sheet during the interview."
"The solution quality is insane. It covers approach, edge cases, time complexity, follow-ups. Nothing else comes close."
"Legit the only resource you need. TC went from 180k -> 350k. Just memorize the top 50 for your target company and you're golden."
"PracHub Premium for one month cost me the price of two coffees a week. It landed me a $280K+ starting offer."
"Literally just signed a $600k offer. I only had 2 weeks to prep, so I focused entirely on the company-tagged lists here. If you're targeting L5+, don't overthink it."
"Coaches and bootcamp prep courses cost around $200-300 but PracHub Premium is actually less than a Netflix subscription. And it landed me a $178K offer."
"I honestly don't know how you guys gather so many real interview questions. It's almost scary. I walked into my Amazon loop and recognized 3 out of 4 problems from your database."
"Discovered PracHub 10 days before my interview. By day 5, I stopped being nervous. By interview day, I was actually excited to show what I knew."
"I recently cleared Uber interviews (strong hire in the design round) and all the questions were present in prachub."
"The search is what sold me. I typed in a really niche DP problem I got asked last year and it actually came up, full breakdown and everything. These guys are clearly updating it constantly."
Merge Keyed N-Ary Trees
Merge Keyed N-Ary Trees An N-ary tree node contains a unique string key among its siblings and a list of children. Implement merge_trees(a, b) for two...
Longest Run of Ones After One Flip
This question tests a candidate's ability to solve a sliding window problem involving binary arrays, extending the basic "maximum consecutive ones" pa...
Solve common string and subarray problems
You are given three coding tasks: 1) Reverse a string - Input: a string s. - Output: the string with characters in reverse order. 2) Maximum sum of a ...
Group words that map to same phone digits
Problem On a classic phone keypad (T9), letters map to digits: - 2: ABC, 3: DEF, 4: GHI, 5: JKL, - 6: MNO, 7: PQRS, 8: TUV, 9: WXYZ Given a list of lo...
The Celebrity Problem
The Celebrity Problem At a party there are n people, labeled 0 to n - 1. Among them there may be exactly one celebrity — a person who satisfies both o...
Design O(1) Randomized Multiset
This question evaluates data-structure design skills, understanding of hashing and randomization for uniform sampling, handling of duplicate elements,...
Differentiate Java final, finalize, finally
Differentiate Java's final, finalize, and finally. Define what final means for variables, methods, and classes and give examples; explain what finaliz...
Design a max-stack with efficient operations
Design a max-stack with efficient operations Design a stack that supports push (x), pop(), top(), peekMax(), and popMax(). The popMax operation must r...
Merge two N-ary trees by key rules
You are given two N-ary trees A and B. Each node has: - key (string): unique among siblings (i.e., within a node’s children list, no two children shar...
Compare heap and stack memory
Compare heap and stack memory. Explain how each is allocated and freed, typical lifetimes of data stored there, access patterns and performance charac...
Can You Place N Objects?
This question evaluates array traversal, adjacency-constraint reasoning, and greedy placement intuition, emphasizing handling of boundary conditions a...
Find k closest values in a BST
Find k closest values in a BST Given a binary search tree with n nodes and a real target t, return k node values whose distances to t are smallest. Im...
Count Trips From Vehicle Logs
You are given a text log of vehicle events on a road system. Each log record contains: - license_plate: a string identifying a vehicle - event_type: o...
Process Mutable Matrix Sum Queries
You are given a 2D integer matrix and a list of queries. There are two query types: - set r c v: update the value at row r and column c to v - get r1 ...
Solve Cache, Window, and Heap Problems
You may be asked to solve multiple algorithmic problems in coding rounds: 1. Frequency-based cache: Implement a cache with get(key) and put(key, value...
Compute inverse-depth weighted sum of nested lists
Inverse-Depth Weighted Sum of a Nested List You are given a nested list of integers. Each element is either: - an integer, or - another nested list. D...
Analyze time and space complexity
Analyze time and space complexity For any algorithm you implement, analyze its time and space complexity using Big-O notation. Derive and justify the ...
Find the k-th largest element in an array
Given an integer array nums and an integer k, return the k-th largest element in the array. Notes: - The k-th largest element is the element that woul...
Solve substring and top‑K pair problems
This multi-part question evaluates algorithm design and data-structure proficiency across string processing (minimum window substring), pair-selection...
Minimize adjacent-color assignment cost
Minimize adjacent-color assignment cost You are given H linear items (e.g., houses) and an H×C cost matrix where cost[i][c] is the cost of assigning c...