AI Resident

You are given a directed graph having ‘N’ nodes. A matrix ‘EDGES’ of size M x 2 is given which represents the ‘M’ edges such that there is an edge directed from node EDGES[i][0] to node EDGES[i][1].

Find whether the graph contains a cycle or not, return true if a cycle is present in the given directed graph else return false.

For Example :

In the following directed graph has a cycle i.e. B->C->E->D->B.

Note :

1. The cycle must contain at least two nodes.
2. It is guaranteed that the given graph has no self-loops in the graph.
3. The graph may or may not be connected.
4. Nodes are numbered from 1 to N.
5. Your solution will run on multiple test cases. If you are using global variables make sure to clear them.

• In an agentic AI system like Ema’s that handles long-running conversations and performs multiple tool-calling steps, explain why KV (Key-Value) caching is important for efficient inference. Discuss how it helps with maintaining context across interactions, reducing recomputation, and improving response speed. Also describe the trade-offs involved, particularly in terms of increased memory usage, scalability challenges, and latency optimization.
• Standard self-attention has a memory complexity of O(n2)O(n^2)O(n2) with respect to sequence length. Explain how FlashAttention optimizes the attention mechanism to reduce memory overhead and improve efficiency. Why is this considered a major breakthrough for deploying agentic AI systems that require long context windows?
• In Reinforcement Learning, explain the key components of a Markov Decision Process (MDP) and their roles in defining an environment for decision-making.