Top 100 Interview Questions
Essential collection of 100 coding problems that appear most often in technical interviews.
100
Total Problems
20
Easy
62
Medium
18
Hard
83%
Avg Frequency
Most Common Topics
Companies Asking These Questions
Problems in This Collection
#1
Rank
#3594MediumFrequency: 100%High Priority
Identify the Largest Outlier in an Array
#2
Rank
#3655MediumFrequency: 100%High Priority
Digit Operations to Make Two Integers Equal
#3
Rank
#1371MediumFrequency: 100%High Priority
Minimum Remove to Make Valid Parentheses
#4
Rank
#3638HardFrequency: 100%High Priority
Minimum Operations to Make Character Frequencies Equal
#5
Rank
#3613MediumFrequency: 100%High Priority
Maximize Amount After Two Days of Conversions
#6
Rank
#716HardFrequency: 100%High Priority
Max Stack
#7
Rank
#8
Rank
#9
Rank
#10
Rank
#532MediumFrequency: 100%High Priority
K-diff Pairs in an Array
#11
Rank
#1423MediumFrequency: 100%High Priority
Maximum Number of Occurrences of a Substring
#12
Rank
#286MediumFrequency: 100%High Priority
Walls and Gates
#13
Rank
#1171MediumFrequency: 100%High Priority
Shortest Path in Binary Matrix
#14
Rank
#146MediumFrequency: 100%High Priority
LRU Cache
#15
Rank
#295HardFrequency: 100%High Priority
Find Median from Data Stream
#16
Rank
#362MediumFrequency: 100%High Priority
Design Hit Counter
#17
Rank
#314MediumFrequency: 97%High Priority
Binary Tree Vertical Order Traversal
#18
Rank
#19
Rank
#658MediumFrequency: 96%High Priority
Find K Closest Elements
#20
Rank
#21
Rank
#22
Rank
#348MediumFrequency: 93%High Priority
Design Tic-Tac-Toe
#23
Rank
#24
Rank
#215MediumFrequency: 92%High Priority
Kth Largest Element in an Array
#25
Rank
#1790MediumFrequency: 91%High Priority
Lowest Common Ancestor of a Binary Tree III
#26
Rank
#364MediumFrequency: 88%High Priority
Nested List Weight Sum II
#27
Rank
#1046MediumFrequency: 88%High Priority
Max Consecutive Ones III
#28
Rank
#200MediumFrequency: 88%High Priority
Number of Islands
#29
Rank
#300MediumFrequency: 88%High Priority
Longest Increasing Subsequence
#30
Rank
#460HardFrequency: 88%High Priority
LFU Cache
#31
Rank
#647MediumFrequency: 88%High Priority
Palindromic Substrings
#32
Rank
#33
Rank
#912MediumFrequency: 87%High Priority
Random Pick with Weight
#34
Rank
#35
Rank
#36
Rank
#37
Rank
#322MediumFrequency: 87%High Priority
Coin Change
#38
Rank
#1478MediumFrequency: 87%High Priority
Maximum Number of Events That Can Be Attended
#39
Rank
#621MediumFrequency: 85%High Priority
Task Scheduler
#40
Rank
#41
Rank
#42
Rank
#3MediumFrequency: 84%High Priority
Longest Substring Without Repeating Characters
#43
Rank
#339MediumFrequency: 84%High Priority
Nested List Weight Sum
#44
Rank
#366MediumFrequency: 84%High Priority
Find Leaves of Binary Tree
#45
Rank
#46
Rank
#47
Rank
#48
Rank
#49
Rank
#124HardFrequency: 83%High Priority
Binary Tree Maximum Path Sum
#50
Rank
#1352HardFrequency: 83%High Priority
Maximum Profit in Job Scheduling
#51
Rank
#52
Rank
#53
Rank
#54
Rank
#53MediumFrequency: 79%High Priority
Maximum Subarray
#55
Rank
#70EasyFrequency: 79%High Priority
Climbing Stairs
#56
Rank
#57
Rank
#236MediumFrequency: 79%High Priority
Lowest Common Ancestor of a Binary Tree
#58
Rank
#269HardFrequency: 79%High Priority
Alien Dictionary
#59
Rank
#60
Rank
#61
Rank
#199MediumFrequency: 76%High Priority
Binary Tree Right Side View
#62
Rank
#347MediumFrequency: 76%High Priority
Top K Frequent Elements
#63
Rank
#1713MediumFrequency: 76%High Priority
Dot Product of Two Sparse Vectors
#64
Rank
#42HardFrequency: 74%High Priority
Trapping Rain Water
#65
Rank
#66
Rank
#543EasyFrequency: 74%High Priority
Diameter of Binary Tree
#67
Rank
#68
Rank
#69
Rank
#975EasyFrequency: 73%High Priority
Range Sum of BST
#70
Rank
#71
Rank
#329HardFrequency: 73%High Priority
Longest Increasing Path in a Matrix
#72
Rank
#73
Rank
#1397MediumFrequency: 73%High Priority
Search Suggestions System
#74
Rank
#75
Rank
#1915EasyFrequency: 73%High Priority
Check if One String Swap Can Make Strings Equal
#76
Rank
#778MediumFrequency: 72%High Priority
Reorganize String
#77
Rank
#3710HardFrequency: 72%High Priority
Design an Array Statistics Tracker
#78
Rank
#23HardFrequency: 72%High Priority
Merge k Sorted Lists
#79
Rank
#80
Rank
#81
Rank
#139MediumFrequency: 72%High Priority
Word Break
#82
Rank
#1929MediumFrequency: 72%High Priority
Maximum Value at a Given Index in a Bounded Array
#83
Rank
#235MediumFrequency: 72%High Priority
Lowest Common Ancestor of a Binary Search Tree
#84
Rank
#277MediumFrequency: 72%High Priority
Find the Celebrity
#85
Rank
#381HardFrequency: 72%High Priority
Insert Delete GetRandom O(1) - Duplicates allowed
#86
Rank
#87
Rank
#88
Rank
#89
Rank
#90
Rank
#121EasyFrequency: 69%High Priority
Best Time to Buy and Sell Stock
#91
Rank
#1108MediumFrequency: 69%High Priority
Analyze User Website Visit Pattern
#92
Rank
#93
Rank
#94
Rank
#129MediumFrequency: 68%High Priority
Sum Root to Leaf Numbers
#95
Rank
#1014MediumFrequency: 68%High Priority
K Closest Points to Origin
#96
Rank
#4HardFrequency: 67%High Priority
Median of Two Sorted Arrays
#97
Rank
#1085MediumFrequency: 67%High Priority
The Earliest Moment When Everyone Become Friends
#98
Rank
#99
Rank
#3647MediumFrequency: 67%High Priority
Zero Array Transformation III
#100
Rank
Other Collections
Most Frequent Interview Questions
The top 50 most frequently asked coding interview questions across all major tech companies.
50 problems →
Beginner-Friendly Interview Questions
Easy to medium difficulty problems perfect for interview preparation beginners.
75 problems →
Advanced Interview Problems
Challenging hard problems asked at top-tier tech companies for senior positions.
50 problems →
Quick Interview Prep - 25 Essential Problems
Curated list of 25 must-know problems for last-minute interview preparation.
25 problems →
System Design Interview Prep
Coding problems that help build system design thinking and scalability concepts.
60 problems →
Turn Practice into Success
You've practiced with our top 100 interview questions. Now get AI assistance during your real interviews to solve these problems live and land your dream job.
Solve problems instantly
Boost confidence
Land your dream job