**Question 1:**\nGiven a directed graph remove return minimum of edges to keep all paths .\n\n**Example:**\n```\nInput: [[1, 2], [1, 3], [1, 4], [2, 3], [2, 4], [3, 4]] \nOutput: 3\nExplanation: Minimum number of edges is 3 (1 2, 2 3, 3 4)\n```\nBefore\n![](https://i.imgur.com/Hm97mcX.png)\n\nAfter\n![image](https://assets.leetcode.com/users/stanila/image_1589440961.png)\n\n\n**Question 2:**\nhttps://leetcode.com/problems/factorial-trailing-zeroes/\n\nThe second one was very easy but for the first one I used a sort of dfs with some custom node but the interviewer doesn\'t seem to be so happy...\n\n

Question 1:\nGiven a directed graph remove return minimum of edges to keep all paths .\n\nExample:\n\nInput: [[1, 2], [1, 3], [1, 4], [2, 3], [2, 4], [3, 4]] \n