Heap Priority Queue Interview Questions

Array Queue Sliding Window Heap (Priority Queue)Ordered Set Monotonic Queue

Rank

#215MediumFrequency: 93.3%

Kth Largest Element in an Array

Array Divide and Conquer Sorting Heap (Priority Queue)Quickselect

Rank

#253MediumFrequency: 83.8%

Meeting Rooms II

Array Two Pointers Greedy Sorting Heap (Priority Queue)Prefix Sum

Rank

#1397MediumFrequency: 82.5%

Search Suggestions System

Array String Binary Search Trie Sorting Heap (Priority Queue)

Rank

#347MediumFrequency: 81.3%

Top K Frequent Elements

Array Hash Table Divide and Conquer Sorting Heap (Priority Queue)Bucket Sort Counting Quickselect

Rank

#2023HardFrequency: 79.4%

Design Movie Rental System

Array Hash Table Design Heap (Priority Queue)Ordered Set

Rank

#778MediumFrequency: 78.3%

Reorganize String

Hash Table String Greedy Sorting Heap (Priority Queue)Counting

Rank

#1014MediumFrequency: 77.1%

K Closest Points to Origin

Array Math Divide and Conquer Geometry Sorting Heap (Priority Queue)Quickselect K-D Tree

Rank

#2230MediumFrequency: 76.6%

Minimum Cost to Reach City With Discounts

Graph Theory Heap (Priority Queue)Shortest Path Dijkstra's Algorithm

Rank

#23HardFrequency: 75.1%

Merge k Sorted Lists

Linked List Divide and Conquer Heap (Priority Queue)Merge Sort Tournament Sort

#10

Rank

#1962MediumFrequency: 74.6%

Single-Threaded CPU

#11

Rank

#239HardFrequency: 74.4%

Sliding Window Maximum

Array Queue Sliding Window Heap (Priority Queue)Monotonic Queue Range Minimum/Maximum Query

#12

Rank

#3181HardFrequency: 69.8%

Find Building Where Alice and Bob Can Meet

Array Binary Search Stack Binary Indexed Tree Segment Tree Heap (Priority Queue)Monotonic Stack

#13

Rank

#761HardFrequency: 67.9%

Employee Free Time

Array Sweep Line Sorting Heap (Priority Queue)

#14

Rank

#1304MediumFrequency: 66.8%

Longest Happy String

#15

Rank

#295HardFrequency: 66.4%

Find Median from Data Stream

Two Pointers Design Sorting Heap (Priority Queue)Data Stream

#16

Rank

#803MediumFrequency: 65.5%

Cheapest Flights Within K Stops

Dynamic Programming Depth-First Search Breadth-First Search Graph Theory Heap (Priority Queue)Shortest Path

#17

Rank

#3627MediumFrequency: 65.4%

Find Minimum Time to Reach Last Room I

Array Graph Theory Heap (Priority Queue)Matrix Shortest Path

#18

Rank

#3863MediumFrequency: 64.9%

Power Grid Maintenance

Array Hash Table Depth-First Search Breadth-First Search Union-Find Graph Theory Heap (Priority Queue)Ordered Set

#19

Rank

#658MediumFrequency: 64.6%

Find K Closest Elements

Array Two Pointers Binary Search Sliding Window Sorting Heap (Priority Queue)

#20

Rank

#621MediumFrequency: 63.1%

Task Scheduler

Array Hash Table Greedy Sorting Heap (Priority Queue)Counting

#21

Rank

#2329MediumFrequency: 62.5%

Maximum Product After K Increments

#22

Rank

#1478MediumFrequency: 62.2%

Maximum Number of Events That Can Be Attended

#23

Rank

#1127EasyFrequency: 62.2%

Last Stone Weight

#24

Rank

#272HardFrequency: 61.6%

Closest Binary Search Tree Value II

Two Pointers Stack Tree Depth-First Search Binary Search Tree Heap (Priority Queue)Binary Tree

#25

Rank

#2479HardFrequency: 61.4%

Meeting Rooms III

Array Hash Table Sorting Heap (Priority Queue)Simulation

#26

Rank

#675HardFrequency: 59.8%

Cut Off Trees for Golf Event

Array Breadth-First Search Heap (Priority Queue)Matrix

#27

Rank

#692MediumFrequency: 59.1%

Top K Frequent Words

Array Hash Table String Trie Sorting Heap (Priority Queue)Bucket Sort Counting

#28

Rank

#480HardFrequency: 57.6%

Sliding Window Median

Array Hash Table Sliding Window Heap (Priority Queue)Treap

#29

Rank

#378MediumFrequency: 55.9%

Kth Smallest Element in a Sorted Matrix

Array Binary Search Sorting Heap (Priority Queue)Matrix

#30

Rank

#885MediumFrequency: 55.1%

Exam Room

Design Heap (Priority Queue)Ordered Set

#31

Rank

#2543MediumFrequency: 54.4%

Most Popular Video Creator

Array Hash Table String Sorting Heap (Priority Queue)

#32

Rank

#505MediumFrequency: 54.1%

The Maze II

Array Depth-First Search Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Shortest Path Dijkstra's Algorithm Heuristic Search A* Search

#33

Rank

#1710HardFrequency: 53.1%

Find Servers That Handled Most Number of Requests

Array Heap (Priority Queue)Simulation Ordered Set

#34

Rank

#632HardFrequency: 52.9%

Smallest Range Covering Elements from K Lists

Array Hash Table Greedy Sliding Window Sorting Heap (Priority Queue)

#35

Rank

#407HardFrequency: 52.9%

Trapping Rain Water II

Array Breadth-First Search Heap (Priority Queue)Matrix

#36

Rank

#373MediumFrequency: 52.2%

Find K Pairs with Smallest Sums

#37

Rank

#3628MediumFrequency: 52.1%

Find Minimum Time to Reach Last Room II

Array Graph Theory Heap (Priority Queue)Matrix Shortest Path

#38

Rank

#2725MediumFrequency: 51.3%

Mice and Cheese

#39

Rank

#1824MediumFrequency: 47.5%

Maximum Number of Eaten Apples

#40

Rank

#2418MediumFrequency: 47.5%

Minimum Sum of Squared Difference

Array Binary Search Greedy Sorting Heap (Priority Queue)

#41

Rank

#948MediumFrequency: 46.7%

Sort an Array

Array Divide and Conquer Sorting Heap (Priority Queue)Merge Sort Bucket Sort Radix Sort Counting Sort

#42

Rank

#2436EasyFrequency: 46.5%

Make Array Zero by Subtracting Equal Amounts

Array Hash Table Greedy Sorting Heap (Priority Queue)Simulation

#43

Rank

#1539MediumFrequency: 46.5%

Diagonal Traverse II

#44

Rank

#1485HardFrequency: 44.8%

Minimum Cost to Make at Least One Valid Path in a Grid

