\nStatus: New grad, MS CS Top 40 CS school\nPosition: SDE1 at Arista Networks\nLocation: NH, US\n\n**Technical phone screen (1 hour):**\nA binary tree-related question similar to Inorder successor in a BST. https://leetcode.com/problems/inorder-successor-in-bst/\nThen a binary search-related question -- similar to find missing positive numbers from a given set of positive successive numbers. eg., 11, 12, 14 so ans is 13\n Then comment on what the given code snippet does. Compare the time, space complexity for the given two code snippets. \n\n This round went out to 1.3 hr. \n\n**HM (1hr)**\nA brief discussion of the projects and prior experiences, how I approach problem-solving then jumped on to writing code for a problem similar to merge k sorted arrays. https://leetcode.com/problems/merge-k-sorted-lists/\nAnother question was to remove duplicated numbers from the given array [inplace] in JS\n\n **Two senior engineers (1.2 hr)**\nDiscussion on my react projects, then how does React works under the hood and its hooks. \nwrite simple code for useState hook  implementation \nShare your screen to display one of project on react and how will you improve it, scale it. \nHow will you gauge the performance of a laggy website then how to improve it.

\nStatus: New grad, MS CS Top 40 CS school\nPosition: SDE1 at Arista Networks\nLocation: NH, US\n\nTechnical phone screen (1 hour):\nA binary tree-related quest