FastPrepMaze Reachability
Problems/Maze Reachability

Maze Reachability

Adobe logoAdobe● MediumNEW GRADOA

Updated Oct 2026

QuestionFunctionExamplesConstraints

Problem statement

Source note: The author reports a long BFS/grid-traversal task and clarifies that it was a maze. The full rules are absent. This practice version authors a reachability decision, binary walls, four-direction movement, endpoint handling, bounds and the interface.

A rectangular maze is given as grid, where 0 is an open cell and 1 is a wall. The coordinates in start and finish are zero-based [row,column] pairs.

You may move up, down, left or right between open cells, staying inside the maze. Return whether you can reach the finish from the start. If either endpoint is a wall, return false. An open cell can reach itself without moving.

Function

canReachMaze(grid: int[][], start: int[], finish: int[]) → boolean

Examples

Example 1

grid = [[0,1,0],[0,0,0]]start = [0,0]finish = [0,2]return = true
grid
01200101000

One open route is (0,0) → (1,0) → (1,1) → (1,2) → (0,2).

Example 2

grid = [[0,1],[1,0]]start = [0,0]finish = [1,1]return = false
grid
01001110

The open cells touch only diagonally, and diagonal movement is not allowed.

Constraints

  • 1 <= grid.length <= 200
  • 1 <= grid[i].length <= 200
  • 0 <= grid[i][j] <= 1
  • start.length == finish.length == 2
  • 0 <= start[i], finish[i] <= 199
  • Every row has the same length.
  • Both start and finish are [row,column] coordinates inside the grid.

Source note: Screenshots of public Reddit comments describing the reported Adobe OA task and any included author clarification. The practice version adds the details stated in the source note.

More Adobe Online Assessment questions

  • Rotate an Array In PlaceOA · PHONE SCREEN · Seen Aug 2026
  • Top-Funded Villages and ProjectsOA · Seen Aug 2026
  • Count Parent Nodes With a Target SumOA · Seen Aug 2026
  • Largest Binary Number by ConcatenationOA · Seen Aug 2026
  • Count Events by CategoryOA · Seen Aug 2026
  • Graph M-ColoringOA · Seen Aug 2026
  • Hall of Shifting TilesOA · Seen Aug 2026
  • K-th Ancestor Subtree Preorder QueryOA · Seen Aug 2026
  • Minimum Numeric Code TransformationOA · Seen Aug 2026
  • Number-Character Bijective MappingOA · Seen Aug 2026

Similar questions at other companies

  • Delivery Management SystemAkuna Capital · OAAkuna Capital interview questions
  • Minimize CommuteDatabricks · OA · PHONE SCREENDatabricks interview questions
  • Tree Pythagorean TriplesIBM · OAIBM interview questions
  • Shortest Atom Action PathOpenAI · OAOpenAI interview questions
  • Distances to CyclesBelvedere Trading · OA
  • Shortest Path from an Encoded GraphIntuit · OAIntuit interview questions
  • Minimize Malware Spread by Removing a NodeVisa · OAVisa interview questions
  • Longest Distance in a Frequency-Limited NetworkBloomberg LP · OABloomberg LP interview questions
  • Minimum Cleaning Robot RunsHSBC · OAHSBC interview questions
  • Find Minimum City HopsAmazon · OA

Adobe interview experiences

  • Adobe Web, QA, DevOps, ML Roles: 13 Experiences (Part 3 of 3)
  • Adobe SWE Interviews, Level Unknown: 25 Experiences (Part 2 of 3)
  • Adobe Interviews, Level Unknown: 38 Experiences (Part 1 of 3)
  • Adobe New Grad MTS Interview Questions: 7 Experiences
  • Adobe ML/Research Intern Interviews: 12 Experiences (Part 4 of 4)
  • Adobe Product Intern Interviews: 15 Experiences (Part 3 of 4)
All Adobe interview questionsSee Adobe hiring insights
Saved
class Solution {
    public boolean canReachMaze(int[][] grid, int[] start, int[] finish) {
        // Write your solution here
    }
}
Checking account…