Ho presentato la mia candidatura online. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso Arista Networks (Dublino, Dublino) nel mese di ott 2022
Colloquio
Hackerrank algorithms question for the first round. A two day wait and then an invitation to a technical screen with a software engineer for the second round which was done over zoom and lasted an hour.
Domande di colloquio [1]
Domanda 1
Question about bit shifting for signed and unsigned bytes.
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Arista Networks (Nashua, NH) nel mese di mar 2025
Colloquio
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.
Ho presentato la mia candidatura tramite l'università. Ho sostenuto un colloquio presso Arista Networks (Santa Clara, CA) nel mese di nov 2024
Colloquio
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.
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso Arista Networks (Medford, MA) nel mese di nov 2022
Colloquio
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.
Domande di colloquio [1]
Domanda 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)
