Candidatei-me por meio de recrutador(a). O processo levou 2 meses. Fui entrevistado pela Arista Networks (Toronto, ON) em mar. de 2015
Entrevista
contacted HR during Tech Fest. Took few weeks to get call for first round of interview. Interview focused on very basics of C language. Interviewer gave me ssh access to their computer and asked me to complete to existing code.
Candidatei-me por meio de uma faculdade ou universidade. O processo levou 1 dia. Fui entrevistado pela Arista Networks (Boulder, CO) em out. de 2016
Entrevista
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.
Perguntas de entrevista [1]
Pergunta 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.
Candidatei-me por meio de recrutador(a). O processo levou 3 dias. Fui entrevistado pela Arista Networks (San Diego, CA) em fev. de 2016
Entrevista
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.
Perguntas de entrevista [1]
Pergunta 1
Write a function in C that compares version number strings. I.e: '1.1.2.1'.
Candidatei-me por meio de uma faculdade ou universidade. O processo levou mais de 1 semana. Fiz uma entrevista na empresa Arista Networks.
Entrevista
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.
Perguntas de entrevista [3]
Pergunta 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.
