Ho presentato la mia candidatura online. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Arista Networks nel mese di lug 2011
Colloquio
Response was prompt.
There was an initial 40-minute technical screening interview, followed by a longer interview a few days later.
Initial screening consisted of C programming questions. Revise your knowledge of binary search trees and linked lists. Practice writing recursive functions. The interviewer helps you move forward, but keeps probing.
The surprise was that the second interview was also mostly C coding and program design - on the whiteboard, as well as on the laptop.
Basics of memory management, OS, stacks, but again, the interviewer is looking for deep understanding.
They are looking more for good software engineering skills, less for specific networking knowledge.
If you've done a lot of C/C++ programming, do apply.
It seems like a good work environment for engineers.
Domande di colloquio [1]
Domanda 1
What's pushed on the stack when a function with variable number of args is called?
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Arista Networks (Boulder, CO) nel mese di ott 2016
Colloquio
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.
Domande di colloquio [1]
Domanda 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.
Ho presentato la mia candidatura tramite un selezionatore. La procedura ha richiesto 3 giorni. Ho sostenuto un colloquio presso Arista Networks (San Diego, CA) nel mese di feb 2016
Colloquio
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.
Domande di colloquio [1]
Domanda 1
Write a function in C that compares version number strings. I.e: '1.1.2.1'.
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto più di una settimana. Ho sostenuto un colloquio presso Arista Networks
Colloquio
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.
Domande di colloquio [3]
Domanda 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.
