J'ai postulé en ligne. J'ai passé un entretien chez Arista Networks
Entretien
Interview was at their office with team lead or manager. He asked me to program variation of binary search in C and started watching me do it on his PC constantly smiling and making faces if I struggle for a moment or if I make and correct a mistake. Very unpleasant guy.
Next day they invited me to talk with another manager asking behavioral questions etc.
They came up with a offer which was way below what I expected, so I immediately said no. They tried to negotiate but not much.
Overall unpleasant experience. It was a waste of time for me.
Questions d'entretien [1]
Question 1
Find missing number in sorted array of integers. Implement function that returns missing number in C.
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