The interview process began with a standard initial call, followed by an online Codility assessment. Practicing some medium-level LeetCode problems should prepare you for this part.

Next were three successive interviews:

• The first was an OOP design question. You need to understand dependency injection, inheritance, and SOLID principles.
• The second was intended to be a systems design question, but it felt quite different from anything I'd seen before (this is where the question I submitted earlier came up). I believe the interviewer wanted me to discuss Java's storage structures and how to choose the appropriate one for different situations, but we got sidetracked. We also discussed the big picture and understanding deployment pipelines in your current role.
• The last interview was a coding assessment with three progressively harder questions that built on each other. These were not as difficult as the previous interview or the Codility assessment; I think the interviewer simply wanted to observe my thought process and ensure I wasn't using AI. It was quite quick.

The final interview was solely based on behavioral questions, which can be studied and practiced using resources like YouTube.

Write a function that takes a two-dimensional array of integers as input. This array represents a maze.

The top-left corner of the maze is (0,0), and the bottom-right corner is (n,n), where n is the length of one side of the array.

The array elements are either zeroes or positive integers. Zeroes indicate walls that block the way, while positive integers indicate open spaces that can be traversed.

The function should find a path from the start to the end of the maze, moving only up, down, left, or right, and avoiding walls.

The function should return the sum of the integers along the path. If there are multiple paths, the function can return any one of them.