Array Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Shortest Path 0-1 BFS Dijkstra's Algorithm

#45

Rank

#2423HardFrequency: 44.7%

Minimum Deletions to Make Array Divisible

Array Math Sorting Heap (Priority Queue)Number Theory Euclidean Algorithm Greatest Common Divisor

#46

Rank

#2642HardFrequency: 44.7%

Time to Cross a Bridge

#47

Rank

#1184MediumFrequency: 43.2%

Car Pooling

Array Sorting Heap (Priority Queue)Simulation Prefix Sum

#48

Rank

#1499HardFrequency: 43.2%

Maximum Performance of a Team

#49

Rank

#332HardFrequency: 43.2%

Reconstruct Itinerary

Array String Depth-First Search Graph Theory Sorting Heap (Priority Queue)Eulerian Circuit Eulerian Path Semi-Eulerian Graph

#50

Rank

#451MediumFrequency: 43.2%

Sort Characters By Frequency

Hash Table String Sorting Heap (Priority Queue)Bucket Sort Counting

#51

Rank

#2914MediumFrequency: 41.6%

Find the Safest Path in a Grid

Array Binary Search Breadth-First Search Union-Find Heap (Priority Queue)Matrix

#52

Rank

#2327EasyFrequency: 41.2%

Largest Number After Digit Swaps by Parity

Sorting Heap (Priority Queue)

#53

Rank

#744MediumFrequency: 41.2%

Network Delay Time

Depth-First Search Breadth-First Search Graph Theory Heap (Priority Queue)Shortest Path Dijkstra's Algorithm

#54

Rank

#355MediumFrequency: 41.2%

Design Twitter

Hash Table Linked List Design Heap (Priority Queue)

#55

Rank

#789EasyFrequency: 40.8%

Kth Largest Element in a Stream

Tree Design Binary Search Tree Heap (Priority Queue)Binary Tree Data Stream

#56

Rank

#1762MediumFrequency: 40.8%

Furthest Building You Can Reach

#57

Rank

#2267HardFrequency: 40.2%

Minimum Difference in Sums After Removal of Elements

Array Dynamic Programming Heap (Priority Queue)

#58

Rank

#794HardFrequency: 40%

Swim in Rising Water

Array Binary Search Depth-First Search Breadth-First Search Union-Find Minimax Heap (Priority Queue)Matrix Dijkstra's Algorithm

#59

Rank

#1953HardFrequency: 39.5%

Finding MK Average

Design Queue Heap (Priority Queue)Data Stream Ordered Set Treap

#60

Rank

#642HardFrequency: 39.1%

Design Search Autocomplete System

String Depth-First Search Design Trie Sorting Heap (Priority Queue)Data Stream

#61

Rank

#218HardFrequency: 37.9%

The Skyline Problem

Array Divide and Conquer Binary Indexed Tree Segment Tree Sweep Line Sorting Heap (Priority Queue)Ordered Set

#62

Rank

#2588HardFrequency: 37.9%

Maximum Number of Points From Grid Queries

Array Two Pointers Breadth-First Search Union-Find Sorting Heap (Priority Queue)Matrix

#63

Rank

#902HardFrequency: 37.9%

Minimum Number of Refueling Stops

Array Dynamic Programming Greedy Heap (Priority Queue)

#64

Rank

#1753MediumFrequency: 37.3%

Path With Minimum Effort

Array Binary Search Depth-First Search Breadth-First Search Union-Find Heap (Priority Queue)Matrix Dijkstra's Algorithm

#65

Rank

#2094MediumFrequency: 35.6%

Remove Stones to Minimize the Total

#66

Rank

#2681HardFrequency: 33.3%

Put Marbles in Bags

#67

Rank

#3610EasyFrequency: 33.1%

Find X-Sum of All K-Long Subarrays I

Array Hash Table Sliding Window Heap (Priority Queue)

#68

Rank

#3655MediumFrequency: 32.8%

Digit Operations to Make Two Integers Equal

Math Graph Theory Heap (Priority Queue)Number Theory Shortest Path

#69

Rank

#1771MediumFrequency: 32.3%

Sell Diminishing-Valued Colored Balls

Array Math Binary Search Greedy Sorting Heap (Priority Queue)

#70

Rank

#2012MediumFrequency: 32.1%

Process Tasks Using Servers

#71

Rank

#2321HardFrequency: 31.8%

Minimum Weighted Subgraph With the Required Paths

#72

Rank

#2868MediumFrequency: 31.8%

Continuous Subarrays

Array Queue Sliding Window Heap (Priority Queue)Ordered Set Monotonic Queue

#73

Rank

#502HardFrequency: 31.1%

IPO

#74

Rank

#2434MediumFrequency: 30.4%

Design a Number Container System

#75

Rank

#1977HardFrequency: 30.4%

Minimum Interval to Include Each Query

Array Binary Search Sweep Line Sorting Heap (Priority Queue)

#76

Rank

#1917MediumFrequency: 30.2%

Maximum Average Pass Ratio

#77

Rank

#3678MediumFrequency: 29.5%

Design Task Manager

#78

Rank

#892HardFrequency: 29.1%

Shortest Subarray with Sum at Least K

Array Binary Search Queue Sliding Window Heap (Priority Queue)Prefix Sum Monotonic Queue

#79

Rank

#2473MediumFrequency: 29.1%

Max Sum of a Pair With Equal Sum of Digits

#80

Rank

#3764MediumFrequency: 29.1%

Maximum Sum With at Most K Elements

#81

Rank

#3647MediumFrequency: 28.1%

Zero Array Transformation III

Array Two Pointers Greedy Sorting Heap (Priority Queue)Prefix Sum

#82

Rank

#2054MediumFrequency: 27.8%

The Number of the Smallest Unoccupied Chair

Array Hash Table Heap (Priority Queue)

#83

Rank

#630HardFrequency: 27.7%

Course Schedule III

#84

Rank

#3445MediumFrequency: 27.7%

Lexicographically Minimum String After Removing Stars

Hash Table String Stack Greedy Heap (Priority Queue)

#85

Rank

#2142MediumFrequency: 27.3%

Average Height of Buildings in Each Segment

Array Sorting Heap (Priority Queue)Prefix Sum

#86

Rank

#2310MediumFrequency: 27.3%

Minimum Operations to Halve Array Sum

#87

Rank

#2674MediumFrequency: 27.3%

Make the Prefix Sum Non-negative

#88

Rank

#3386HardFrequency: 27.3%

Find Edges in Shortest Paths

Depth-First Search Breadth-First Search Graph Theory Heap (Priority Queue)Shortest Path

#89

Rank

#1959MediumFrequency: 26.7%

Minimum Path Cost in a Hidden Grid

Array Depth-First Search Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Interactive Shortest Path

#90

Rank

#2413MediumFrequency: 26.5%

Smallest Number in Infinite Set

