Le processus a pris 2 semaines. J'ai passé un entretien chez Arista Networks
Entretien
They will provide you a laptop. A code will be given in C. Couple of questions like find a bug in code and fix it. Implement some functionality. Example,
1) bug in the code was char array overflow which was causing Segmentation Fault.
2) Implementation of Delete node in BST and count the nodes in tree. These were not straight forward questions. Like to count nodes they had wrapper function which had function pointer. And the logic was to be implemented in that function pointed by function pointer.
Questions d'entretien [2]
Question 1
Questions around the logic which we have used like in char array over flow, why segmentation fault was thrown at the time of returning from function?
J'ai postulé via un recruteur. J'ai passé un entretien chez Arista Networks en juin 2026
Entretien
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
J'ai passé un entretien chez Arista Networks (Vancouver, BC)
Entretien
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