3 Questions | 3 hour\n\nQ1 - https://leetcode.com/problems/bulb-switcher-iii/\nQ2 - Given Binary tree, return the number of nodes on the longest distinct path that starts at the root.\nQ3- Given n edges of a directed graph and there are n nodes (0..n). return the node, which is reachable from every node of the graph. If such node doesn\'t exist , return -1.\n\n\n***********************************************************************************************\n I was able to do first 2 questions, for Q3 only some of the test cases passed.\n Any suggestions for Q3?

3 Questions | 3 hour\n\nQ1 - https://leetcode.com/problems/bulb-switcher-iii/\nQ2 - Given Binary tree, return the number of nodes on the longest distinct path t