#91

Rank

#2449HardFrequency: 26.5%

Maximum Number of Robots Within Budget

Array Binary Search Queue Sliding Window Heap (Priority Queue)Prefix Sum Monotonic Queue

#92

Rank

#2462HardFrequency: 26.5%

Find the K-Sum of an Array

#93

Rank

#3959MediumFrequency: 26.5%

Maximum Total from Optimal Activation Order

Array Two Pointers Greedy Sorting Heap (Priority Queue)

#94

Rank

#2161MediumFrequency: 25.4%

Stock Price Fluctuation

Hash Table Design Heap (Priority Queue)Data Stream Ordered Set

#95

Rank

#506EasyFrequency: 25.4%

Relative Ranks

#96

Rank

#1325MediumFrequency: 25.4%

Path with Maximum Probability

Array Graph Theory Heap (Priority Queue)Shortest Path Dijkstra's Algorithm

#97

Rank

#1099MediumFrequency: 25.4%

Path With Maximum Minimum Value

Array Binary Search Depth-First Search Breadth-First Search Union-Find Heap (Priority Queue)Matrix Dijkstra's Algorithm

#98

Rank

#3887MediumFrequency: 25.3%

Minimum Cost Path with Edge Reversals

#99

Rank

#1612MediumFrequency: 25.3%

Avoid Flood in The City

Array Hash Table Binary Search Greedy Heap (Priority Queue)

#100

Rank

#1052MediumFrequency: 25.3%

Campus Bikes

#101

Rank

#3710HardFrequency: 25.1%

Design an Array Statistics Tracker

Hash Table Binary Search Design Queue Heap (Priority Queue)Data Stream Ordered Set

#102

Rank

#3894MediumFrequency: 25.1%

Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values

Array Hash Table Greedy Sorting Heap (Priority Queue)

#103

Rank

#264MediumFrequency: 25%

Ugly Number II

Hash Table Math Dynamic Programming Heap (Priority Queue)

#104

Rank

#358HardFrequency: 24.6%

Rearrange String k Distance Apart

Hash Table String Greedy Sorting Heap (Priority Queue)Counting

#105

Rank

#2616MediumFrequency: 24.6%

Maximal Score After Applying K Operations

#106

Rank

#3107HardFrequency: 24.6%

Maximum Spending After Buying Items

#107

Rank

#1574EasyFrequency: 24.4%

Maximum Product of Two Elements in an Array

#108

Rank

#3773EasyFrequency: 24.4%

Minimum Pair Removal to Sort Array I

Array Hash Table Linked List Heap (Priority Queue)Simulation Doubly-Linked List Ordered Set

#109

Rank

#1074EasyFrequency: 23.6%

High Five

#110

Rank

#1140MediumFrequency: 23.6%

Distant Barcodes

Array Hash Table Greedy Sorting Heap (Priority Queue)Counting

#111

Rank

#1463EasyFrequency: 23.6%

The K Weakest Rows in a Matrix

Array Binary Search Sorting Heap (Priority Queue)Matrix

#112

Rank

#2429MediumFrequency: 23.6%

Design a Food Rating System

Array Hash Table String Design Heap (Priority Queue)Ordered Set

#113

Rank

#3363MediumFrequency: 23.6%

Most Frequent IDs

Array Hash Table Heap (Priority Queue)Ordered Set

#114

Rank

#2164MediumFrequency: 23.6%

Two Best Non-Overlapping Events

Array Binary Search Dynamic Programming Sorting Heap (Priority Queue)

#115

Rank

#1550HardFrequency: 23.4%

Find the Kth Smallest Sum of a Matrix With Sorted Rows

Array Binary Search Heap (Priority Queue)Matrix

#116

Rank

#2375HardFrequency: 23.3%

Minimum Obstacle Removal to Reach Corner

Array Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Shortest Path 0-1 BFS Dijkstra's Algorithm

#117

Rank

#1144HardFrequency: 22%

Optimize Water Distribution in a Village

Union-Find Graph Theory Heap (Priority Queue)Minimum Spanning Tree Prim's Algorithm Kruskal's Algorithm Borůvka's Algorithm

#118

Rank

#2590MediumFrequency: 21.9%

Maximum Star Sum of a Graph

Array Greedy Graph Theory Sorting Heap (Priority Queue)

#119

Rank

#3218HardFrequency: 21.9%

Find Number of Coins to Place in Tree Nodes

Dynamic Programming Tree Depth-First Search Sorting Heap (Priority Queue)DP on Trees

#120

Rank

#3354MediumFrequency: 21.9%

Replace Question Marks in String to Minimize Its Value

Hash Table String Greedy Sorting Heap (Priority Queue)Counting

#121

Rank

#2204EasyFrequency: 21.5%

Find Subsequence of Length K With the Largest Sum

#122

Rank

#1912MediumFrequency: 20.9%

Number of Restricted Paths From First to Last Node

Dynamic Programming Graph Theory Topological Sort Heap (Priority Queue)Shortest Path Dijkstra's Algorithm

#123

Rank

#1902HardFrequency: 20.9%

Car Fleet II

Array Math Stack Heap (Priority Queue)Monotonic Stack

#124

Rank

#1990MediumFrequency: 20.3%

Get Biggest Three Rhombus Sums in a Grid

Array Math Sorting Heap (Priority Queue)Matrix Prefix Sum

#125

Rank

#1100MediumFrequency: 20%

Connecting Cities With Minimum Cost

Union-Find Graph Theory Heap (Priority Queue)Minimum Spanning Tree

#126

Rank

#1126MediumFrequency: 20%

Minimum Cost to Connect Sticks

#127

Rank

#2207HardFrequency: 20%

Sequentially Ordinal Rank Tracker

Design Heap (Priority Queue)Data Stream Ordered Set

#128

Rank

#4089MediumFrequency: 20%

Maximize Points After Choosing K Tasks

#129

Rank

#4130MediumFrequency: 20%

Maximum Score After Binary Swaps

Array String Greedy Heap (Priority Queue)

#130

Rank

#1489HardFrequency: 19.5%

Pizza With 3n Slices

Array Dynamic Programming Greedy Heap (Priority Queue)

#131

Rank

#1622HardFrequency: 19.5%

Max Value of Equation

Array Queue Sliding Window Heap (Priority Queue)Monotonic Queue

#132

Rank

#2512MediumFrequency: 19.5%

Longest Uploaded Prefix

Hash Table Binary Search Union-Find Design Binary Indexed Tree Segment Tree Heap (Priority Queue)Ordered Set

#133

Rank

#659MediumFrequency: 19.5%

Split Array into Consecutive Subsequences

Array Hash Table Greedy Heap (Priority Queue)

#134

Rank

#2300MediumFrequency: 19.5%

Construct String With Repeat Limit

Hash Table String Greedy Heap (Priority Queue)Counting

