Rivian | Staff Engineer | Coding | Phone Screen

Question: "The Longest Trail" Objective:Given an M by N binary matrix where 0 represents an empty path and 1 represents a wall, find the length of the longest path consisting only of 0s. Constraints: You can move Up, Down, Left, or Right. You cannot visit the same cell twice within a single path. The path can start at any cell containing a 0. No cycles allowed