Arista Networks Interview | Set 3
Question Details
I had an telephonic interview with Arista Networks couple of days ago. To apply for Arista Networks (Internship) CGPA =8.5, luckily i had. Here are the details of the comp...
Full Details
I had an telephonic interview with Arista Networks couple of days ago. To apply for Arista Networks (Internship) CGPA >=8.5, luckily i had. Here are the details of the company's interview. Interviews were done using Shared editor and phone . Round 1 1. Tell me something about yourself ? 2. what do you know about arista networks ? 3.
output of given program void print() { char s[10]; gets(s); printf("%s",s); } int main() { print(); } 4. How you can check whether a machine is 64 bit or 32 bit ? 5. Print number in reverse (descending) order in BST . 6. Delete a node in DLL . 7. struct hack , struct size . 8. Do know backtracking algorithm ? 9. What is DFS , BFS ,which datastructures are used to implement this then he asked me to print BFS,DFS of a tree(t) i don't remember tree(t) . 10.Define OOP in 4 sentences . 11.Define Polymorphism . 12.Merging of list or array is good for if they are sorted , algorithm for merging of two lists time complexity of this algorithm 13.Following same question for array . 14.Following same question for array having the property as one array have enough empty space such that one array can accommodate another one , as like we have a[100] and b[40]; now we can accommodate b in a, assume we have 40 empty spaces in a. 15.sorting time of merge sort , heap sort , quick sort . 16.Define max and min heap , search time of heap . 17.Define Normalization in database . 18.Difference b/w C and Java 19.Do you have any questions ? Questions are not in correct order and some question may be from 2nd round sorry for that. Interviewer was very helpful . Round 2 1. Tell me your interest subjects and grade . 2. How will you implement phonebook such that we can search using first name? 3. Following same question , How you will do if you have one more requirement as search with last name also ? 4. Following same question if you have to search using phone number ? 5. How can you show frequent calls list (list can have at most k items) for a phonebook ? 6. Following same question , how you can solve if two or more calls have same count(and still maintaining k items only) ? 7. Find duplicates in a file containing 6 digit number(like uid) in O(n) time . 8. Implement bitArray in C . 9. Why do you want to join our company ? 10. do you have any questions ? I would like to thank GeeksforGeeks team for building such an awesome site and platform for interview preparation. After 4 days i got confirmation that you are selected for Arista Networks, feeling awesome .
About This Question
This is a reported interview question from a arista networks interview for a swe role (intern level) during the phone screen round reported in 2024.
It covers the following topics: Oop, Trees, Heap, Binary Tree, Sql, Graph, Backtracking, Recursion, Sorting, Graphs, Arrays .
More Arista Networks Interview Questions
About Arista Networks Interview Reports
This question was reported by a candidate who interviewed at Arista Networks. LeakCode aggregates interview reports from 10+ sources, including 1Point3Acres, Glassdoor, LeetCode Discuss, Blind, Reddit, Indeed, and Nowcoder. Each report is translated where necessary, deduplicated against existing entries, and tagged by company, role, round type, and reporting date.
Use this question as one calibration data point, not a memorization target. Companies typically rotate their question pools every 2-4 months; the exact wording of a 2024 question may differ from what you encounter today. The underlying pattern, difficulty level, and follow-up depth at Arista Networks are the higher-signal extractions to take from this report.
For broader preparation context, the Arista Networks interview process typically includes a recruiter screen, one or two technical phone screens, and a 4-5 round on-site loop covering coding, system design (at L4+ levels), and behavioral. Reports tagged on LeakCode show the round-by-round distribution and typical difficulty calibration. To browse questions filtered by round type and seniority, use the company hub linked above.
How To Practice This Type of Question
Solve similar problems on LeetCode under timed conditions (25-35 minutes per medium difficulty). The goal is pattern recognition: recognize the underlying technique (sliding window, two-pointer, BFS, memoized recursion, etc.) within 60-90 seconds of reading. Strong candidates verbalize their hypothesis out loud before coding, then iterate based on feedback. Weak candidates dive into implementation immediately, lose time on the wrong approach, and run out of time for follow-ups.
Companies update their question pools every 2-4 months. The exact wording of any given question may have been retired by the time you interview. Focus your prep on the pattern, not the specific problem. The patterns that appear in Arista Networks reports consistently are the ones worth investing in; one-off niche problems are not.
During Your Arista Networks Round
Apply the standard interview round template: clarify requirements (2-3 minutes), state your approach out loud and confirm direction with the interviewer (3-5 minutes), code with narration (15-25 minutes), test with concrete examples including edge cases (5 minutes), discuss optimization or trade-offs if time permits (5 minutes). This template is universally accepted across FAANG and adjacent companies; deviating from it produces weaker interviewer feedback signal.
The single most predictive failure mode in Arista Networks reports tagged "no hire": not asking clarifying questions. Interviewers are explicitly trained to weight this. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into code immediately. The clarifying-question check is often the first signal recorded in the interviewer's written notes.