Solicité el puesto a través de la escuela superior o la universidad. El proceso duró 1 día. Acudí a una entrevista en Arista Networks (Ithaca, NY) en sept 2012
Entrevista
Interviewed on campus. No nontechnical questions, got straight to technical question. Not very hard, but requires thinking. At the end, asked questions about basic computer science terminology that is important to Arista Networks' software position, and they were "virtual memory" and why is it important? The nontechnical parts were easy.
Preguntas de entrevista [1]
Pregunta 1
(a) Find the minimum value of a binary search tree. (b) Given a binary search tree with distinct integer values, find the next consecutive integer in the tree using the structure of the tree and write the code in C++.
Solicité el puesto a través de un captador. Acudí a una entrevista en Arista Networks en jun 2026
Entrevista
Pros:
Great initial approach – the recruiter thoroughly checked my GitHub profile and projects before the interview, which is very uncommon and shows they do their homework.
Cons:
A major mismatch between the job description ("Software Engineer C++") and the actual interview reality. The technical stage on CoderPad strictly tests bare-metal C98 skills: raw pointers, manual bitwise operations, and packing bytes into 64-bit integers. If you are accustomed to modern C++ (RAII, templates, safe memory management), this will feel like a massive step backward. Additionally, the time expectations for live low-level bit-shifting were unrealistic, to the point where the interviewer started solving the task themselves.
Interview was kind and not stressful, just minor mismatch of naming
Acudí a una entrevista en Arista Networks (Vancouver, BC)
Entrevista
Pretty good, not too complicated, was comfortable. Mostly LC questions, and was easy enough that you should be able to do it after doing NC150. good luck for the interview!
Starts with online test, then three rounds of technical interviews follow.
Not a lot of discussion, just go straight to the technical challenges which have to be solved in time