LinkedIn LeetCode Interview Questions

Practice 175 coding problems currently tagged to LinkedIn. Use the frequency and topic signals to build a focused software engineering interview practice plan.

Last updated: September 28, 2026

26 Easy

113 Medium

36 Hard

Top Topics at LinkedIn

Array Hash Table String Depth-First Search Breadth-First Search

Ace your LinkedIn interview with AI

Get real-time AI assistance during your actual interview. Invisible to screensharing.

Start Free Trial

Problem	DifficultyDiff	Frequency	Topics	Action
Max Stack 100%	HardH	100%	Linked List Stack+3	Solve→
Nested List Weight Sum II 95.4%	MediumM	95.4%	Stack Depth-First Search+1	Solve→
All O`one Data Structure 93.8%	HardH	93.8%	Hash Table Linked List+2	Solve→
Max Consecutive Ones III 83.2%	MediumM	83.2%	Array Binary Search+2	Solve→
Shortest Word Distance II 82.3%	MediumM	82.3%	Array Hash Table+3	Solve→
Find the Celebrity 80.7%	MediumM	80.7%	Two Pointers Graph Theory+1	Solve→
Maximum Subarray 80.4%	MediumM	80.4%	Array Divide and Conquer+1	Solve→
Nested List Weight Sum 79.7%	MediumM	79.7%	Depth-First Search Breadth-First Search	Solve→
Valid Parentheses 79%	EasyE	79%	String Stack+1	Solve→
Word Ladder 79%	HardH	79%	Hash Table String+2	Solve→
Find Leaves of Binary Tree 76.7%	MediumM	76.7%	Tree Depth-First Search+2	Solve→
Insert Delete GetRandom O(1) 75.8%	MediumM	75.8%	Array Hash Table+3	Solve→
Number of Islands 74.5%	MediumM	74.5%	Array Depth-First Search+3	Solve→
Can Place Flowers 74.5%	EasyE	74.5%	Array Greedy	Solve→
Letter Combinations of a Phone Number 73.6%	MediumM	73.6%	Hash Table String+1	Solve→
Maximum Product Subarray 72.5%	MediumM	72.5%	Array Dynamic Programming	Solve→
Find First and Last Position of Element in Sorted Array 70.9%	MediumM	70.9%	Array Binary Search	Solve→
Binary Tree Upside Down 70.9%	MediumM	70.9%	Tree Depth-First Search+1	Solve→
Pow(x, n) 69.2%	MediumM	69.2%	Math Recursion	Solve→
Partition to K Equal Sum Subsets 69.2%	MediumM	69.2%	Array Dynamic Programming+4	Solve→
Search in Rotated Sorted Array 66.5%	MediumM	66.5%	Array Binary Search	Solve→
Minimum Window Substring 66.5%	HardH	66.5%	Hash Table String+1	Solve→
Lowest Common Ancestor of a Binary Search Tree 66.5%	MediumM	66.5%	Tree Depth-First Search+4	Solve→
Sort Transformed Array 66.5%	MediumM	66.5%	Array Math+2	Solve→
LRU Cache 65.8%	MediumM	65.8%	Hash Table Linked List+2	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Paint House 65.8%	MediumM	65.8%	Array Dynamic Programming	Solve→
Maximum Depth of Binary Tree 65%	EasyE	65%	Tree Depth-First Search+2	Solve→
Exclusive Time of Functions 65%	MediumM	65%	Array Stack	Solve→
Bulb Switcher 65%	MediumM	65%	Math Brainteaser	Solve→
Symmetric Tree 63.4%	EasyE	63.4%	Tree Depth-First Search+2	Solve→
Serialize and Deserialize Binary Tree 63.4%	HardH	63.4%	String Tree+4	Solve→
Isomorphic Strings 62.6%	EasyE	62.6%	Hash Table String	Solve→
Lowest Common Ancestor of a Binary Tree 62.6%	MediumM	62.6%	Tree Depth-First Search+3	Solve→
Shortest Word Distance 61.6%	EasyE	61.6%	Array String	Solve→
Closest Binary Search Tree Value II 61.6%	HardH	61.6%	Two Pointers Stack+5	Solve→
Second Minimum Node In a Binary Tree 60.7%	EasyE	60.7%	Tree Depth-First Search+1	Solve→
Find Smallest Letter Greater Than Target 60.7%	EasyE	60.7%	Array Binary Search	Solve→
Random Pick with Weight 60.7%	MediumM	60.7%	Array Math+3	Solve→
Kth Largest Element in an Array 59.7%	MediumM	59.7%	Array Divide and Conquer+3	Solve→
Insert Delete GetRandom O(1) - Duplicates allowed 59.7%	HardH	59.7%	Array Hash Table+3	Solve→
Design Bounded Blocking Queue 59.7%	MediumM	59.7%	Concurrency	Solve→
Permutations 58.6%	MediumM	58.6%	Array Backtracking	Solve→
Lowest Common Ancestor of a Binary Tree III 58.6%	MediumM	58.6%	Hash Table Two Pointers+4	Solve→
Merge Intervals 57.5%	MediumM	57.5%	Array Sorting+1	Solve→
Repeated DNA Sequences 57.5%	MediumM	57.5%	Hash Table String+6	Solve→
Factor Combinations 57.5%	MediumM	57.5%	Backtracking Prime Factorization	Solve→
Valid Number 56.3%	HardH	56.3%	String	Solve→
Max Points on a Line 56.3%	HardH	56.3%	Array Hash Table+4	Solve→
Count Integers in Intervals 56.3%	HardH	56.3%	Design Segment Tree+1	Solve→
Longest Palindromic Subsequence 56.3%	MediumM	56.3%	String Dynamic Programming	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Kth Smallest Product of Two Sorted Arrays 55%	HardH	55%	Array Binary Search	Solve→
Maximize Subarrays After Removing One Conflicting Pair 55%	HardH	55%	Array Segment Tree+2	Solve→
Valid Perfect Square 53.7%	EasyE	53.7%	Math Binary Search	Solve→
Can I Win 53.7%	MediumM	53.7%	Math Dynamic Programming+4	Solve→
Find K Pairs with Smallest Sums 52.2%	MediumM	52.2%	Array Heap (Priority Queue)	Solve→
Robot Room Cleaner 52.2%	HardH	52.2%	Backtracking Interactive	Solve→
Two Sum 50.6%	EasyE	50.6%	Array Hash Table	Solve→
Merge Two Sorted Lists 50.6%	EasyE	50.6%	Linked List Recursion	Solve→
Evaluate Reverse Polish Notation 50.6%	MediumM	50.6%	Array Math+1	Solve→
Shortest Word Distance III 50.6%	MediumM	50.6%	Array String	Solve→
Flatten Nested List Iterator 50.6%	MediumM	50.6%	Stack Tree+4	Solve→
Lowest Common Ancestor of a Binary Tree II 50.6%	MediumM	50.6%	Tree Depth-First Search+3	Solve→
Merge k Sorted Lists 48.8%	HardH	48.8%	Linked List Divide and Conquer+3	Solve→
Insert Interval 48.8%	MediumM	48.8%	Array	Solve→
Binary Tree Level Order Traversal 48.8%	MediumM	48.8%	Tree Breadth-First Search+1	Solve→
Sparse Matrix Multiplication 48.8%	MediumM	48.8%	Array Hash Table+2	Solve→
Building H2O 48.8%	MediumM	48.8%	Concurrency	Solve→
Possible Bipartition 48.8%	MediumM	48.8%	Depth-First Search Breadth-First Search+4	Solve→
Merge Two Binary Trees 48.8%	EasyE	48.8%	Tree Depth-First Search+2	Solve→
Permutations II 46.9%	MediumM	46.9%	Array Backtracking+1	Solve→
Text Justification 46.9%	HardH	46.9%	Array String+1	Solve→
Edit Distance 46.9%	MediumM	46.9%	String Dynamic Programming	Solve→
Binary Tree Zigzag Level Order Traversal 46.9%	MediumM	46.9%	Tree Breadth-First Search+1	Solve→
House Robber 46.9%	MediumM	46.9%	Array Dynamic Programming	Solve→
Product of Array Except Self 46.9%	MediumM	46.9%	Array Prefix Sum	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Palindromic Substrings 46.9%	MediumM	46.9%	Two Pointers String+1	Solve→
Course Schedule II 46.9%	MediumM	46.9%	Depth-First Search Breadth-First Search+2	Solve→
Accounts Merge 46.9%	MediumM	46.9%	Array Hash Table+5	Solve→
Intersection of Two Linked Lists 46.9%	EasyE	46.9%	Hash Table Linked List+1	Solve→
Rotate List 44.7%	MediumM	44.7%	Linked List Two Pointers	Solve→
Two Sum III - Data structure design 44.7%	EasyE	44.7%	Array Hash Table+3	Solve→
Binary Search Tree Iterator 44.7%	MediumM	44.7%	Stack Tree+4	Solve→
Create Binary Tree From Descriptions 44.7%	MediumM	44.7%	Array Hash Table+2	Solve→
Graph Valid Tree 44.7%	MediumM	44.7%	Depth-First Search Breadth-First Search+2	Solve→
Minimum Deletions to Make Array Divisible 44.7%	HardH	44.7%	Array Math+5	Solve→
Maximum Number of Non-overlapping Palindrome Substrings 44.7%	HardH	44.7%	Two Pointers String+2	Solve→
Find Largest Value in Each Tree Row 44.7%	MediumM	44.7%	Tree Depth-First Search+2	Solve→
Maximize Total Tastiness of Purchased Fruits 44.7%	MediumM	44.7%	Array Dynamic Programming	Solve→
Time to Cross a Bridge 44.7%	HardH	44.7%	Array Heap (Priority Queue)+1	Solve→
Sum of Square Numbers 44.7%	MediumM	44.7%	Math Two Pointers+1	Solve→
Find K Closest Elements 44.7%	MediumM	44.7%	Array Two Pointers+4	Solve→
Count Different Palindromic Subsequences 44.7%	HardH	44.7%	String Dynamic Programming	Solve→
Validate Stack Sequences 44.7%	MediumM	44.7%	Array Stack+1	Solve→
New Users Daily Count 44.7%	MediumM	44.7%	Database	Solve→
User Purchase Platform 44.7%	HardH	44.7%	Database	Solve→
Article Views I 44.7%	EasyE	44.7%	Database	Solve→
Article Views II 44.7%	MediumM	44.7%	Database	Solve→
Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold 44.7%	MediumM	44.7%	Array Sliding Window	Solve→
Sum of All Odd Length Subarrays 44.7%	EasyE	44.7%	Array Math+1	Solve→
Sqrt(x) 44.7%	EasyE	44.7%	Math Binary Search+1	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Count Sequences to K 44.7%	HardH	44.7%	Array Math+3	Solve→
Minimum Increase to Maximize Special Indices 44.7%	MediumM	44.7%	Array Dynamic Programming+2	Solve→
Number of Connected Components in an Undirected Graph 42.2%	MediumM	42.2%	Depth-First Search Breadth-First Search+2	Solve→
Valid Triangle Number 39.4%	MediumM	39.4%	Array Two Pointers+3	Solve→
Max Area of Island 39.4%	MediumM	39.4%	Array Depth-First Search+3	Solve→
Paint House II 39.4%	HardH	39.4%	Array Dynamic Programming	Solve→
Min Stack 36.1%	MediumM	36.1%	Stack Design	Solve→
Shuffle an Array 36.1%	MediumM	36.1%	Array Math+2	Solve→
Design HashMap 36.1%	EasyE	36.1%	Array Hash Table+3	Solve→
Valid Parenthesis String 36.1%	MediumM	36.1%	String Dynamic Programming+3	Solve→
Longest Valid Parentheses 36.1%	HardH	36.1%	String Dynamic Programming+2	Solve→
Smallest Range Covering Elements from K Lists 36.1%	HardH	36.1%	Array Hash Table+4	Solve→
Reverse Words in a String 36.1%	MediumM	36.1%	Two Pointers String	Solve→
Longest Substring Without Repeating Characters 32.1%	MediumM	32.1%	Hash Table String+1	Solve→
Integer to Roman 32.1%	MediumM	32.1%	Hash Table Math+1	Solve→
Same Tree 32.1%	EasyE	32.1%	Tree Depth-First Search+2	Solve→
Word Ladder II 32.1%	HardH	32.1%	Hash Table String+3	Solve→
Combination Sum II 32.1%	MediumM	32.1%	Array Backtracking	Solve→
Closest Leaf in a Binary Tree 32.1%	MediumM	32.1%	Tree Depth-First Search+2	Solve→
Implement Rand10() Using Rand7() 32.1%	MediumM	32.1%	Math Rejection Sampling+2	Solve→
Number of Divisible Triplet Sums 32.1%	MediumM	32.1%	Array Hash Table	Solve→
Is Graph Bipartite? 32.1%	MediumM	32.1%	Depth-First Search Breadth-First Search+4	Solve→
Delete Node in a BST 32.1%	MediumM	32.1%	Tree Binary Search Tree+1	Solve→
Cinema Seat Allocation 32.1%	MediumM	32.1%	Array Hash Table+2	Solve→
Process Tasks Using Servers 32.1%	MediumM	32.1%	Array Heap (Priority Queue)	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

LFU Cache 32.1%	HardH	32.1%	Hash Table Linked List+2	Solve→
Combination Sum 26.9%	MediumM	26.9%	Array Backtracking	Solve→
Merge Sorted Array 26.9%	EasyE	26.9%	Array Two Pointers+1	Solve→
Reorder List 26.9%	MediumM	26.9%	Linked List Two Pointers+2	Solve→
House Robber II 26.9%	MediumM	26.9%	Array Dynamic Programming	Solve→
K Closest Points to Origin 26.9%	MediumM	26.9%	Array Math+6	Solve→
Minimum Knight Moves 26.9%	MediumM	26.9%	Breadth-First Search Heuristic Search+2	Solve→
Word Break 26.9%	MediumM	26.9%	Array Hash Table+5	Solve→
Unique Paths 26.9%	MediumM	26.9%	Math Dynamic Programming+1	Solve→
Invert Binary Tree 26.9%	EasyE	26.9%	Tree Depth-First Search+2	Solve→
Dot Product of Two Sparse Vectors 26.9%	MediumM	26.9%	Array Hash Table+3	Solve→
01 Matrix 26.9%	MediumM	26.9%	Array Dynamic Programming+2	Solve→
Koko Eating Bananas 26.9%	MediumM	26.9%	Array Binary Search	Solve→
Task Scheduler 26.9%	MediumM	26.9%	Array Hash Table+4	Solve→
Reverse Integer 26.9%	MediumM	26.9%	Math	Solve→
Subarray Sum Equals K 26.9%	MediumM	26.9%	Array Hash Table+1	Solve→
Making A Large Island 26.9%	HardH	26.9%	Array Depth-First Search+3	Solve→
Course Schedule 26.9%	MediumM	26.9%	Depth-First Search Breadth-First Search+3	Solve→
Best Meeting Point 26.9%	HardH	26.9%	Array Math+2	Solve→
Open the Lock 26.9%	MediumM	26.9%	Array Hash Table+3	Solve→
Rotting Oranges 26.9%	MediumM	26.9%	Array Breadth-First Search+1	Solve→
Maximize Sum of Weights after Edge Removals 26.9%	HardH	26.9%	Dynamic Programming Tree+2	Solve→
Longest Palindromic Substring 20%	MediumM	20%	Two Pointers String+2	Solve→
Partition Labels 20%	MediumM	20%	Hash Table Two Pointers+2	Solve→
H-Index 20%	MediumM	20%	Array Sorting+1	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Long Pressed Name 20%	EasyE	20%	Two Pointers String	Solve→
Expression Add Operators 20%	HardH	20%	Math String+1	Solve→
Kth Smallest Element in a BST 20%	MediumM	20%	Tree Depth-First Search+2	Solve→
Number of Visible People in a Queue 20%	HardH	20%	Array Stack+1	Solve→
Flatten a Multilevel Doubly Linked List 20%	MediumM	20%	Linked List Depth-First Search+1	Solve→
Largest Color Value in a Directed Graph 20%	HardH	20%	Hash Table String+6	Solve→
Integer to English Words 20%	HardH	20%	Math String+1	Solve→
Find Minimum in Rotated Sorted Array 20%	MediumM	20%	Array Binary Search	Solve→
Paint House III 20%	HardH	20%	Array Dynamic Programming	Solve→
Longest String Chain 20%	MediumM	20%	Array Hash Table+4	Solve→
Find the Number of Subarrays Where Boundary Elements Are Maximum 20%	HardH	20%	Array Binary Search+2	Solve→
Robot Bounded In Circle 20%	MediumM	20%	Math String+1	Solve→
Longest Consecutive Sequence 20%	MediumM	20%	Array Hash Table+1	Solve→
Validate Binary Search Tree 20%	MediumM	20%	Tree Depth-First Search+2	Solve→
The Maze 20%	MediumM	20%	Array Depth-First Search+2	Solve→
Largest Rectangle in Histogram 20%	HardH	20%	Array Stack+2	Solve→
Linked List Cycle 20%	EasyE	20%	Hash Table Linked List+2	Solve→
Convert to Base -2 20%	MediumM	20%	Math	Solve→
Insert into a Binary Search Tree 20%	MediumM	20%	Tree Binary Search Tree+1	Solve→
Search in Rotated Sorted Array II 20%	MediumM	20%	Array Binary Search	Solve→
First Unique Character in a String 20%	EasyE	20%	Hash Table String+2	Solve→
Reverse Linked List 20%	EasyE	20%	Linked List Recursion	Solve→
All Nodes Distance K in Binary Tree 20%	MediumM	20%	Hash Table Tree+3	Solve→
Maximum Number of Occurrences of a Substring 20%	MediumM	20%	Hash Table String+1	Solve→
Palindrome Linked List 20%	EasyE	20%	Linked List Two Pointers+2	Solve→

Explore company practice sets with a similar number of tagged coding questions.

Frequently Asked Questions

What LeetCode problems are tagged to LinkedIn?

Our current LinkedIn practice dataset contains 175 tagged coding problems, including Max Stack, Nested List Weight Sum II, All O`one Data Structure. The difficulty breakdown is 26 Easy, 113 Medium, and 36 Hard problems.

How should I prepare for a LinkedIn coding interview?

Focus on the most frequently asked problems first, especially those with high frequency scores. LinkedIn interviews typically emphasize Array and Hash Table. Practice explaining your thought process while coding.

What is the difficulty level of LinkedIn coding interviews?

Based on our data, LinkedIn interviews include 26 Easy (15%), 113 Medium (65%), and 36 Hard (21%) problems.

Ready to ace your LinkedIn interview?

Join thousands of engineers who landed offers at top tech companies.

Get Started Free

No credit card required

Top Topics at LinkedIn