I applied through a recruiter. The process took 3 days. I interviewed at Arista Networks (San Diego, CA) in Feb 2016
Interview
One hour long on-campus interview after talking to a recruiter at a job fair. Not terribly hard, interviewer was willing to help when I got stuck. The interview is entirely technical, so don't bother practicing your answers to non-technical coding and CS-theory questions.
Interview questions [1]
Question 1
Write a function in C that compares version number strings. I.e: '1.1.2.1'.
I applied through college or university. The process took 1 day. I interviewed at Arista Networks (Boulder, CO) in Oct 2016
Interview
I was called by the interviewer at the time I signed up for via Google Calendar. I was asked to connect to a remote server of theirs via SSH. On the server was a C file and a header file and the question was defined in these files. I was allowed time to read the question and look through the files and given one hour in total to do so and complete the problem.
Interview questions [1]
Question 1
Given a singly-linked list with duplicate integer key values, write a function that, given the head of the list and an integer value, delete all nodes with the given key.
I applied through college or university. The process took 1+ week. I interviewed at Arista Networks
Interview
Spoke to campus recruiter, handed him my resume and got contacted within the next 3 days to schedule an interview. Was interviewed in person, 45-minute session. Asked 3-5 technical questions which took about 30-35 minutes (no brain-teaser type questions) and then last 15 minutes were spent asking about previous experience, things listed on my resume, and why I would want to work for Arista.
Interview questions [3]
Question 1
Here is an implementation of a BST. Write a function in C to find the minimum node of the tree.
A question about what the main function in C does and why it is important to know the difference between char, char pointer, char array, and a pointer to char pointer.