Arista Networks Interview Questions, Process, and Tips

There were 2 coding questions and 20 aptitude questions. Coding questiins were based in trees and graphs

Q1. Mainly dsa, oops questions were asked
Add your answer
Q2. Find cycle in linked list
Ans. 
Use Floyd's Tortoise and Hare algorithm to detect cycle in a linked list.
• Initialize two pointers, slow and fast, at the head of the linked list.

• Move slow pointer by one step and fast pointer by two steps.

• If they meet at any point, there is a cycle in the linked list.

• If fast pointer reaches the end of the list, there is no cycle.
Answered by AI
Add your answer

DSA round of 1 hour and asked 2 Medium level LC questions

Q1. High level design of a cache
Ans. 
A cache is a high-speed data storage layer that stores a subset of data, typically transient in nature, so that future requests for that data are served faster.
• Define the cache size and eviction policy

• Choose a suitable data structure for the cache (e.g. hashmap, linked list)

• Implement methods for adding, retrieving, and removing data from the cache

• Consider concurrency control mechanisms to handle multiple access to the ...read more
Answered by AI
Add your answer

Q1. Design a routing table with insert delete and forward functionality. Define its class also
Ans. 
Design a routing table with insert, delete, and forward functionality in a defined class.
• Create a class called RoutingTable with methods for insert, delete, and forward

• Use a data structure like a hash table or tree to store routing information

• Implement insert method to add new routes, delete method to remove routes, and forward method to look up and forward packets
Answered by AI
Add your answer

Q1. Javascript basics - event loop, type conversion, call apply bind
Add your answer

Q1. Design discussion, current project
Add your answer

Had codility pad with multiple C/C++ questions
max sum sub array
bit wise operation
template class

Q1. Tell us about yourself
Add your answer
Q2. Tell me about your work experience
Add your answer