Stack Interview Questions
Master 161 stack problems frequently asked in technical interviews. These questions test your understanding of stackconcepts and are essential for coding interview success.
161
Total Problems
23
Easy
93
Medium
45
Hard
#1
Rank
#716HardFrequency: 100%
Max Stack
#2
Rank
#364MediumFrequency: 95.4%
Nested List Weight Sum II
#3
Rank
#4
Rank
#42HardFrequency: 88%
Trapping Rain Water
#5
Rank
#6
Rank
#7
Rank
#8
Rank
#2147HardFrequency: 76.6%
The Score of Students Solving Math Expression
#9
Rank
#2667HardFrequency: 76%
Maximum Frequency Score of a Subarray
#10
Rank
#11
Rank
#957MediumFrequency: 71.8%
Minimum Add to Make Parentheses Valid
#12
Rank
#2419HardFrequency: 69.8%
Subarray With Elements Greater Than Varying Threshold
#13
Rank
#3181HardFrequency: 69.8%
Find Building Where Alice and Bob Can Meet
#14
Rank
#84HardFrequency: 69.6%
Largest Rectangle in Histogram
#15
Rank
#16
Rank
#17
Rank
#18
Rank
#758MediumFrequency: 63.7%
Convert Binary Search Tree to Sorted Doubly Linked List
#19
Rank
#20
Rank
#678MediumFrequency: 63.4%
Valid Parenthesis String
#21
Rank
#1570EasyFrequency: 63.1%
Final Prices With a Special Discount in a Shop
#22
Rank
#1219MediumFrequency: 62.5%
Longest Well-Performing Interval
#23
Rank
#24
Rank
#25
Rank
#26
Rank
#272HardFrequency: 61.6%
Closest Binary Search Tree Value II
#27
Rank
#28
Rank
#173MediumFrequency: 60.9%
Binary Search Tree Iterator
#29
Rank
#321HardFrequency: 59.8%
Create Maximum Number
#30
Rank
#1298MediumFrequency: 59.8%
Reverse Substrings Between Each Pair of Parentheses
#31
Rank
#943MediumFrequency: 59.8%
Sum of Subarray Minimums
#32
Rank
#33
Rank
#34
Rank
#35
Rank
#1633HardFrequency: 56.5%
Minimum Number of Increments on Subarrays to Form a Target Array
#36
Rank
#37
Rank
#38
Rank
#39
Rank
#40
Rank
#41
Rank
#42
Rank
#1305HardFrequency: 52.9%
Number of Visible People in a Queue
#43
Rank
#32HardFrequency: 51.7%
Longest Valid Parentheses
#44
Rank
#456MediumFrequency: 51.3%
132 Pattern
#45
Rank
#85HardFrequency: 51.1%
Maximal Rectangle
#46
Rank
#341MediumFrequency: 51%
Flatten Nested List Iterator
#47
Rank
#48
Rank
#1985MediumFrequency: 49.9%
Maximum Subarray Min-Product
#49
Rank
#50
Rank
#536MediumFrequency: 47.5%
Construct Binary Tree from String
#51
Rank
#2425MediumFrequency: 47.5%
Number of People That Can Be Seen in a Grid
#52
Rank
#53
Rank
#54
Rank
#55
Rank
#94EasyFrequency: 44.2%
Binary Tree Inorder Traversal
#56
Rank
#581MediumFrequency: 44%
Shortest Unsorted Continuous Subarray
#57
Rank
#58
Rank
#59
Rank
#255MediumFrequency: 41.2%
Verify Preorder Sequence in Binary Search Tree
#60
Rank
#2095MediumFrequency: 40.9%
Minimum Number of Swaps to Make the String Balanced
#61
Rank
#114MediumFrequency: 40.5%
Flatten Binary Tree to Linked List
#62
Rank
#2368HardFrequency: 40.2%
Sum of Total Strength of Wizards
#63
Rank
#64
Rank
#65
Rank
#66
Rank
#67
Rank
#1050MediumFrequency: 37.4%
Construct Binary Search Tree from Preorder Traversal
#68
Rank
#1756MediumFrequency: 37%
Minimum Deletions to Make String Balanced
#69
Rank
#1017HardFrequency: 35.8%
Odd Even Jump
#70
Rank
#2520MediumFrequency: 35.6%
Using a Robot to Print the Lexicographically Smallest String
#71
Rank
#1159MediumFrequency: 35.1%
Smallest Subsequence of Distinct Characters
#72
Rank
#1076MediumFrequency: 35%
Brace Expansion
#73
Rank
#74
Rank
#75
Rank
#2307HardFrequency: 33.5%
Replace Non-Coprime Numbers in Array
#76
Rank
#77
Rank
#1072MediumFrequency: 32.8%
Next Greater Node In Linked List
#78
Rank
#79
Rank
#80
Rank
#81
Rank
#82
Rank
#2021MediumFrequency: 31.3%
Remove All Occurrences of a Substring
#83
Rank
#1802EasyFrequency: 31.1%
Number of Students Unable to Eat Lunch
#84
Rank
#1582MediumFrequency: 29.5%
Design Browser History
#85
Rank
#86
Rank
#87
Rank
#3454HardFrequency: 29.3%
Minimum Operations to Make Array Equal to Target
#88
Rank
#2490HardFrequency: 29.1%
Maximum Number of Books You Can Take
#89
Rank
#780MediumFrequency: 28.1%
Max Chunks To Make Sorted
#90
Rank
#2389HardFrequency: 28.1%
Design a Text Editor
#91
Rank
#92
Rank
#1768MediumFrequency: 27.8%
Design an Expression Tree With Evaluate Function
#93
Rank
#2456MediumFrequency: 27.8%
Construct Smallest Number From DI String
#94
Rank
#2111MediumFrequency: 27.8%
Binary Searchable Numbers in an Unsorted Array
#95
Rank
#779HardFrequency: 27.7%
Max Chunks To Make Sorted II
#96
Rank
#2485MediumFrequency: 27.7%
Finding the Number of Visible Mountains
#97
Rank
#3445MediumFrequency: 27.7%
Lexicographically Minimum String After Removing Stars
#98
Rank
#99
Rank
#654MediumFrequency: 27.3%
Maximum Binary Tree
#100
Rank
#1355MediumFrequency: 27.3%
Minimum Deletions to Make Array Beautiful
#101
Rank
#4222HardFrequency: 27.3%
Count Good Subarrays
#102
Rank
#144EasyFrequency: 27.2%
Binary Tree Preorder Traversal
#103
Rank
#104
Rank
#1737EasyFrequency: 26.7%
Maximum Nesting Depth of the Parentheses
#105
Rank
#1679MediumFrequency: 26.5%
Shortest Subarray to be Removed to Make Array Sorted
#106
Rank
#1628MediumFrequency: 26.3%
Count Submatrices With All Ones
#107
Rank
#108
Rank
#109
Rank
#110
Rank
#1792MediumFrequency: 25.4%
Find the Most Competitive Subsequence
#111
Rank
#2236MediumFrequency: 25.1%
Maximum Twin Sum of a Linked List
#112
Rank
#1729MediumFrequency: 25.1%
Binary Search Tree Iterator II
#113
Rank
#3211HardFrequency: 24.6%
Find Maximum Non-decreasing Array Length
#114
Rank
#3674HardFrequency: 24.4%
Count Non-Decreasing Subarrays After K Operations
#115
Rank
#1150MediumFrequency: 23.6%
Two Sum BSTs
#116
Rank
#2573MediumFrequency: 23.6%
Remove Nodes From Linked List
#117
Rank
#118
Rank
#119
Rank
#2374MediumFrequency: 21.5%
Steps to Make Array Non-decreasing
#120
Rank
#145EasyFrequency: 20.9%
Binary Tree Postorder Traversal
#121
Rank
#331MediumFrequency: 20.9%
Verify Preorder Serialization of a Binary Tree
#122
Rank
#1918HardFrequency: 20.9%
Maximum Score of a Good Subarray
#123
Rank
#2123MediumFrequency: 20.9%
The Number of Weak Characters in the Game
#124
Rank
#1902HardFrequency: 20.9%
Car Fleet II
#125
Rank
#1736HardFrequency: 20%
Build Binary Expression Tree From Infix Expression
#126
Rank
#2056MediumFrequency: 20%
Jump Game VIII
#127
Rank
#2072MediumFrequency: 20%
Maximum of Minimum Values in All Subarrays
#128
Rank
#2871MediumFrequency: 20%
Double a Number Represented as a Linked List
#129
Rank
#3088MediumFrequency: 20%
Maximal Range That Each Element Is Maximum in It
#130
Rank
#3382HardFrequency: 20%
Find the Number of Subarrays Where Boundary Elements Are Maximum
#131
Rank
#1188HardFrequency: 18%
Brace Expansion II
#132
Rank
#3158MediumFrequency: 18%
Maximum Length of Semi-Decreasing Subarrays
#133
Rank
#2221MediumFrequency: 17%
Check if a Parentheses String Can Be Valid
#134
Rank
#135
Rank
#2008HardFrequency: 16.4%
Minimum Cost to Change the Final Value of Expression
#136
Rank
#3954MediumFrequency: 15.7%
Maximum Balanced Shipments
#137
Rank
#138
Rank
#1648MediumFrequency: 11.4%
Minimum Insertions to Balance a Parentheses String
#139
Rank
#140
Rank
#933EasyFrequency: 10.5%
Increasing Order Search Tree
#141
Rank
#1228MediumFrequency: 10.5%
Minimum Cost Tree From Leaf Values
#142
Rank
#2800EasyFrequency: 10.5%
Minimum String Length After Removing Substrings
#143
Rank
#3001HardFrequency: 10.5%
Apply Operations to Maximize Score
#144
Rank
#3834MediumFrequency: 10.5%
Minimum Operations to Convert All Elements to Zero
#145
Rank
#146
Rank
#147
Rank
#148
Rank
#1208MediumFrequency: 8.1%
Maximum Nesting Depth of Two Valid Parentheses Strings
#149
Rank
#150
Rank
#151
Rank
#2736MediumFrequency: 7.3%
Minimum Additions to Make Valid String
#152
Rank
#1270HardFrequency: 7.2%
Dinner Plate Stacks
#153
Rank
#154
Rank
#155
Rank
#488HardFrequency: 5.5%
Zuma Game
#156
Rank
#2657HardFrequency: 5%
Minimum Time to Complete All Tasks
#157
Rank
#158
Rank
#4140HardFrequency: 5%
Evaluate Valid Expressions
#159
Rank
#4086HardFrequency: 5%
Lexicographically Smallest String After Deleting Duplicate Characters
#160
Rank
#2549HardFrequency: 5%
Next Greater Element IV
#161
Rank
Master Stack in Real Interviews
Get AI-powered assistance when solving stack problems during your actual interviews.
Get Started FreeNo credit card required