#135

Rank

#683HardFrequency: 18%

K Empty Slots

Array Binary Indexed Tree Segment Tree Queue Sliding Window Heap (Priority Queue)Ordered Set Monotonic Queue

#136

Rank

#887HardFrequency: 18%

Minimum Cost to Hire K Workers

#137

Rank

#1860MediumFrequency: 18%

Find Kth Largest XOR Coordinate Value

Array Divide and Conquer Bit Manipulation Sorting Heap (Priority Queue)Matrix Prefix Sum Quickselect

#138

Rank

#3332MediumFrequency: 17%

Minimum Operations to Exceed Threshold Value II

#139

Rank

#1167HardFrequency: 16.4%

Minimum Time to Build Blocks

Array Math Greedy Heap (Priority Queue)

#140

Rank

#1865HardFrequency: 16.4%

Checking Existence of Edge Length Limited Paths II

Depth-First Search Union-Find Graph Theory Design Sorting Heap (Priority Queue)Minimum Spanning Tree

#141

Rank

#1879MediumFrequency: 16.4%

Maximum Score From Removing Stones

Math Greedy Heap (Priority Queue)

#142

Rank

#2396HardFrequency: 16.4%

Design Video Sharing Platform

Hash Table Design Heap (Priority Queue)

#143

Rank

#3970MediumFrequency: 16.4%

Power Update After K-th Largest Insertion I

Array Hash Table Math Segment Tree Sorting Heap (Priority Queue)

#144

Rank

#2636MediumFrequency: 16.1%

Maximum Subsequence Score

#145

Rank

#2711HardFrequency: 16.1%

Minimum Time to Visit a Cell In a Grid

Array Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Shortest Path

#146

Rank

#3555EasyFrequency: 16.1%

Final Array State After K Multiplication Operations I

Array Math Heap (Priority Queue)Simulation

#147

Rank

#1814MediumFrequency: 16.1%

Jump Game VI

Array Dynamic Programming Queue Heap (Priority Queue)Monotonic Queue

#148

Rank

#3226EasyFrequency: 16.1%

Minimum Number Game

Array Sorting Heap (Priority Queue)Simulation

#149

Rank

#3772HardFrequency: 15.7%

Minimum Pair Removal to Sort Array II

Array Hash Table Linked List Heap (Priority Queue)Simulation Doubly-Linked List Ordered Set

#150

Rank

#3558MediumFrequency: 14.6%

Find a Safe Walk Through a Grid

Array Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Shortest Path

#151

Rank

#2692EasyFrequency: 14.6%

Take Gifts From the Richest Pile

#152

Rank

#420HardFrequency: 12%

Strong Password Checker

#153

Rank

#2553MediumFrequency: 12%

Total Cost to Hire K Workers

Array Two Pointers Heap (Priority Queue)Simulation

#154

Rank

#2488MediumFrequency: 10.5%

Divide Intervals Into Minimum Number of Groups

Array Two Pointers Greedy Sorting Heap (Priority Queue)Prefix Sum

#155

Rank

#1389HardFrequency: 10.5%

Minimum Moves to Move a Box to Their Target Location

Array Breadth-First Search Heap (Priority Queue)Matrix

#156

Rank

#2695MediumFrequency: 10.3%

Find Score of an Array After Marking All Elements

Array Hash Table Sorting Heap (Priority Queue)Simulation

#157

Rank

#3919HardFrequency: 10.3%

Network Recovery Pathways

Array Binary Search Dynamic Programming Graph Theory Topological Sort Heap (Priority Queue)Shortest Path

#158

Rank

#1286HardFrequency: 8.1%

Constrained Subsequence Sum

Array Dynamic Programming Queue Sliding Window Heap (Priority Queue)Monotonic Queue

#159

Rank

#1955MediumFrequency: 8.1%

Seat Reservation Manager

Design Heap (Priority Queue)

#160

Rank

#3592HardFrequency: 8.1%

Find X-Sum of All K-Long Subarrays II

Array Hash Table Sliding Window Heap (Priority Queue)

#161

Rank

#4007HardFrequency: 7.3%

Maximum Total Subarray Value II

Array Greedy Segment Tree Heap (Priority Queue)

#162

Rank

#1270HardFrequency: 7.2%

Dinner Plate Stacks

Hash Table Stack Design Heap (Priority Queue)

#163

Rank

#3260HardFrequency: 7.2%

Divide an Array Into Subarrays With Minimum Cost II

Array Hash Table Sliding Window Heap (Priority Queue)

#164

Rank

#3496MediumFrequency: 7.2%

Minimum Number of Seconds to Make Mountain Height Zero

Array Math Binary Search Greedy Heap (Priority Queue)

#165

Rank

#2803HardFrequency: 5.5%

Modify Graph Edge Weights

#166

Rank

#1419HardFrequency: 5.5%

Make Array Non-decreasing or Non-increasing

Array Dynamic Programming Greedy Heap (Priority Queue)

#167

Rank

#2585EasyFrequency: 5.5%

Delete Greatest Value in Each Row

Array Sorting Heap (Priority Queue)Matrix Simulation

#168

Rank

#4067MediumFrequency: 5.5%

Design Auction System

#169

Rank

#3495MediumFrequency: 5%

K-th Nearest Obstacle Queries

#170

Rank

#2412EasyFrequency: 5%

Minimum Amount of Time to Fill Cups

#171

Rank

#499HardFrequency: 5%

The Maze III

Array String Depth-First Search Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Shortest Path Dijkstra's Algorithm Heuristic Search A* Search

#172

Rank

#3289HardFrequency: 5%

Earliest Second to Mark Indices II

Array Binary Search Greedy Heap (Priority Queue)

#173

Rank

#2113MediumFrequency: 5%

Find the Kth Largest Integer in the Array

Array String Divide and Conquer Sorting Heap (Priority Queue)Quickselect

#174

Rank

#1928MediumFrequency: 5%

Number of Orders in the Backlog

#175

Rank

#3556HardFrequency: 5%

Final Array State After K Multiplication Operations II

#176

Rank

#918HardFrequency: 5%

Reachable Nodes In Subdivided Graph

Graph Theory Heap (Priority Queue)Shortest Path Dijkstra's Algorithm

#177

Rank

#4160MediumFrequency: 5%

Maximum Sum of Three Numbers Divisible by Three

#178

Rank

#3976HardFrequency: 5%

Minimum Cost to Buy Apples II

Array Graph Theory Heap (Priority Queue)Shortest Path

#179

Rank

#1794HardFrequency: 5%

Minimize Deviation in Array

Array Greedy Heap (Priority Queue)Ordered Set

#180

Rank

#2549HardFrequency: 5%

Next Greater Element IV

Array Binary Search Stack Sorting Heap (Priority Queue)Monotonic Stack

#181

Rank

View All Topics

Master Heap Priority Queue in Real Interviews

