I applied online. The process took 2 weeks. I interviewed at Riot Games in Sep 2019
Interview
An online OA. 4 problems in total. Required to write a function to read input by yourself. The 4 problems are of the same topic which is about the distribution and extension of a garden.
Interview questions [1]
Question 1
4 problems regarding the distribution and extension of a garden. You have to write a function to read the input.
I applied online. The process took 1 day. I interviewed at Riot Games in Sep 2019
Interview
Anyone who apply get a reply email back in week or two and have chance to solve technical problem on hackerank. They will decide to review your resume depends on how well you did on the question.
I applied online. The process took 2 weeks. I interviewed at Riot Games
Interview
I applied online. Got an email back after 4 days. They gave me a week for a HakerRank 2 hour test. I think the test wasn't the hardest, i just didn't prepare enough for it. the questions were about matrix and strings. You have to know how to take unlimited lines of input.
Interview questions [4]
Question 1
You have 3 things 1) flower F 2) Walls W 3) empty spaces. you will get an input to determine the size of a matrix and then get input to show positions of flowers and walls
e.x.
2,2 (size of matrix)
F,0,1 (position of a flower)
W,1,1 (position of a wall)
and you are supposed to print the output of the grid like this
BF
BW
because the position 0,0 and 1,0 are blank they presented in the output with B
BUILD upon the previous question. Try to find all the blank spots that view the most flowers in the grid. if you have more than one empty positions that can see three flowers from north, south, east, and west, you have to replace all positions with *
you will be asked to take a flower out of the grid and put it in a bag and replace it with another flower. I think you have like 3 or 4 types of flowers denoted by Letters like D, O, R (somethig like that) in the end you have to make sure that all flowers in the bag are reused again. if you can't just print "false"
You have a flower called Ivy that can reproduce itself by one on every position north, south, east, and west each day. you have to determine after how many days the Ivy flower will eat in of the other flower on the grid