Arista Networks Interview Experience | Round 1 (C++) |
- Posted
- 3 Oct 2026
Summary
I completed the first round of the Arista Networks interview in May 2026, which included debugging and data‑structure questions, received positive HR feedback, but was not moved to the next round.
How it went
Arista Networks, 1st round: May 2026: in complete c++ **Round 1 : **
asked 2 debugging questions, and follow up to correct it: a)https://leetcode.com/discuss/post/7243710/arista-network-interview-experience-by-a-j093/
b) output based on object and declaration after destructor,in class. Focused on memory layout and how memory is assigned in stack
asked 2 data structure questions:
- remove all nodes from linked list that are repeated:(complete the given function in VS code, and make it runnable ) 1->1->2->2->2->3->4->4 : o/p: 3
- (complete the given function in code base, and make it runnable)array numbers are given in sorted asending form,print the 1 missing number : {1,2,3,4,5,6,8,9} . o/p : 7 {11,12,14,15,16} o/p: 13
HR informed positive feedback, but rejected due to director resume review. Didn't heard anything for Round 2.
Questions asked (4)
- 01
Debugging Question (LeetCode Discuss Link)
Data Structures & Algorithms
Open the problemDebug the C++ code provided in the LeetCode Discuss post linked below.
- 02
Object Destruction and Memory Layout Question
Data Structures & Algorithms
Determine the output based on object and declaration after destructor in a class, focusing on memory layout and how memory is assigned on the stack.
- 03
Remove All Duplicate Nodes from Linked List
Data Structures & Algorithms
Given a singly linked list, remove all nodes that have duplicate values entirely. Example input: 1->1->2->2->2->3->4->4, expected output: 3.
- 04
Find Missing Number in Sorted Array
Data Structures & Algorithms
Given a sorted ascending array with one missing number, find the missing number. Example: {1,2,3,4,5,6,8,9} → missing 7; {11,12,14,15,16} → missing 13.