Arista Networks

Role: Software Engineer

College: Not Specified

Interview Date: Not Specified (experience published July 2025)

Interview Type: Full-Time

Result: Cleared Round 1, scheduled Round 2

Difficulty: Medium to Hard

Rounds: 1+ rounds

Topics Asked: Data Structures (Tries, Stacks), Algorithms (Kadane's Algorithm), C++ (memory allocation, pointers, bitwise operations)

Experience:

This experience details Round 1 for a Software Engineer role at Arista Networks, focusing on problem-solving and DSA.

Round 1 (Coding + Problem Solving): The interview started directly with a CoderPad link.

• Warm-up questions covered runtime complexity, memory allocation (`malloc`/`free`), pointers, and a bitwise puzzle.
• A problem involving processing a stream of numbers was given, which the candidate solved.
• Three DSA questions ranging from medium to hard were asked, to be coded in C++.
• One question was to find the maximum subarray sum in an array of integers (Kadane's Algorithm, O(N) time, O(1) space).
• Another was to implement a stack that returns the minimum element in constant time.
• A design problem: implement an autocomplete feature for phone numbers using a Trie data structure, including insertion and search functions.

The candidate felt the round went well despite a slight fumble on the memory allocation question. The recruiter confirmed clearing Round 1 and scheduled Round 2.