Book excerpt: Greedy algorithms are fundamentally important as it encapsulate algorithmic problems where choosing the most obvious answer for the current sub-problem results in solving the entire problem.This seems to be easy and it is easy. The difficult part is to understand if a problem can be solved using a Greedy algorithm. There are numerous problems where a greedy algorithm may look to be the solution but is in fact, not the case.In this book, we have covered some greedy problems which you can cover in a day to get prepared just before your coding interview.We have covered problems like:* Finding largest number with given number of digits and sum (Important as it illustrates how an exponential search space can be traversed in linear time)* Number as a sum of Fibonacci terms (Requires deep insights from Number Theory to truly understand this problem which we explained)* Maximal clique (a perfect problem as it shows greedy algorithms can be effectively used in finding structures within graphs)* Task Selection (this problem is unique as slightly changing the problem statement, no greedy approach will be valid. In fact, this is a problem where Greedy Algorithm is preferred over a corresponding Dynamic Programming approach.)* Graph Coloring (This is a real-world problem and vast amount of research has been put into this. We presented a greedy solution to this along with the general idea of other approaches.)and many more ideas.We have added pseudocode for each approach which you should go through and implement in your programming language of choice to get in the flow of implementing ideas as well.This book has been carefully prepared and reviewed by Top programmers and Algorithmic researchers and members of OpenGenus. We would like to thank Aditya Chatterjee and Ue Kiao for their expertise in this domain and reviews from Tokyo Institute of Technology.Read this book now and ace your upcoming coding interview. This is a must read for everyone preparing for Coding Interviews at top companies.