AdobeInterview(Personalization team java developer)
**Round 1: **
Round 2:
Ques1:
You are given an m x n grid where each cell can have one of three values:
0 representing an empty cell,
1 representing a healthy person, or
2 representing a infected person.
Every minute, any healthy person that is 4-directionally adjacent to a infected person becomes infected.
Return the minimum number of minutes that must elapse until no cell has a healthy person. If this is impossible, return -1.
[[2,1,1],[1,1,0],[0,1,1]]
ans
[[2,1,1],[0,1,1],[1,0,1]]
ans
QUES2:
https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/
Ques3:
You are given get coin method that will randomly return string either "HEAD"|"TAIL" . Complete the code for getDice() function that will randomly return 1-6 numbers. You should not use any java api to complete this code. You can only use getCoin() method.
String getCoint()
{
return random "HEAD"|"TAIL"
}
int getDice(){
// RETURN random 1-6
//Do your code here using getCoin();}
I was able to solve BST question . Question 1 --> Not sure exactly what to do. Question3 --> Unable to think of any approach.