Top 20 Greedy Algorithms Interview Questions

3.2

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

This article is contributed by Ayushmaan Bansal. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

GATE CS Corner    Company Wise Coding Practice

Recommended Posts:



3.2 Average Difficulty : 3.2/5.0
Based on 4 vote(s)










Writing code in comment? Please use ide.geeksforgeeks.org, generate link and share the link here.