Get AI-powered assistance when solving heap priority queue problems during your actual interviews.

Get Started Free

No credit card required

Heap Priority Queue Interview Questions

181

Total Problems

Easy

Medium

Hard

Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit

Array Queue Sliding Window Heap (Priority Queue)Ordered Set Monotonic Queue

Rank

#215MediumFrequency: 93.3%

Kth Largest Element in an Array

Array Divide and Conquer Sorting Heap (Priority Queue)Quickselect

Rank

#253MediumFrequency: 83.8%

Meeting Rooms II

Array Two Pointers Greedy Sorting Heap (Priority Queue)Prefix Sum

Rank

#1397MediumFrequency: 82.5%

Search Suggestions System

Array String Binary Search Trie Sorting Heap (Priority Queue)

Rank

#347MediumFrequency: 81.3%

Top K Frequent Elements

Array Hash Table Divide and Conquer Sorting Heap (Priority Queue)Bucket Sort Counting Quickselect

Rank

#2023HardFrequency: 79.4%

Design Movie Rental System

Array Hash Table Design Heap (Priority Queue)Ordered Set

Rank

#778MediumFrequency: 78.3%

Reorganize String

Hash Table String Greedy Sorting Heap (Priority Queue)Counting

Rank

#1014MediumFrequency: 77.1%

K Closest Points to Origin

Array Math Divide and Conquer Geometry Sorting Heap (Priority Queue)Quickselect K-D Tree

Rank

#2230MediumFrequency: 76.6%

Minimum Cost to Reach City With Discounts

Graph Theory Heap (Priority Queue)Shortest Path Dijkstra's Algorithm

Rank

#23HardFrequency: 75.1%

Merge k Sorted Lists

Linked List Divide and Conquer Heap (Priority Queue)Merge Sort Tournament Sort

#10

Rank

#1962MediumFrequency: 74.6%

Single-Threaded CPU

#11

Rank

#239HardFrequency: 74.4%

Sliding Window Maximum

Array Queue Sliding Window Heap (Priority Queue)Monotonic Queue Range Minimum/Maximum Query

#12

Rank

#3181HardFrequency: 69.8%

Find Building Where Alice and Bob Can Meet

Array Binary Search Stack Binary Indexed Tree Segment Tree Heap (Priority Queue)Monotonic Stack

#13

Rank

#761HardFrequency: 67.9%

Employee Free Time

Array Sweep Line Sorting Heap (Priority Queue)

#14

Rank

#1304MediumFrequency: 66.8%

Longest Happy String

#15

Rank

#295HardFrequency: 66.4%

Find Median from Data Stream

Two Pointers Design Sorting Heap (Priority Queue)Data Stream

#16

Rank

#803MediumFrequency: 65.5%

Cheapest Flights Within K Stops

Dynamic Programming Depth-First Search Breadth-First Search Graph Theory Heap (Priority Queue)Shortest Path

#17

Rank

#3627MediumFrequency: 65.4%

Find Minimum Time to Reach Last Room I

Array Graph Theory Heap (Priority Queue)Matrix Shortest Path

#18

Rank

#3863MediumFrequency: 64.9%

Power Grid Maintenance

Array Hash Table Depth-First Search Breadth-First Search Union-Find Graph Theory Heap (Priority Queue)Ordered Set

#19

Rank

#658MediumFrequency: 64.6%

Find K Closest Elements

Array Two Pointers Binary Search Sliding Window Sorting Heap (Priority Queue)

#20

Rank

#621MediumFrequency: 63.1%

Task Scheduler

Array Hash Table Greedy Sorting Heap (Priority Queue)Counting

#21

Rank

#2329MediumFrequency: 62.5%

Maximum Product After K Increments

#22

Rank

#1478MediumFrequency: 62.2%

Maximum Number of Events That Can Be Attended

#23

Rank

#1127EasyFrequency: 62.2%

Last Stone Weight

#24

Rank

#272HardFrequency: 61.6%

Closest Binary Search Tree Value II

Two Pointers Stack Tree Depth-First Search Binary Search Tree Heap (Priority Queue)Binary Tree

#25

Rank

#2479HardFrequency: 61.4%

Meeting Rooms III

Array Hash Table Sorting Heap (Priority Queue)Simulation

#26

Rank

#675HardFrequency: 59.8%

Cut Off Trees for Golf Event

Array Breadth-First Search Heap (Priority Queue)Matrix

#27

Rank

#692MediumFrequency: 59.1%

Top K Frequent Words

Array Hash Table String Trie Sorting Heap (Priority Queue)Bucket Sort Counting

#28

Rank

#480HardFrequency: 57.6%

Sliding Window Median

Array Hash Table Sliding Window Heap (Priority Queue)Treap

#29

Rank

#378MediumFrequency: 55.9%

Kth Smallest Element in a Sorted Matrix

Array Binary Search Sorting Heap (Priority Queue)Matrix

#30

Rank

#885MediumFrequency: 55.1%

Exam Room

Design Heap (Priority Queue)Ordered Set

#31

Rank

#2543MediumFrequency: 54.4%

Most Popular Video Creator

Array Hash Table String Sorting Heap (Priority Queue)

#32

Rank

#505MediumFrequency: 54.1%

The Maze II

Array Depth-First Search Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Shortest Path Dijkstra's Algorithm Heuristic Search A* Search

#33

Rank

#1710HardFrequency: 53.1%

Find Servers That Handled Most Number of Requests

Array Heap (Priority Queue)Simulation Ordered Set

#34

Rank

#632HardFrequency: 52.9%

Smallest Range Covering Elements from K Lists

Array Hash Table Greedy Sliding Window Sorting Heap (Priority Queue)

#35

Rank

#407HardFrequency: 52.9%

Trapping Rain Water II

Array Breadth-First Search Heap (Priority Queue)Matrix

#36

Rank

#373MediumFrequency: 52.2%

Find K Pairs with Smallest Sums

#37

Rank

#3628MediumFrequency: 52.1%

Find Minimum Time to Reach Last Room II

Array Graph Theory Heap (Priority Queue)Matrix Shortest Path

#38

Rank

#2725MediumFrequency: 51.3%

Mice and Cheese

#39

Rank

#1824MediumFrequency: 47.5%

Maximum Number of Eaten Apples

#40

Rank

#2418MediumFrequency: 47.5%

Minimum Sum of Squared Difference

Array Binary Search Greedy Sorting Heap (Priority Queue)

#41

Rank

#948MediumFrequency: 46.7%

Sort an Array

Array Divide and Conquer Sorting Heap (Priority Queue)Merge Sort Bucket Sort Radix Sort Counting Sort

#42

Rank

#2436EasyFrequency: 46.5%

Make Array Zero by Subtracting Equal Amounts

Array Hash Table Greedy Sorting Heap (Priority Queue)Simulation

#43

Rank

