Arista Networks Interview Questions, Process, and Tips

Round: PRE placement
Experience: Was accepted through the pre placement offer after a satisfactory internship during the summer.
There was a small test after the internship. Work done in the internship in co-ordination with mentor, employees and manager has more weight-age.

General Tips: Just brush up on your fundamentals. The questions asked will just be a direct or indirect applications of what you have learnt. Good programming practice is also needed.
Good knowledge about Operating systems, Data structures, Networking and Programming is what they generally look for while hiring.
A good internship project helped in securing the PPO.
Skills:
College Name: NIT Surathkal

Round: Test
Experience: The various topics from which questions were asked consisted of Time and work, equations, data interpretation etc. There was even negative marking.

Round: video synthesis round
Experience: Video synthesis round in which a video was played and we had to describe about it. The next was a pseudo code given for which the output was to be determined.

Round: HR Interview
Experience: In the first round they asked questions related to the pseudo code and how did I approach to solve it.The main consideration was how you approach and not the final answer. Then they asked from my resume about my project. The second round of interview was an HR round. There was some discussion regarding what I had written in video synthesis round. Then he asked me various questions regarding why Mu Sigma and why not any other analytic company and some common HR questions.

Skills:
College Name: NIT Surathkal

Round: Test
Experience: 1. Array indexing based C o/p question2. Compute size of structure, Struct hack3. Allocate m*n 2 D array. The array should be accessible as arr[i][j].4. Given a sorted integer array. Convert it to a balanced BST (Size of array is given)5. Program to check whether 2 rectangles in a 2 D plane overlap or not.6. A simple o/p question based on fork() (This question always comes in Avishkar and Mock exams)7. Given an array of n integers which contains integers from 0 to n 1, with any of these integers appearing any number of times. Find the repeating integers in O(n).8. Mutilated Chessboard Puzzle9. Merge two sorted singly linked lists into one sorted singly linked list. Allocate no extra node.

Round: Technical Interview
Experience: . Given a full binary tree.
Given the tree structure like thisstruct node
{
int val?
struct node *left, *right, *parent?
}? Root pointer is not given.
Given a pointer to node x(say 10) (indexing left to right starting from root as 1).
To reach node 10 from root, you need to move left, then right, then left.

Return a pointer to the corresponding node y in the other subtree of root (if x was present in left, y should be found in right and vice versa) tracing same path sequence.
For x = 10, y will be 14 [from root, go right (must search in other subtree always), right, left]. You are not allowed to calculate the size of the tree.
2. Given an integer N. Convert it into MS Excel column string.
Ex N = 1 : A
N = 2 : B
N = 27 : AA
N = 52 : AZ and so on

Round: HR Interview
Experience: 3. A practical problem :
Given a project P. P has m modules (M1, M2, …, Mm). Each module has some tasks (t1, t2, .., ti) where i can vary for each module.
There are E engineers. Assume that every engineer can do any task of any module. More than 1 engineers are allowed to work on a task simultaneously. Efficiency of each engineer for each task is given (No. of days it will take ith engineer alone to complete task tj of module Mk). Each task is atomic. So you start a task only when you know you can finish it completely without any pauses in b/w. There can be dependencies b/w the tasks too (Say t3 of M2 depends on t4 of M1, t3 of M2 cannot be started until t4 of M1 has been finished). You have to o/p the no. of days it will take to complete the project (Assume that wherever possible tasks can be run in parallel too). Design data structures to represent resources (Engineers, computer systems etc.), tasks and dependencies b/w them so as to minimise duration of the project.

College Name: NA