Open In App

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

Top 20 Greedy Algorithms Interview Questions

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.

  1. Activity Selection Problem
  2. Kruskal’s Minimum Spanning Tree Algorithm
  3. Huffman Coding
  4. Efficient Huffman Coding for Sorted Input
  5. Prim’s Minimum Spanning Tree Algorithm
  6. Prim’s MST for Adjacency List Representation
  7. Dijkstra’s Shortest Path Algorithm
  8. Dijkstra’s Algorithm for Adjacency List Representation
  9. Job Sequencing Problem
  10. Greedy Algorithm to find Minimum number of Coins
  11. K Centers Problem
  12. Minimum Number of Platforms Required for a Railway/Bus Station
  13. Connect n ropes with minimum cost
  14. Graph coloring
  15. Fractional Knapsack Problem
  16. Minimize Cash Flow among a given set of friends who have borrowed money from each other
  17. Find minimum time to finish all jobs with given constraints
  18. Find maximum sum possible equal to sum of three stacks
  19. Dail’s Algorithm
  20. Boruvka’s algorithm
Article Tags :
Algorithms
DSA
Experiences
Greedy
Interview Experiences
Recommended Articles
1. Greedy Algorithms (General Structure and Applications)
2. Scheduling in Greedy Algorithms
3. Correctness of Greedy Algorithms
4. Greedy Algorithms
5. Difference Between Greedy Knapsack and 0/1 Knapsack Algorithms
6. Top 10 Algorithms in Interview Questions
7. Top 100 Data Structure and Algorithms DSA Interview Questions Topic-wise
8. Boruvka's algorithm | Greedy Algo-9
9. Coin game of two corners (Greedy Approach)
10. What is Greedy Algorithm in DSA?
11. Minimum number of subsequences required to convert one string to another using Greedy Algorithm
12. Maximum profit by buying and selling a share at most K times | Greedy Approach
13. Travelling Salesman Problem | Greedy Approach
14. Difference between Greedy Algorithm and Divide and Conquer Algorithm
15. Comparison among Greedy, Divide and Conquer and Dynamic Programming algorithm
16. Prim’s MST for Adjacency List Representation | Greedy Algo-6
17. Graph Coloring Using Greedy Algorithm
18. Greedy approach vs Dynamic programming
19. Huffman Coding | Greedy Algo-3
20. Efficient Huffman Coding for Sorted Input | Greedy Algo-4
21. Dijkstra’s Algorithm for Adjacency List Representation | Greedy Algo-8
22. Greedy Algorithm for Egyptian Fraction
23. Greedy Approximate Algorithm for Set Cover Problem
24. Greedy Algorithm to find Minimum number of Coins
25. Greedy Best first search algorithm