← Back to Directory

Arista

Large Enterprises

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

9 interview notes · updated Jul 2026

Arista·Software Engineer·Technical Phone Screen

Jul 2026
Arista software engineer interview with a C/C++ debugging question that had a sneaky follow-up I wasn't fully ready for.
  • You're given a C or C++ snippet with a bug caused by out-of-bounds memory access. Identify the bug and explain why it's unsafe.
  • Given that invalid memory access usually causes a segfault, why might this particular program instead run indefinitely and appear to loop forever?

“Pretty standard stuff if you've done any low-level C work.”

View Post

Arista·Software Engineer·Technical Phone Screen

Jul 2026
Interviewed for a software engineer role at Arista Networks and got a linked list problem that looked easy on the surface but had enough edge cases to trip you up if you weren't careful about how you handled the head pointer.
  • Given the head of a singly linked list and an integer target, remove all nodes with that value and return the new head. The target can appear at the head, middle, or tail any number of times.

“My first instinct was to just walk the list and splice out matching nodes, which works fine for the middle and tail.”

View Post

Arista·Software Engineer·Technical Phone Screen

Jun 2026
Did a coding round for a Software Engineer role at Arista. One question, linked list manipulation, nothing flashy but it required some care to get right in-place.
  • Given the head of a singly linked list and a target integer, remove all nodes with that value and return the updated head. Do it in-place, no auxiliary list.

“Seems straightforward until you realize the head itself might need to be removed.”

View Post

Arista·Software Engineer·Technical Phone Screen

Jun 2026
Arista Networks SWE interview with a debugging-focused question that had a pretty nasty follow-up. The main question was manageable 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.
  • The out-of-bounds write doesn't cause a segfault here, it causes an infinite loop instead. Why?

“Pretty standard debugging exercise on the surface.”

View Post

Arista·Software Engineer·Technical Phone Screen

Jun 2026
Arista software engineer interview with a binary search problem that looks straightforward until you actually sit down and think about the edge cases. The O(log n) constraint is what makes it interesting.
  • Given a sorted array of distinct integers that should form a consecutive sequence (possibly starting at any integer), find the one missing number if it exists, or return null if nothing is missing. Must run in O(log n) time and O(1) space.

“My first instinct was to just compute the expected sum and subtract, which is O(n) and they shut that down immediately.”

View Post

Arista·Software Engineer·Technical Phone Screen

Jun 2026
Coding interview for a software engineer role at Arista. Two problems, both with complexity analysis required. Nothing too wild but the binary search follow-up on the second problem is where things get interesting.
  • Write a function to check if a string is a palindrome. Handle null input and treat an empty string as a valid palindrome.
  • Given a sorted array of distinct integers forming a consecutive sequence with exactly one missing number (sequence doesn't necessarily start at 0), find the missing number. First explain an O(n) solution, then optimize to O(log n) using binary search.

“Pretty standard.”

View Post

Arista·Software Engineer·Technical Phone Screen

May 2026
Technical phone screen for a software engineer role at Arista, heavy on C fundamentals and memory model questions. Pretty low-level stuff, felt like they wanted to see if you actually understood what the compiler and OS are doing under the hood.
  • Given `const char *c = "12345"`, what does each of these printf calls actually do: `printf("%s", c)`, `printf("%d", c)`, `printf("%c", c)`, `printf("%c", *c)`, `printf("%c", *(c+1))`, and what's the correct way to print the address stored in `c`?
  • How would you use gdb or lldb to inspect the pointer value of `c`, the raw bytes at that address, and the string stored there?
  • Compare malloc/free versus new/delete in C and C++, covering initialization behavior, constructor and destructor calls, type safety, failure handling, and array variants.
  • What typically lives in the stack, heap, data segment, BSS segment, and text segment? Where does a string literal like "12345" end up?

“The %s and %c with dereference cases were fine, but I fumbled on %d and %c with c directly.”

View Post

Arista·Software Engineer·Technical Phone Screen

May 2026
Arista Networks coding round, one algorithm question that looks simple but has a sneaky twist. Worth reviewing the classic missing number problem before you go in, because they specifically push you past the easy version.
  • Given a sorted array that contains all integers in some range [L, R] except one, find the missing number. Be prepared to discuss multiple approaches and their tradeoffs.

“I jumped straight to Gauss summation and got it working, sum of L to R minus the actual array sum gives you the answer, O(n) time O(1) space.”

View Post

Arista·Software Engineer·Technical Phone Screen

Apr 2026
Coding round at Arista Networks for a software engineer position. Pretty standard stuff, one algorithm question with a follow-up on complexity. Nothing too wild but they did push on edge cases more than I expected.
  • Write a function to check if a string is a palindrome. Make sure to handle empty strings and null input, then walk through the time and space complexity of your solution.

“I jumped straight into the logic and forgot about null for an embarrassingly long time.”

View Post