Top 20 Greedy Algorithms Interview Questions
Last Updated :
21 Feb, 2025
Improve
Greedy is an algorithmic paradigm that builds up a solution piece by piece, always choosing the next piece that offers the most obvious and immediate benefit. Greedy algorithms are used for optimization problems.
Easy Problems
- Activity Selection Problem
- Greedy Algorithm to find Minimum number of Coins
- Job Sequencing Problem
- Graph coloring
- Fractional Knapsack Problem
- Minimum Number of Platforms Required for a Railway/Bus Station
- Connect n ropes with minimum cost
Medium Problems
- Kruskal’s Minimum Spanning Tree Algorithm
- Huffman Coding
- Efficient Huffman Coding for Sorted Input
- Prim’s Minimum Spanning Tree Algorithm
- Prim’s MST for Adjacency List Representation
- Dijkstra’s Shortest Path Algorithm
- Dijkstra’s Algorithm for Adjacency List Representation
- Find maximum sum possible equal to sum of three stacks
- K Centers Problem
Hard Problems
- Minimize Cash Flow among a given set of friends who have borrowed money from each other
- Find minimum time to finish all jobs with given constraints
- Dail’s Algorithm
- Boruvka’s algorithm
