i
Arista
Networks
Filter interviews by
Real-time synchronization of todo list across multiple devices using short polling and web sockets.
Implement short polling to regularly check for updates on the server and update the UI accordingly.
Use web sockets for real-time communication between devices to instantly push updates to all connected clients.
Maintain a centralized database to store and retrieve the todo list data for all devices.
Utilize a messaging...
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...
Packets travel in a switch network by being forwarded based on the destination MAC address.
Packets are received by the switch on an incoming port.
The switch looks up the destination MAC address in its MAC address table.
If the MAC address is found, the packet is forwarded out the corresponding port.
If the MAC address is not found, the packet is flooded out all ports except the incoming port.
Switches operate at Laye...
Traverse a directory in JavaScript using Node.js to list files and subdirectories.
Use the 'fs' module to interact with the file system: const fs = require('fs');
Use 'fs.readdir' to read the contents of a directory: fs.readdir(path, callback);
Recursively call the function for subdirectories to traverse deeply.
Example: function traverseDir(dir) { fs.readdir(dir, (err, files) => { ... }); }
A Linkedlist is not inherently a palindrome, but it can be checked for palindrome by comparing the elements from both ends.
To check if a Linkedlist is a palindrome, we can reverse the second half of the list and compare it with the first half.
Alternatively, we can use a stack to store the first half of the list and then compare it with the second half while popping elements from the stack.
For example, if the Linke...
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
A Trie is a tree-like data structure used for efficient retrieval of strings. It supports insertion and search operations.
A Trie is also known as a prefix tree.
Each node in the Trie represents a character.
The root node represents an empty string.
Each node can have multiple children, each representing a different character.
Insertion involves traversing the Trie and creating new nodes as needed.
Search involves trave...
The question asks to find the memory of a given structure by considering struct padding.
Struct padding refers to the unused bytes added to align the members of a structure.
To find the memory of a structure, we need to consider the size of each member and the padding added.
The total memory of a structure is the sum of the sizes of its members and the padding.
Code to find the position of a number in a BST
Implement a recursive function to traverse the BST
Compare the target number with the current node value
If the target is smaller, go to the left subtree; if larger, go to the right subtree
Repeat until the target is found or the subtree is null
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.
I appeared for an interview in Jan 2025, where I was asked the following questions.
I appeared for an interview in Apr 2025, where I was asked the following questions.
I appeared for an interview in Jun 2025, where I was asked the following questions.
To delete a node in a linked list when given a pointer to that node, copy the next node's data and adjust pointers.
1. Given a pointer to the node to be deleted, we cannot directly access the previous node.
2. Copy the data from the next node to the current node.
3. Adjust the current node's pointer to skip the next node.
4. Free the memory of the next node to avoid memory leaks.
Example: If deleting node with value 3 in 1 ...
To check if a linked list is a palindrome, compare the first half of the list with the reversed second half.
Traverse the linked list to find the middle node
Reverse the second half of the linked list
Compare the first half with the reversed second half to check for palindrome
Understanding C++ pointers and address debugging is crucial for effective memory management and error resolution.
Pointers store memory addresses, allowing direct access to variables.
Example: int* ptr = &var; // ptr holds the address of var.
Dereferencing a pointer: *ptr gives the value at the address stored in ptr.
Pointer arithmetic: ptr++ moves the pointer to the next memory location.
Null pointers: Always initializ...
Hashmap in C/C++ stores key-value pairs using a hash function for fast retrieval.
Hashmap uses a hash function to map keys to indices in an array.
Collision handling is done using techniques like chaining or open addressing.
Hashmap allows for fast insertion, deletion, and lookup of key-value pairs.
Example: std::unordered_map in C++ implements a hashmap.
Debugging hashmap code involves checking hash function, collision res...
I applied via Approached by Company and was interviewed in Jul 2024. There were 3 interview rounds.
Design a data structure for LRU cache with get and put operations, evicting least recently used item when capacity is reached.
Implement a doubly linked list to keep track of the order of keys based on their usage
Use a hashmap to store key-value pairs for quick access
Update the order of keys in the linked list when a key is accessed or inserted
Evict the least recently used item when the cache reaches its capacity
A unique ID generator creates distinct identifiers for entities, ensuring no duplicates across a system.
Use UUIDs (Universally Unique Identifiers) for global uniqueness. Example: '550e8400-e29b-41d4-a716-446655440000'.
Timestamp-based IDs can ensure uniqueness over time. Example: '20231005123000' for a timestamp.
Combining user-specific data with random elements can create unique IDs. Example: 'user123-abc456'.
Consider u...
I applied via Approached by Company and was interviewed in Mar 2024. There were 3 interview rounds.
Javascript concepts. Polyfill for debounce. Event loop. Questions based on your resume.
Implement session locking to prevent concurrent ticket booking by multiple users.
Implement session locking mechanism to ensure only one user can book tickets at a time.
Use a unique session ID for each user to track their booking process.
Lock the session when a user starts booking tickets and release the lock once the booking is completed.
Display a message to other users trying to book tickets if the session is already ...
Real-time synchronization of todo list across multiple devices using short polling and web sockets.
Implement short polling to regularly check for updates on the server and update the UI accordingly.
Use web sockets for real-time communication between devices to instantly push updates to all connected clients.
Maintain a centralized database to store and retrieve the todo list data for all devices.
Utilize a messaging queu...
Developed a responsive e-commerce website using React and Redux
Utilized React for building the user interface
Implemented Redux for managing the application state
Designed a responsive layout for optimal viewing on different devices
I appeared for an interview in Mar 2025, where I was asked the following questions.
Overview of packet formats for various network protocols including ARP, IP, OSPF, BGP, and MPLS.
ARP (Address Resolution Protocol): Used to map IP addresses to MAC addresses. Packet includes hardware type, protocol type, hardware size, protocol size, opcode, sender MAC, sender IP, target MAC, target IP.
IP (Internet Protocol): Responsible for addressing and routing packets. IPv4 header includes version, header length, ty...
I applied via Recruitment Consulltant and was interviewed in Aug 2024. There were 2 interview rounds.
Yes, I am willing to join Arista as a Software Engineer.
I am excited about the opportunity to work at Arista and contribute to their innovative projects.
I have researched the company and believe that my skills align well with their values and goals.
I am confident that I can make a positive impact on the team and help drive success at Arista.
One Hr interview with 3-4 coding questions on strings,array and linked list
Check if a string containing parenthesis, curly brackets, and square brackets is valid.
Use a stack to keep track of opening brackets
Pop from stack when encountering a closing bracket, ensuring it matches the corresponding opening bracket
Return false if stack is not empty at the end
Top trending discussions
Some of the top questions asked at the Arista Networks interview -
The duration of Arista Networks interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 39 interview experiences
Difficulty level
Duration
based on 91 reviews
Rating in categories
5-8 Yrs
Not Disclosed
3-5 Yrs
Not Disclosed
Software Engineer
238
salaries
| ₹28.9 L/yr - ₹50 L/yr |
Software Developer
36
salaries
| ₹24.7 L/yr - ₹46 L/yr |
Senior Software Engineer
34
salaries
| ₹29.6 L/yr - ₹45.3 L/yr |
Softwaretest Engineer
29
salaries
| ₹15.8 L/yr - ₹32.8 L/yr |
Technical Solutions Engineer
16
salaries
| ₹12 L/yr - ₹21 L/yr |
Indus Towers
Sterlite Technologies
Cisco
BT Business