#1539MediumFrequency: 46.5%

Diagonal Traverse II

#44

Rank

#1485HardFrequency: 44.8%

Minimum Cost to Make at Least One Valid Path in a Grid

Array Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Shortest Path 0-1 BFS Dijkstra's Algorithm

#45

Rank

#2423HardFrequency: 44.7%

Minimum Deletions to Make Array Divisible

Array Math Sorting Heap (Priority Queue)Number Theory Euclidean Algorithm Greatest Common Divisor

#46

Rank

#2642HardFrequency: 44.7%

Time to Cross a Bridge

#47

Rank

#1184MediumFrequency: 43.2%

Car Pooling

Array Sorting Heap (Priority Queue)Simulation Prefix Sum

#48

Rank

#1499HardFrequency: 43.2%

Maximum Performance of a Team

#49

Rank

#332HardFrequency: 43.2%

Reconstruct Itinerary

Array String Depth-First Search Graph Theory Sorting Heap (Priority Queue)Eulerian Circuit Eulerian Path Semi-Eulerian Graph

#50

Rank

#451MediumFrequency: 43.2%

Sort Characters By Frequency

Hash Table String Sorting Heap (Priority Queue)Bucket Sort Counting

#51

Rank

#2914MediumFrequency: 41.6%

Find the Safest Path in a Grid

Array Binary Search Breadth-First Search Union-Find Heap (Priority Queue)Matrix

#52

Rank

#2327EasyFrequency: 41.2%

Largest Number After Digit Swaps by Parity

Sorting Heap (Priority Queue)

#53

Rank

#744MediumFrequency: 41.2%

Network Delay Time

Depth-First Search Breadth-First Search Graph Theory Heap (Priority Queue)Shortest Path Dijkstra's Algorithm

#54

Rank

#355MediumFrequency: 41.2%

Design Twitter

Hash Table Linked List Design Heap (Priority Queue)

#55

Rank

#789EasyFrequency: 40.8%

Kth Largest Element in a Stream

Tree Design Binary Search Tree Heap (Priority Queue)Binary Tree Data Stream

#56

Rank

#1762MediumFrequency: 40.8%

Furthest Building You Can Reach

#57

Rank

#2267HardFrequency: 40.2%

Minimum Difference in Sums After Removal of Elements

Array Dynamic Programming Heap (Priority Queue)

#58

Rank

#794HardFrequency: 40%

Swim in Rising Water

Array Binary Search Depth-First Search Breadth-First Search Union-Find Minimax Heap (Priority Queue)Matrix Dijkstra's Algorithm

#59

Rank

#1953HardFrequency: 39.5%

Finding MK Average

Design Queue Heap (Priority Queue)Data Stream Ordered Set Treap

#60

Rank

#642HardFrequency: 39.1%

Design Search Autocomplete System

String Depth-First Search Design Trie Sorting Heap (Priority Queue)Data Stream

#61

Rank

#218HardFrequency: 37.9%

The Skyline Problem

Array Divide and Conquer Binary Indexed Tree Segment Tree Sweep Line Sorting Heap (Priority Queue)Ordered Set

#62

Rank

#2588HardFrequency: 37.9%

Maximum Number of Points From Grid Queries

Array Two Pointers Breadth-First Search Union-Find Sorting Heap (Priority Queue)Matrix

#63

Rank

#902HardFrequency: 37.9%

Minimum Number of Refueling Stops

Array Dynamic Programming Greedy Heap (Priority Queue)

#64

Rank

#1753MediumFrequency: 37.3%

Path With Minimum Effort

Array Binary Search Depth-First Search Breadth-First Search Union-Find Heap (Priority Queue)Matrix Dijkstra's Algorithm

#65

Rank

#2094MediumFrequency: 35.6%

Remove Stones to Minimize the Total

#66

Rank

#2681HardFrequency: 33.3%

Put Marbles in Bags

#67

Rank

#3610EasyFrequency: 33.1%

Find X-Sum of All K-Long Subarrays I

Array Hash Table Sliding Window Heap (Priority Queue)

#68

Rank

#3655MediumFrequency: 32.8%

Digit Operations to Make Two Integers Equal

Math Graph Theory Heap (Priority Queue)Number Theory Shortest Path

#69

Rank

#1771MediumFrequency: 32.3%

Sell Diminishing-Valued Colored Balls

Array Math Binary Search Greedy Sorting Heap (Priority Queue)

#70

Rank

#2012MediumFrequency: 32.1%

Process Tasks Using Servers

#71

Rank

#2321HardFrequency: 31.8%

Minimum Weighted Subgraph With the Required Paths

#72

Rank

#2868MediumFrequency: 31.8%

Continuous Subarrays

Array Queue Sliding Window Heap (Priority Queue)Ordered Set Monotonic Queue

#73

Rank

#502HardFrequency: 31.1%

IPO

#74

Rank

#2434MediumFrequency: 30.4%

Design a Number Container System

#75

Rank

#1977HardFrequency: 30.4%

Minimum Interval to Include Each Query

Array Binary Search Sweep Line Sorting Heap (Priority Queue)

#76

Rank

#1917MediumFrequency: 30.2%

Maximum Average Pass Ratio

#77

Rank

#3678MediumFrequency: 29.5%

Design Task Manager

#78

Rank

#892HardFrequency: 29.1%

Shortest Subarray with Sum at Least K

Array Binary Search Queue Sliding Window Heap (Priority Queue)Prefix Sum Monotonic Queue

#79

Rank

#2473MediumFrequency: 29.1%

Max Sum of a Pair With Equal Sum of Digits

#80

Rank

#3764MediumFrequency: 29.1%

Maximum Sum With at Most K Elements

#81

Rank

#3647MediumFrequency: 28.1%

Zero Array Transformation III

Array Two Pointers Greedy Sorting Heap (Priority Queue)Prefix Sum

#82

Rank

#2054MediumFrequency: 27.8%

The Number of the Smallest Unoccupied Chair

Array Hash Table Heap (Priority Queue)

#83

Rank

#630HardFrequency: 27.7%

Course Schedule III

#84

Rank

#3445MediumFrequency: 27.7%

Lexicographically Minimum String After Removing Stars

Hash Table String Stack Greedy Heap (Priority Queue)

#85

Rank

#2142MediumFrequency: 27.3%

Average Height of Buildings in Each Segment

Array Sorting Heap (Priority Queue)Prefix Sum

#86

Rank

#2310MediumFrequency: 27.3%

Minimum Operations to Halve Array Sum

#87

Rank

#2674MediumFrequency: 27.3%

Make the Prefix Sum Non-negative

#88

Rank

#3386HardFrequency: 27.3%

Find Edges in Shortest Paths

Depth-First Search Breadth-First Search Graph Theory Heap (Priority Queue)Shortest Path

#89

Rank

#1959MediumFrequency: 26.7%

