Top 20 Greedy Algorithms Interview Questions Last Updated : 27 Dec, 2023 Improve Improve Like Article Like Save Share Report 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. Activity Selection Problem 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 Job Sequencing Problem Greedy Algorithm to find Minimum number of Coins K Centers Problem Minimum Number of Platforms Required for a Railway/Bus Station Connect n ropes with minimum cost Graph coloring Fractional Knapsack Problem 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 Find maximum sum possible equal to sum of three stacks Dail’s Algorithm Boruvka’s algorithm Like Article Suggest improvement Previous Rearrange a string so that all same characters become d distance away Share your thoughts in the comments Add Your Comment Please Login to comment...