They contacted me via a short phone call.

We scheduled an interview for the following week.

The interview itself was pretty long, about 90 minutes.

There were two technical questions:

• First, we discussed them.
• After arriving at a solution, I was asked to implement it in code.

Given an array, check if there is a sub-array whose sum is equal to N (which is given as a parameter).

A question that required knowledge of BFS/DFS algorithms.

Given a matrix of numbers, change all numbers (let's say equal to 1, while the rest are zero) that can be reached from the starting point and are adjacent to one another in the matrix, resulting in a "coloring" pattern.