Arista Networks·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.” The rest of the author's notes on Software Engineer interview at Arista Networks, Technical Phone Screen round, covers how they worked through the question, what the panel pushed back on, and what they would do differently.
View Post