\n\n* I\'m an international student who needs sponsorship.\n* MS in CS\n* This one is for New Grad position. I got 3 virtual onsite interviews.\n\n**Round 1:**\nSDE 2 from alexa team\nHe asked One LP & he moved to coding question\nLongest consecutive sequence: https://leetcode.com/problems/longest-consecutive-sequence/\nI haven\'t seen this one before. Somehow, I gave him O( n logn +n ) solution. He was ok with my solution and then he asked me to think out of box & also asked me to forget the sorting part & think how will you do without sorting. He also gave me a clue "think about the data structure by which you can do that easily". I told him HashMap. Finally he was ok with that.\n\n**Round 2:**\nSDE 2 . I can\'t able to remember his team.\nHe asked lot of LP questions. In the begining he told that he will keep on typing what he says. Finally he asked number of islands question https://leetcode.com/problems/number-of-islands/ . First i told my dfs approach. Then he asked me why not BFS, what is the difference between DFS & BFS. I said him DFS is a recursive approach & BFS is a iterative approach, we need queue data structure to solve whereas DFS doesn\'t need any external data structure. Finally he asked about time complexity & space complexity. I told him O(M X N) again he asked  why M X N and what about recursive calls cost. I told him it\'s M X N because we need to search the entire grid. Then he asked what you will do if u have million i/p\'s . I told him i will use union find method which reduces the number of recursive calls. *( Honestly speaking, I\'m not sure whether what i told is correct or not).*\n\n**Round 3:**\nHe said that he manages Alexa team.\nHe asked some LP\'s. Then, he moved on to coding part which is a design question to install packages (first we need to install package dependencies, before installing the package). I asked lot of questions and finally we designed one package class with getter, setter and function methods . At, the end he was ok with the code and he said that your recruiter will contact you in 2 days.\n\nQuestion:\n\nA depends B\nB depends on C, D, E, G\nE depends on F\nF depends on G\n\nHonestly speaking, I don\'t know whether i did well or not. These interviewer\'s are well trained. we can\'t able to read whether they are happy or not.\n\n\n

\n\n I\'m an international student who needs sponsorship.\n MS in CS\n This one is for New Grad position. I got 3 virtual onsite interviews.\n\nRound 1:\nSDE 2 