30 questions · from 9 interviews · 1 asked more than once
Arista Networks interview questions
Every question candidates reported from their Arista Networks interviews, most frequently asked first. Each links to the write-up it came from, so you can see the round and how it went.
Arista Networks coding and DSA questions
- 01
Time Based Key-Value Store
I was asked the Time Based Key-Value Store LeetCode question.
Hard · Asked 2 times · From Arista Networks | Senior Software Engineer | Bengaluru
- 02
Debugging Question (LeetCode Discuss Link)
Debug the C++ code provided in the LeetCode Discuss post linked below.
- 03
Object Destruction and Memory Layout Question
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.
- 04
Remove All Duplicate Nodes from Linked List
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.
- 05
Find Missing Number in Sorted Array
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.
- 06
Java Deadlock Scenario Analysis
I was shared a Java code snippet to tell what would happen if the code runs. It was a deadlock scenario basically.
- 07
Deadlock Detection and Resolution in Code Snippet
I was presented with a small code snippet and asked to identify a deadlock, discuss its implications, and then propose a resolution. The interviewer gave an example scenario to illustrate the type of deadlock: 'If user A wants to transfer money to user B, and…
Hard · From Arista networks || SDE-2
- 08
Search in Rotated Sorted Array
Given a sorted array that has been rotated at some pivot unknown to you beforehand, search for a given target value. If the target is found in the array, return its index, otherwise return -1. You may assume no duplicate exists in the array.
- 09
Longest Substring Without Repeating Characters
Given a string s, find the length of the longest substring without repeating characters.
- 10
String to Integer (atoi)
Implement the myAtoi(string s) function, which converts a string to a 32-bit signed integer. The function should handle leading whitespace, an optional sign, and digits, stopping at the first non-digit character. It must also consider edge cases like empty…
Medium · From Arista Networks Interview Experience
- 11
Implement strlen in C
Implement the standard C library function sizet strlen(const char str), which computes the length of the string str. The length is defined as the number of characters in the string, excluding the terminating null character.
Easy · From Arista Networks Interview Experience
- 12
Doubly Linked List Operations
Create a Doubly Linked List class. Write Instance Methods for this class to be able to 1. remove all the nodes in the doubly linked list which have their value equal to a given value. 2. Insert a node at a desired position (node and position are given). The…
- 13
Find Element in Sorted Rotated Array
Find element in sorted rotated array
- 14
How Many Numbers Are Smaller Than the Current Number
How Many Numbers Are Smaller Than the Current Number
- 15
Remove All Subtrees Where All Node Values Are 0
Remove all subtrees where all node values are 0
- 16
Find Minimum in Rotated Sorted Array
Given a sorted array that has been rotated at some pivot unknown to you beforehand, find the minimum element. You may assume no duplicate exists in the array.
Easy · From Arista Networks | Interview Experience
- 17
Insert Delete GetRandom O(1)
Design a data structure that supports inserting, deleting, and getting a random element in O(1) average time. All operations should be efficient and handle edge cases.
Medium · From Arista Networks | Interview Experience
- 18
Internal Working of HashMap
An in-depth discussion on the internal working mechanisms of a HashMap data structure, including collision resolution strategies, resizing logic, and factors affecting its performance.
- 19
Numbers Smaller Than Current
Given an array nums , for each nums[i] find out how many numbers in the array are smaller than it. That is, for each nums[i] you have to count the number of valid j 's such that j != i and nums[j] < nums[i] . Input: [8,1,2,2,3] Output: [4,0,1,1,3]
Medium · From Arista Networks | 6 yrs experience
- 20
Count Special Nodes in Tree
A node X is said to be special if in the path from root to X there are no nodes with a value greater than X. Return the number of valid special nodes in the tree. Example: 3 / \ 1 4 / / \ 3 1 5 Valid nodes: 4 (3, 4, 5, 3).
Medium · From Arista Networks | 6 yrs experience
Arista Networks system design questions
- 01
How TLS Works in Detail
I was asked how TLS (Transport Layer Security) works in detail.
- 02
Debugging Slow APIs
I was asked how I would debug if an API is slow.
- 03
Top-K System for Log Analysis
A top-k system question where there were multiple servers receiving logs from main system about which (ip,port) is trying to call the system with what kind of packets and had various queries like which ip address was the highest, which server is handling more…
- 04
Low-Level Design (LLD) of a Parking Lot System
Design a Low-Level Design (LLD) for a Parking Lot system, focusing on identifying core entities, defining classes and their relationships, and implementing mechanisms for concurrency handling.
Medium · From Arista Networks | Interview Experience
- 05
Low-Level Design Discussion
I was asked to discuss Low-Level Design principles. This included detailing the design of classes, interfaces, attributes, and methods, with the constraint of not using databases or advanced data structures. Additionally, I needed to explain UI interaction,…
- 06
Design a URL Shortener
I was asked to design a URL shortener system. The requirements included: Support for custom user-defined short URLs (e.g., www.google.com/news/date/123/xcxcxcxc mapping to tiny/news ). Support for auto-generated short URLs (e.g., www.dfssss mapping to…
Hard · From Arista Networks | 6 yrs experience
Arista Networks other questions
- 01
Java Singleton Pattern
Explain the Singleton design pattern in Java, including its purpose, common implementations (e.g., eager, lazy, thread-safe), and scenarios where it is typically used.
- 02
Java static keyword
Describe the static keyword in Java. Discuss its usage with variables, methods, and blocks, and explain its implications for memory management and access.
- 03
Java final keyword
Explain the final keyword in Java. Discuss its application to variables, methods, and classes, and describe the behavior and restrictions it imposes in each context.
- 04
Current Project Architecture Discussion
A deep dive into the architecture of the candidate's current project, including components, technologies used, design choices, challenges faced, and how they were addressed.
Arista Networks interview questions FAQ
What questions are asked in Arista Networks interviews?
Candidates reported 30 distinct questions across 9 Arista Networks interviews. 20 coding and DSA questions, 6 system design questions, 4 other questions.
Which Arista Networks interview questions are asked most often?
The most repeated are "Time Based Key-Value Store" (2 times).
How difficult are Arista Networks interview questions?
Of the questions candidates rated, 20% were easy, 50% medium and 30% hard.