Minimum Path Cost in a Hidden Grid

Array Depth-First Search Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Interactive Shortest Path

#90

Rank

#2413MediumFrequency: 26.5%

Smallest Number in Infinite Set

#91

Rank

#2449HardFrequency: 26.5%

Maximum Number of Robots Within Budget

Array Binary Search Queue Sliding Window Heap (Priority Queue)Prefix Sum Monotonic Queue

#92

Rank

#2462HardFrequency: 26.5%

Find the K-Sum of an Array

#93

Rank

#3959MediumFrequency: 26.5%

Maximum Total from Optimal Activation Order

Array Two Pointers Greedy Sorting Heap (Priority Queue)

#94

Rank

#2161MediumFrequency: 25.4%

Stock Price Fluctuation

Hash Table Design Heap (Priority Queue)Data Stream Ordered Set

#95

Rank

#506EasyFrequency: 25.4%

Relative Ranks

#96

Rank

#1325MediumFrequency: 25.4%

Path with Maximum Probability

Array Graph Theory Heap (Priority Queue)Shortest Path Dijkstra's Algorithm

#97

Rank

#1099MediumFrequency: 25.4%

Path With Maximum Minimum Value

Array Binary Search Depth-First Search Breadth-First Search Union-Find Heap (Priority Queue)Matrix Dijkstra's Algorithm

#98

Rank

#3887MediumFrequency: 25.3%

Minimum Cost Path with Edge Reversals

#99

Rank

#1612MediumFrequency: 25.3%

Avoid Flood in The City

Array Hash Table Binary Search Greedy Heap (Priority Queue)

#100

Rank

#1052MediumFrequency: 25.3%

Campus Bikes

#101

Rank

#3710HardFrequency: 25.1%

Design an Array Statistics Tracker

Hash Table Binary Search Design Queue Heap (Priority Queue)Data Stream Ordered Set

#102

Rank

#3894MediumFrequency: 25.1%

Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values

Array Hash Table Greedy Sorting Heap (Priority Queue)

#103

Rank

#264MediumFrequency: 25%

Ugly Number II

Hash Table Math Dynamic Programming Heap (Priority Queue)

#104

Rank

#358HardFrequency: 24.6%

Rearrange String k Distance Apart

Hash Table String Greedy Sorting Heap (Priority Queue)Counting

#105

Rank

#2616MediumFrequency: 24.6%

Maximal Score After Applying K Operations

#106

Rank

#3107HardFrequency: 24.6%

Maximum Spending After Buying Items

#107

Rank

#1574EasyFrequency: 24.4%

Maximum Product of Two Elements in an Array

#108

Rank

#3773EasyFrequency: 24.4%

Minimum Pair Removal to Sort Array I

Array Hash Table Linked List Heap (Priority Queue)Simulation Doubly-Linked List Ordered Set

#109

Rank

#1074EasyFrequency: 23.6%

High Five

#110

Rank

#1140MediumFrequency: 23.6%

Distant Barcodes

Array Hash Table Greedy Sorting Heap (Priority Queue)Counting

#111

Rank

#1463EasyFrequency: 23.6%

The K Weakest Rows in a Matrix

Array Binary Search Sorting Heap (Priority Queue)Matrix

#112

Rank

#2429MediumFrequency: 23.6%

Design a Food Rating System

Array Hash Table String Design Heap (Priority Queue)Ordered Set

#113

Rank

#3363MediumFrequency: 23.6%

Most Frequent IDs

Array Hash Table Heap (Priority Queue)Ordered Set

#114

Rank

#2164MediumFrequency: 23.6%

Two Best Non-Overlapping Events

Array Binary Search Dynamic Programming Sorting Heap (Priority Queue)

#115

Rank

#1550HardFrequency: 23.4%

Find the Kth Smallest Sum of a Matrix With Sorted Rows

Array Binary Search Heap (Priority Queue)Matrix

#116

Rank

#2375HardFrequency: 23.3%

Minimum Obstacle Removal to Reach Corner

Array Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Shortest Path 0-1 BFS Dijkstra's Algorithm

#117

Rank

#1144HardFrequency: 22%

Optimize Water Distribution in a Village

Union-Find Graph Theory Heap (Priority Queue)Minimum Spanning Tree Prim's Algorithm Kruskal's Algorithm Borůvka's Algorithm

#118

Rank

#2590MediumFrequency: 21.9%

Maximum Star Sum of a Graph

Array Greedy Graph Theory Sorting Heap (Priority Queue)

#119

Rank

#3218HardFrequency: 21.9%

Find Number of Coins to Place in Tree Nodes

Dynamic Programming Tree Depth-First Search Sorting Heap (Priority Queue)DP on Trees

#120

Rank

#3354MediumFrequency: 21.9%

Replace Question Marks in String to Minimize Its Value

Hash Table String Greedy Sorting Heap (Priority Queue)Counting

#121

Rank

#2204EasyFrequency: 21.5%

Find Subsequence of Length K With the Largest Sum

#122

Rank

#1912MediumFrequency: 20.9%

Number of Restricted Paths From First to Last Node

Dynamic Programming Graph Theory Topological Sort Heap (Priority Queue)Shortest Path Dijkstra's Algorithm

#123

Rank

#1902HardFrequency: 20.9%

Car Fleet II

Array Math Stack Heap (Priority Queue)Monotonic Stack

#124

Rank

#1990MediumFrequency: 20.3%

Get Biggest Three Rhombus Sums in a Grid

Array Math Sorting Heap (Priority Queue)Matrix Prefix Sum

#125

Rank

#1100MediumFrequency: 20%

Connecting Cities With Minimum Cost

Union-Find Graph Theory Heap (Priority Queue)Minimum Spanning Tree

#126

Rank

#1126MediumFrequency: 20%

Minimum Cost to Connect Sticks

#127

Rank

#2207HardFrequency: 20%

Sequentially Ordinal Rank Tracker

Design Heap (Priority Queue)Data Stream Ordered Set

#128

Rank

#4089MediumFrequency: 20%

Maximize Points After Choosing K Tasks

#129

Rank

#4130MediumFrequency: 20%

Maximum Score After Binary Swaps

Array String Greedy Heap (Priority Queue)

#130

Rank

#1489HardFrequency: 19.5%

Pizza With 3n Slices

Array Dynamic Programming Greedy Heap (Priority Queue)

#131

Rank

#1622HardFrequency: 19.5%

Max Value of Equation

Array Queue Sliding Window Heap (Priority Queue)Monotonic Queue

#132

Rank

#2512MediumFrequency: 19.5%

Longest Uploaded Prefix

Hash Table Binary Search Union-Find Design Binary Indexed Tree Segment Tree Heap (Priority Queue)Ordered Set

#133

Rank

#659MediumFrequency: 19.5%

Split Array into Consecutive Subsequences

Array Hash Table Greedy Heap (Priority Queue)

