The steps are as follows:

• HR screening call. This is a general talk about your experience, with nothing too deep.
• Technical screening.
• Technical interviews.
• There may be other steps, but I did not make it beyond the technical screening.

Given two inputs:

1. Location Map: A 2D array representing the environment.

   | O | E | E | E | X | | E | O | X | X | X | | E | E | E | E | E | | X | E | O | E | E | | X | E | X | E | X |

   • O = Robot
   • E = Empty space
   • X = Blocker

2. Query: A 1D array representing the distances to the closest blocker in the order: left, top, bottom, and right. For example, [2, 2, 4, 1] means a distance of 2 to the left, 2 to the top, 4 to the bottom, and 1 to the right.

   • Map boundaries are also considered blockers. If a robot hits a boundary, it's equivalent to hitting a blocker.

Task:

Write a function that takes these two inputs and returns the index (or indices) of any robots that match the query.

Example Output:

[[1, 1]]

Time Complexity: O(n * k * (n + k))

Matrix Example:

[['O','E','E','E','X'],['E','O','X','X','X'],['E','E','E','E','E'],['X','E','O','E','E'],['X','E','X','E','X']]