Arista Networks

Role: Software Engineering Intern

College: Not Specified

Interview Date: Not Specified (experience published October 2024)

Interview Type: On-Campus, Internship

Result: Selected

Difficulty: Easy to Medium

Rounds: 2 rounds

Topics Asked: Data Structures (Tries, Linked Lists, N-ary Trees, Heaps), Algorithms (DFS, Iterative vs Recursive solutions), C/C++ programming

Experience:

Arista Networks visited the campus for internship hiring.

Online Coding Round 1: Conducted on HackerRank with 3 coding problems. All 3 problems needed to be solved for shortlisting.

• Insert a given key (string) into a Trie (easy).
• Remove duplicate elements from a circular linked list where duplicates occur consecutively (tricky due to circular nature and edge cases).
• Find the maximum sum from root to a leaf node of a given N-ary tree.

C and C++ were the allowed languages.

Round 2 (Telephonic/Face-to-face): The candidate had a telephonic interview from the Bengaluru center. The interviewer used codeshare.io.

• Discussion on the candidate's solution for problem 3 from the coding round, pointing out edge cases and asking for an iterative solution.
• Questions on Tries: optimizing space complexity, checking key presence without full depth traversal.
• Discussion on implementing a "frequently called list" (suggested using a heap).
• Discussion on the candidate's academic project related to Cloud computing.

Finally, the candidate was asked to submit grade sheets. 6 out of 13 shortlisted students were selected for the 2-month summer intern program.