An autonomous agent navigates a discrete 2D grid from $(0,0)$ to $(5,4)$, constrained to only move Right or Up. A critical memory leak exists at coordinate $(2,2)$, which the agent must avoid. How many safe paths exist?
🔒
Authentication Required
You need an active account to evaluate expressions, submit proofs, and claim XP.