#134

Rank

#2300MediumFrequency: 19.5%

Construct String With Repeat Limit

Hash Table String Greedy Heap (Priority Queue)Counting

#135

Rank

#683HardFrequency: 18%

K Empty Slots

Array Binary Indexed Tree Segment Tree Queue Sliding Window Heap (Priority Queue)Ordered Set Monotonic Queue

#136

Rank

#887HardFrequency: 18%

Minimum Cost to Hire K Workers

#137

Rank

#1860MediumFrequency: 18%

Find Kth Largest XOR Coordinate Value

Array Divide and Conquer Bit Manipulation Sorting Heap (Priority Queue)Matrix Prefix Sum Quickselect

#138

Rank

#3332MediumFrequency: 17%

Minimum Operations to Exceed Threshold Value II

#139

Rank

#1167HardFrequency: 16.4%

Minimum Time to Build Blocks

Array Math Greedy Heap (Priority Queue)

#140

Rank

#1865HardFrequency: 16.4%

Checking Existence of Edge Length Limited Paths II

Depth-First Search Union-Find Graph Theory Design Sorting Heap (Priority Queue)Minimum Spanning Tree

#141

Rank

#1879MediumFrequency: 16.4%

Maximum Score From Removing Stones

Math Greedy Heap (Priority Queue)

#142

Rank

#2396HardFrequency: 16.4%

Design Video Sharing Platform

Hash Table Design Heap (Priority Queue)

#143

Rank

#3970MediumFrequency: 16.4%

Power Update After K-th Largest Insertion I

Array Hash Table Math Segment Tree Sorting Heap (Priority Queue)

#144

Rank

#2636MediumFrequency: 16.1%

Maximum Subsequence Score

#145

Rank

#2711HardFrequency: 16.1%

Minimum Time to Visit a Cell In a Grid

Array Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Shortest Path

#146

Rank

#3555EasyFrequency: 16.1%

Final Array State After K Multiplication Operations I

Array Math Heap (Priority Queue)Simulation

#147

Rank

#1814MediumFrequency: 16.1%

Jump Game VI

Array Dynamic Programming Queue Heap (Priority Queue)Monotonic Queue

#148

Rank

#3226EasyFrequency: 16.1%

Minimum Number Game

Array Sorting Heap (Priority Queue)Simulation

#149

Rank

#3772HardFrequency: 15.7%

Minimum Pair Removal to Sort Array II

Array Hash Table Linked List Heap (Priority Queue)Simulation Doubly-Linked List Ordered Set

#150

Rank

#3558MediumFrequency: 14.6%

Find a Safe Walk Through a Grid

Array Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Shortest Path

#151

Rank

#2692EasyFrequency: 14.6%

Take Gifts From the Richest Pile

#152

Rank

#420HardFrequency: 12%

Strong Password Checker

#153

Rank

#2553MediumFrequency: 12%

Total Cost to Hire K Workers

Array Two Pointers Heap (Priority Queue)Simulation

#154

Rank

#2488MediumFrequency: 10.5%

Divide Intervals Into Minimum Number of Groups

Array Two Pointers Greedy Sorting Heap (Priority Queue)Prefix Sum

#155

Rank

#1389HardFrequency: 10.5%

Minimum Moves to Move a Box to Their Target Location

Array Breadth-First Search Heap (Priority Queue)Matrix

#156

Rank

#2695MediumFrequency: 10.3%

Find Score of an Array After Marking All Elements

Array Hash Table Sorting Heap (Priority Queue)Simulation

#157

Rank

#3919HardFrequency: 10.3%

Network Recovery Pathways

Array Binary Search Dynamic Programming Graph Theory Topological Sort Heap (Priority Queue)Shortest Path

#158

Rank

#1286HardFrequency: 8.1%

Constrained Subsequence Sum

Array Dynamic Programming Queue Sliding Window Heap (Priority Queue)Monotonic Queue

#159

Rank

#1955MediumFrequency: 8.1%

Seat Reservation Manager

Design Heap (Priority Queue)

#160

Rank

#3592HardFrequency: 8.1%

Find X-Sum of All K-Long Subarrays II

Array Hash Table Sliding Window Heap (Priority Queue)

#161

Rank

#4007HardFrequency: 7.3%

Maximum Total Subarray Value II

Array Greedy Segment Tree Heap (Priority Queue)

#162

Rank

#1270HardFrequency: 7.2%

Dinner Plate Stacks

Hash Table Stack Design Heap (Priority Queue)

#163

Rank

#3260HardFrequency: 7.2%

Divide an Array Into Subarrays With Minimum Cost II

Array Hash Table Sliding Window Heap (Priority Queue)

#164

Rank

#3496MediumFrequency: 7.2%

Minimum Number of Seconds to Make Mountain Height Zero

Array Math Binary Search Greedy Heap (Priority Queue)

#165

Rank

#2803HardFrequency: 5.5%

Modify Graph Edge Weights

#166

Rank

#1419HardFrequency: 5.5%

Make Array Non-decreasing or Non-increasing

Array Dynamic Programming Greedy Heap (Priority Queue)

#167

Rank

#2585EasyFrequency: 5.5%

Delete Greatest Value in Each Row

Array Sorting Heap (Priority Queue)Matrix Simulation

#168

Rank

#4067MediumFrequency: 5.5%

Design Auction System

#169

Rank

#3495MediumFrequency: 5%

K-th Nearest Obstacle Queries

#170

Rank

#2412EasyFrequency: 5%

Minimum Amount of Time to Fill Cups

#171

Rank

#499HardFrequency: 5%

The Maze III

Array String Depth-First Search Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Shortest Path Dijkstra's Algorithm Heuristic Search A* Search

#172

Rank

#3289HardFrequency: 5%

Earliest Second to Mark Indices II

Array Binary Search Greedy Heap (Priority Queue)

#173

Rank

#2113MediumFrequency: 5%

Find the Kth Largest Integer in the Array

Array String Divide and Conquer Sorting Heap (Priority Queue)Quickselect

#174

Rank

#1928MediumFrequency: 5%

Number of Orders in the Backlog

#175

Rank

#3556HardFrequency: 5%

Final Array State After K Multiplication Operations II

#176

Rank

#918HardFrequency: 5%

Reachable Nodes In Subdivided Graph

Graph Theory Heap (Priority Queue)Shortest Path Dijkstra's Algorithm

#177

Rank

#4160MediumFrequency: 5%

Maximum Sum of Three Numbers Divisible by Three

#178

Rank

#3976HardFrequency: 5%

Minimum Cost to Buy Apples II

Array Graph Theory Heap (Priority Queue)Shortest Path

#179

Rank

#1794HardFrequency: 5%

Minimize Deviation in Array

Array Greedy Heap (Priority Queue)Ordered Set

#180

Rank

#2549HardFrequency: 5%

Next Greater Element IV