As a new grad, I was asked a difficult question. I used DFS to solve it and wrote my thoughts on paper. The interviewer was nice and allowed me to explain how to pass the parameters of the function, as well as the condition for the end of the recursion. I showed a little bit of uncertainty when I answered the question, but after all, the answer was correct, so I am still on the waiting list.

Find given words in the matrix.

For example:

The matrix = [ [a, s, d] [f, g, h] [j, f, v] ]

And the words = ['agfj', 'ah', 'vgj'].

Your aim is to find which words appear in the matrix.

So, words 'agfj' and 'vgj' are in the matrix.