J'ai postulé via une autre source. J'ai passé un entretien chez Arista Networks
Entretien
It was alright, received from an interview shortly after applying. Did an online interview with them looking at my code directly online. No behavioral questions, just technical questions. Definitely not as hard looking back at it but definitely not your standard leetcode questions.
Questions d'entretien [1]
Question 1
Basic Algorithm questions focused more around bitwise
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 1 jour. J'ai passé un entretien chez Arista Networks (Nashua, NH) en mars 2025
Entretien
I was asked 1 DSA question which was easy level. Then I was asked a C output prediction question and 1 C debugging question. The overall experience of the interview was good and fast paced.
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. J'ai passé un entretien chez Arista Networks (Santa Clara, CA) en nov. 2024
Entretien
Met recruiter (who is an engineer) at a career fair. Fast tracked to technical interview on a problem with three increasing levels of complexity, with the last version using binary search tree to search for a number within a range.
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 2 semaines. J'ai passé un entretien chez Arista Networks (Medford, MA) en nov. 2022
Entretien
Arista came to our career fair, and was shortly reached out to by an engineering manager. Process was online assessment (trivial difficulty, easier than LC easy) -> 1x60 technical. OA was any language, technical was only in C. Pressured manager for decision, ultimately got rejected due to only having 2 spots from our school available and other candidates performing just as well.
Questions d'entretien [1]
Question 1
Some sorting/frequency counting in the OA. What's the size of this struct in C? What does this snippet of code do? (related to bit operations) Find the missing element in this array (classic binary search)