I applied online and received an email back after four days. They gave me one week to complete a two-hour HackerRank test. I believe the test wasn't the hardest, but I didn't prepare enough for it.

The questions focused on matrices and strings. You need to know how to handle unlimited lines of input.

You have three types of elements:

• Flower (F)
• Wall (W)
• Empty spaces

You will receive input to determine the size of a matrix and then input to show the positions of flowers and walls.

For example: 2,2 (size of matrix) F,0,1 (position of a flower) W,1,1 (position of a wall)

The output grid should be displayed like this:

BF BW

Here, positions 0,0 and 1,0 are blank and represented by 'B'.

Build upon the previous question. Find all blank spots that view the most flowers in the grid. If there are multiple empty positions that can see three flowers from the north, south, east, and west, replace all those positions with '*'.

You will be asked to take a flower out of the grid and put it in a bag, then replace it with another flower. There are likely 3 or 4 types of flowers denoted by letters like D, O, R. In the end, ensure all flowers in the bag are reused. If this is not possible, print "false".

You have a flower called Ivy that can reproduce itself by placing one on every adjacent position (north, south, east, and west) each day. Determine after how many days the Ivy flower will consume another flower on the grid.