pranavbharadwaj-1328 / greedy_method Goto Github PK
View Code? Open in Web Editor NEWThere are three row of houses. There are N houses in each row. Each house can be painted with three colors: red, blue and green. The cost of painting each house with a certain color is different. You have to paint all the houses with following constaints No two adjacent houses in a row have the same color. Houses in a column have three different colors You have to paint the houses with minimum cost. How would you do it? using greedy method
License: MIT License