•PRACTICE

Greedy Interview Questions

31 Greedy problems asked across FAANG and top tech companies. Approach hints, optimal solutions, and related problems.

Filter by company

Clear all ✕
Adobe (2)Amazon (8)Apple (7)Atlassian (5)Google (6)LinkedIn (1)Meta (6)Microsoft (7)Netflix (1)Oracle (4)Rippling (2)Salesforce (8)Uber (5)Walmart (3)

Filter by topic

Array (178)Backtracking (17)BFS (23)Binary Search (34)Binary Tree (13)Bit Manipulation (16)Breadth-First Search (20)Counting (7)Data Stream (6)Database (6)Depth-First Search (27)Design (37)DFS (24)Divide and Conquer (7)Doubly-Linked List (5)DP (10)Dynamic Programming (39)Graph (6)Graph Theory (13)Greedy (31)Hash Table (87)Heap (12)Heap (Priority Queue) (13)Linked List (15)Math (32)Matrix (22)Monotonic Stack (6)Ordered Set (8)Prefix Sum (11)Queue (10)Recursion (7)Simulation (11)Sliding Window (21)Sorting (45)Stack (24)String (85)Topological Sort (6)Tree (30)Trie (10)Two Pointers (30)Union-Find (13)
🔒

to save your progress.

✓ 0ProblemDifficultyCompaniesBreakdown / SolutionLeetCode
Container With Most WaterMedium7 companiesView breakdown →
Meeting Rooms IIMedium8 companiesView breakdown →
Gas StationMedium6 companiesView breakdown →
Task SchedulerMedium6 companiesView breakdown →
Jump Game IIMedium4 companiesView breakdown →
Best Time to Buy and Sell Stock IIMedium3 companiesView breakdown →
Wildcard MatchingHard2 companiesView breakdown →
Minimum Operations to Reduce an Integer to 0Medium3 companiesView breakdown →
Split Array Largest SumHard3 companiesView breakdown →
Remove Stones to Minimize the TotalMedium1 companiesView breakdown →
Maximum XOR ProductMedium2 companiesView breakdown →
Maximum Value at a Given Index in a Bounded ArrayMedium1 companiesView breakdown →
Advantage ShuffleMedium1 companiesView breakdown →
Building BoxesHard1 companiesView breakdown →
Can Place FlowersEasy1 companiesView breakdown →
Cinema Seat AllocationMedium1 companiesView breakdown →
Jump GameMEDIUM1 companiesView breakdown →
Largest NumberMEDIUM1 companiesView breakdown →
Maximum SwapMEDIUM1 companiesView breakdown →
Minimum Operations to Make Array Non DecreasingMEDIUM1 companiesView breakdown →
Put Marbles in BagsHARD1 companiesView breakdown →
Rearranging FruitsHARD1 companiesView breakdown →
Remove K DigitsMEDIUM1 companiesView breakdown →
Reorganize StringMEDIUM1 companiesView breakdown →
Minimum Cost to Hire K WorkersHARD1 companiesView breakdown →
Minimum Number of Refueling StopsHARD1 companiesView breakdown →
Maximum Palindromes After OperationsMEDIUM1 companiesView breakdown →
Minimum Replacements to Sort the ArrayHARD1 companiesView breakdown →
Maximum Coins From K Consecutive BagsMEDIUM1 companiesView breakdown →
Valid Parenthesis StringMedium1 companiesView breakdown →
Using a Robot to Print the Lexicographically Smallest StringMEDIUM1 companiesView breakdown →

Practice with a Mock Interview

Solve these Greedy problems under real interview pressure with our AI interviewer.

Start Mock Interview →