Question Bank

Top 100

The most frequently asked interview problems at top tech companies. Curated and categorized.

100 problems16 Easy·63 Medium·21 Hard
Q001
Two SumArrays & Hashing
Easy
Q002
Add Two NumbersLinked Lists
Medium
Q003
Longest Substring Without Repeating CharactersSliding Window
Medium
Q004
Median of Two Sorted ArraysBinary Search
Hard
Q005
Longest Palindromic SubstringStrings
Medium
Q006
Reverse IntegerMath
Medium
Q007
String to Integer (atoi)Strings
Medium
Q008
Palindrome NumberMath
Easy
Q009
Regular Expression MatchingDynamic Programming
Hard
Q010
Container With Most WaterTwo Pointers
Medium
Q011
3SumTwo Pointers
Medium
Q012
Letter Combinations of a Phone NumberBacktracking
Medium
Q013
Generate ParenthesesBacktracking
Medium
Q014
Merge K Sorted ListsLinked Lists
Hard
Q015
Valid ParenthesesStack
Easy
Q016
Merge Two Sorted ListsLinked Lists
Easy
Q017
Best Time to Buy and Sell StockDynamic Programming
Easy
Q018
Climbing StairsDynamic Programming
Easy
Q019
Maximum SubarrayDynamic Programming
Medium
Q020
Jump GameGreedy
Medium
Q021
Merge IntervalsIntervals
Medium
Q022
Unique PathsDynamic Programming
Medium
Q023
Minimum Path SumDynamic Programming
Medium
Q024
Sort ColorsTwo Pointers
Medium
Q025
SubsetsBacktracking
Medium
Q026
Word SearchBacktracking
Medium
Q027
CandyGreedy
Hard
Q028
Trapping Rain WaterTwo Pointers
Hard
Q029
Binary Tree Maximum Path SumTrees
Hard
Q030
Serialize and Deserialize Binary TreeTrees
Hard
Q031
Valid Binary Search TreeTrees
Medium
Q032
Lowest Common Ancestor of a Binary TreeTrees
Medium
Q033
Binary Tree Level Order TraversalTrees
Medium
Q034
Convert Sorted Array to Binary Search TreeTrees
Easy
Q035
Maximum Depth of Binary TreeTrees
Easy
Q036
Invert Binary TreeTrees
Easy
Q037
Same TreeTrees
Easy
Q038
Number of IslandsGraphs
Medium
Q039
Clone GraphGraphs
Medium
Q040
Course ScheduleGraphs
Medium
Q041
Pacific Atlantic Water FlowGraphs
Medium
Q042
Word LadderGraphs
Hard
Q043
Implement Trie (Prefix Tree)Trie
Medium
Q044
Design Add and Search Words Data StructureTrie
Medium
Q045
Word Search IITrie
Hard
Q046
Top K Frequent ElementsHeap
Medium
Q047
Find Median from Data StreamHeap
Hard
Q048
Task SchedulerHeap
Medium
Q049
LRU CacheDesign
Medium
Q050
Min StackStack
Medium
Q051
Evaluate Reverse Polish NotationStack
Medium
Q052
Daily TemperaturesStack
Medium
Q053
Car FleetStack
Medium
Q054
Largest Rectangle in HistogramStack
Hard
Q055
Sliding Window MaximumSliding Window
Hard
Q056
Minimum Window SubstringSliding Window
Hard
Q057
Longest Repeating Character ReplacementSliding Window
Medium
Q058
Permutation in StringSliding Window
Medium
Q059
Best Time to Buy and Sell Stock with CooldownDynamic Programming
Medium
Q060
Coin ChangeDynamic Programming
Medium
Q061
Longest Increasing SubsequenceDynamic Programming
Medium
Q062
Word BreakDynamic Programming
Medium
Q063
House RobberDynamic Programming
Medium
Q064
Unique Binary Search TreesDynamic Programming
Medium
Q065
Decode WaysDynamic Programming
Medium
Q066
Longest Common SubsequenceDynamic Programming
Medium
Q067
Edit DistanceDynamic Programming
Medium
Q068
Interleaving StringDynamic Programming
Hard
Q069
Burst BalloonsDynamic Programming
Hard
Q070
Longest Valid ParenthesesDynamic Programming
Hard
Q071
Median of a Sorted MatrixBinary Search
Hard
Q072
Koko Eating BananasBinary Search
Medium
Q073
Search in Rotated Sorted ArrayBinary Search
Medium
Q074
Find Minimum in Rotated Sorted ArrayBinary Search
Medium
Q075
Time Based Key-Value StoreBinary Search
Medium
Q076
Design TwitterDesign
Medium
Q077
Design Underground SystemDesign
Medium
Q078
Snapshot ArrayDesign
Medium
Q079
All O'one Data StructureDesign
Hard
Q080
LRU Cache Doubly Linked ListLinked Lists
Medium
Q081
Reverse Nodes in k-GroupLinked Lists
Hard
Q082
Swap Nodes in PairsLinked Lists
Medium
Q083
Rotate ListLinked Lists
Medium
Q084
Remove Nth Node From End of ListLinked Lists
Medium
Q085
Reorder ListLinked Lists
Medium
Q086
Palindrome Linked ListLinked Lists
Easy
Q087
Missing NumberMath
Easy
Q088
Counting BitsBit Manipulation
Easy
Q089
Sum of Two IntegersBit Manipulation
Medium
Q090
Reverse BitsBit Manipulation
Easy
Q091
Single NumberBit Manipulation
Easy
Q092
Number of 1 BitsBit Manipulation
Easy
Q093
Alien DictionaryGraphs
Hard
Q094
Graph Valid TreeGraphs
Medium
Q095
Number of Connected ComponentsGraphs
Medium
Q096
Rotting OrangesGraphs
Medium
Q097
Redundant ConnectionGraphs
Medium
Q098
Accounts MergeGraphs
Medium
Q099
Is Graph BipartiteGraphs
Medium
Q100
Longest Increasing Path in a MatrixGraphs
Hard