Comments
0

Thanks! btw, I found this if anyone is looking for a detailed explanation.
0

I am unable to understand why the solution to problem E has time complexity O(n log^2 n ). For every node, we are iteration through all the children, and then for every child we are iterating through every color it has. Can someone explain it to me?
-10

deathnote naruto haikyuu attack on titan and I recently started blue lock, which is pretty cool.
-6

There were better ways of explaining question B but bro wake up and choose violence.