Had really difficult questions :(\n\n**Round 1**\nhttps://leetcode.com/problems/sequence-reconstruction/\n\n**Round 2**\nhttps://leetcode.com/discuss/interview-question/413991/\n\n**Round 3**\nShortest cycle in directed graph which contains the target node\ninput:\nedges = [[1, 2], [2, 3], [3, 1], [1, 4], [4, 1]]\ntarget = 1\n\noutput:\npath = [1, 4, 1]\n```\ndef shortest_cycle(edges: List[List[int]], target: int):\n\tpass\n```\n\n**Round 4**\nFind min time to go from point A to point B in a car (directed graph)\nCar fuel tank capacity is tank_capacity\n1 unit fuel and 1 unit time is used to go between any 2 points\nThere are multiple gas stations where you can refuel upto max fuel tank capacity. It takes 1 unit time to refuel\n```\ndef min_time(A: int, B: int, edges: List[List[int]], tank_capacity: int, gas_stations: List[int]):\n\tpass\n```\n**Round 5**\nGoogleyness\n  \n**Update 5/24/2021**\nGot HC approval. Downleveled to L3. Waiting for team match. :)\n\n**Update 5/28/2021**\nL3 offer

Had really difficult questions :(\n\nRound 1\nhttps://leetcode.com/problems/sequence-reconstruction/\n\nRound 2\nhttps://leetcode.com/discuss/interview-question