NVIDIA SWE New Grad Online Assessment (2024 to2025) | Grid-Based Route Optimization Using Breadth-First Search Problems

Q1. Minimum Steps Through a Binary Navigation Grid Problem Statement You are given an n × n binary matrix representing a navigation grid. Each cell contains: 0 → Open cell 1 → Blocked cell Find the length of the shortest valid path from: (0,0) to (n-1,n-1) A path is considered valid only if: Every visited cell contains 0 Movement is allowed in all 8 directions: Up Down Left Right Top-Left Top-Right Bottom-Left Bottom-Right Return: Length of the shortest path if ...