We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I'm not sure if I understand the question correct. In Sample 1, the optimal value for D is 4. However, the problem states the initial graph (before the brother erases) is such that the value of D is minimal, and D = 4 seems to violate it as the optimal value for D is 0. Can someone help me understand what I'm missing?
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Black and White Tree
You are viewing a single comment's thread. Return to all comments →
I'm not sure if I understand the question correct. In Sample 1, the optimal value for D is 4. However, the problem states the initial graph (before the brother erases) is such that the value of D is minimal, and D = 4 seems to violate it as the optimal value for D is 0. Can someone help me understand what I'm missing?