Arista Networks interview questions
Online test → Technical
DSA
Showing 31 of 85 reported in this area
Implement an LRU (Least Recently Used) Cache.
Implement a Bit Array in C.
Find an element in a bitonic array.
Reverse a linked list in groups of size k.
Discuss and solve a graph traversal problem.
Perform topological sorting of a graph using DFS.
Maintain the k most frequently dialed phone numbers.
Print the vertical order traversal of a binary tree.
Explain or solve a problem based on trie data structures.
Rearrange a given linked list in-place in a specific order.
Print the nth Fibonacci number (n ≤ 20000) in hexadecimal form.
Divide a linked list into k parts and perform required operations.
Find duplicates in a file containing 6-digit numbers in O(n) time.
Design a stack that supports getMin() in O(1) time and O(1) extra space
Find the maximum sum from the root to a leaf node in a given n-ary tree.
Find duplicate digits in a 6-digit number in O(n) time and minimum space.
Design a feature to show the most frequent calls list with at most k items.
Given a sorted integer array, convert it into a balanced Binary Search Tree.
Identify and implement a Fibonacci-based pattern by analyzing given test cases.
Suggest a data structure to search in a sorted linked list in better than O(n) time.
Modify the frequent calls design to handle ties while still maintaining only k items.
Merge two arrays where the first array has enough empty space to accommodate the second array.
Design a stack that supports push, pop, and getMin operations in O(1) time and O(1) extra space
Which data structure would you use to implement string prediction/autocomplete as in mobile phones?
Given a parent directory, how would you insert a new directory into your file system data structure?
Find the mean and median of elements when numbers are dynamically added at runtime. Explain the approach.
What are DFS and BFS? Which data structures are used to implement them, and print DFS and BFS of a given tree.
Write a search function to find a given directory by name across all directories in the file system structure.
How would you implement a frequently-called contacts list that returns the top K most frequently contacted people?
Given a binary tree and two values a and b, find the shortest distance between the nodes containing values a and b.
Modify the solution to find maximum root-to-leaf sum in an n-ary tree using an iterative approach instead of recursion.
CS fundamentals
Showing 20 of 75 reported in this area
Explain pointers and dynamic memory allocation in C.
What is object slicing in C++?
Explain the structure hack in C.
Explain structure padding and alignment in C.
Predict the output of a C program based on fork().
Explain threads and their usage in operating systems.
How would you optimize the space complexity of a trie?
How are ordered_maps implemented internally in C++ STL?
Compute the size of a structure in C (struct hack involved).
What is the critical section problem and what are its solutions?
Explain the struct hack in C and how structure size is calculated.
Explain networking sockets and how they are used for communication.
How would you implement a dynamic array (similar to C++ STL vector) in C?
Allocate an m x n 2D array in C such that it can be accessed as arr[i][j].
Explain deadlocks and process synchronization mechanisms in operating systems.
Write C code using pointers and dynamic memory allocation with malloc and calloc.
Explain HashMap implementation details and different collision resolution techniques.
Explain the memory layout of a C program and where different types of variables are stored.
Identify and explain errors related to modifying read-only strings and constant pointers in C programs.
Predict the output of the following C program: int main(int argc, char *argv[]) { printf("%c", **++argv); }
System design
Showing 8 of 13 reported in this area
Design and implement a basic web crawler.
Extend the phonebook design to support searching by phone number.
Design a phonebook data structure to support searching by first name.
Extend the phonebook design to support searching by last name as well.
Implement a hash map class and explain hashing and collision resolution techniques
Design a phone directory to store phone numbers and retrieve information based on the number.
Design a phonebook system that stores names and phone numbers and supports efficient prefix-based search.
Design a system like Zomato to answer queries such as which nearby restaurants are serving a particular dish.
Behavioural
1 questions reported in this area
Discuss the impact of AI and automation in networking, covering different aspects such as efficiency, scalability, and future challenges.
asked oncePractice this →
Showing 60 of 152 questions. Ranked by how often the same question came back across reports.
Practise a Arista Networks-style interview
A spoken interview built from these questions, scored when you finish; the report is yours.
Start practisingCommon questions
What questions does Arista Networks ask?
Candidate interview reports most often cover DSA (48%) and CS fundamentals (43%).
How many rounds does Arista Networks interview have?
Candidate interview reports show an average of 3.1 rounds per experience, with a typical sequence of Online test → Technical. Individual interview paths can vary.
Is the Arista Networks interview hard?
Among questions with a reported difficulty, the mix is easy 36%, medium 57%, hard 7%.