← Back to Directory

Arista

Large Enterprises

Screna has 4 Arista interview write-ups. The most reported round is the technical phone screen (4).

4 interview notes · updated Jun 2026

Arista·Software Engineer·Technical Phone Screen

Jun 2026
Arista Networks coding round had a twist on a classic problem that I almost fumbled because I made a dumb assumption at the start. Worth knowing what to expect going in.
  • Given an array containing all integers in some range L to R with exactly one missing, find the missing number. The range does not start from zero.

“My first instinct was the classic Gauss formula and I started writing it for 0 to n before catching myself.”

View Post

Arista·Software Engineer·Technical Phone Screen

Jun 2026
Arista Networks software engineer interview with a debugging-focused technical question that had a sneaky follow-up. The main question was straightforward enough but the follow-up is where things got interesting.
  • You're given a buggy code snippet where the root cause is an out-of-bounds memory access. Find the bug and explain how to fix it.

“Pretty standard debugging exercise on the surface.”

View Post

Arista·Software Engineer·Technical Phone Screen

Apr 2026
Interviewed for a software engineer role at Arista Networks and got a pretty standard coding question around string manipulation. Nothing too wild, but they did push on edge cases and complexity at the end which I wasn't fully prepared for.
  • Write a function to check if a string is a palindrome. Make sure to handle edge cases like empty strings and null input, then walk through the time and space complexity of your solution.

“I got the basic logic down fast, reverse and compare, but then they asked about null input and I had kind of glossed over it in my head.”

View Post

Arista·Software Engineer·Technical Phone Screen

Apr 2026
Interviewed for a software engineering role at Arista Networks and got a linked list problem that looked straightforward but had a few edge cases worth thinking through carefully.
  • Given the head of a singly linked list and an integer target, remove all nodes whose value equals the target and return the new head. The target can appear anywhere in the list, including at the head or tail. What is the time and space complexity, and how does the dummy-head approach help?

“I jumped straight to the two-pointer approach without pausing to think about the head-removal edge case, which bit me.”

View Post