โ† Adobe questions
CodingHard

Find Largest Adjacent Path of 1s in Matrix

Filed under Adobe

Given a binary matrix of 0s and 1s, find the length of the longest simple path of adjacent 1s without visiting any cell more than once.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Adobe questions

Collected from public candidate posts and coding forums. Updated Nov 2026.