Day 44 of #100DaysOfCode Solved leetcode problem and revised scheduling in os Bulb Switcher problem : turned out to be simple square root problem but took quite a while to figure it out.
Day 43 of #100DaysOfCode Low on health Some problems on leetcode : Time needed to buy tickets (Simulation) Remove colored pieces of a game (Game Theory) Game Theory is also an option to read and practice. It's fun.
Day 32 of #100DaysOfCode Occupied with office tasks Extended the previous code for finding Diameter of the Graph by DFS. Now this diameter will help in finding the node which will generate the minimum height tree of the graph. #SoftwareEngineering#buildinpublic
Finally 2-ways for maximum height trees problem - Find diameter of graph and then find middle node. - Start dfs on node with least degree and keep on removing nodes.