Mercor | Software Engineer, Applied AI (Junior/New Grad) | High Level Leetcode | Phone Screen

Four questions, 20 minutes to explain how you would solve them. No implementation needed, just describe how you would solve them 1. You're given a directed graph, meaning each edge has a direction. Describe an algorithm that determines whether the graph contains any directed cycle. 2. You're given n meetings, each as an inclusive interval [L, R] of integer timestamps. You will get many queries with a timestamp x. For...