Arista Networks

1. 1

   Online test

   Online assessment: timed MCQs plus three timed coding questions
   HackerRank90 min18 questionsCoding questions weighted by difficulty; point values differ between accountsofflinemixedeliminatory

   Section	Qs	Min	Topics
   MCQ	15	15	OS, graphs, MST, shortest paths, hashing, heaps, C/C++ output, aptitude
   Coding easy	1	20	greedy, sorting, heaps
   Coding medium	1	25	binary search on answer, greedy
   Coding hard	1	30	trees, path sums, interval greedy

   OS · graphs · hashing · binary search · greedy · heaps · trees

   Held on lab systems with personal computers not allowed; one account mentions poor network. Unused time rolls to the next section. Hard problem differed per candidate. Platform reported as HackerEarth by one account. Shortlist depended on test cases passed and speed. Negative marking is stated by two accounts, one is unsure.

2. 2

   Technical interview

   Technical interview round 1: coding and C fundamentals
   60 minofflineeasyeliminatory

   C pointers · arithmetic on pointers · polymorphism · BST validation · missing number · linked lists · cache locality · recursion · LRU cache design · tree diameter

   Classroom setting, live code in a shared editor; two accounts say Google Meet. Candidates described the interviewers as supportive. Round 2 followed within minutes for those selected.

3. 3

   Technical interview

   Technical interview round 2: design and verbal DSA
   45 minofflineeliminatory

   system design · ID allocation · intervals · tries · heaps · hash performance · e-commerce data structures · C++ debugging · OOP

   Length 30-60 min across accounts. Engineering manager interviewer in one account. One candidate was told on the spot that he was selected. Interviewer asked about the OA experience.

4. 4

   HR interview

   Company awareness question

   No dedicated HR round; one account was asked what he knew about the company, another says none.

Advice from candidates

29 pieces of advice, in their own words. Names removed.

• I don't remember whether it had negative marking, but we were given only 15 mins for the questions, which was not sufficient time. This section also had a good amount of weightage.

  test · 2026-27

• the shortlist was based on the number of test cases passed and how quickly you were able to solve those questions.

  test · 2026-27

• Arista’s OA got over by 7 pm, and we got the final shortlist by 10:30 pm. The interview was at 7 am the next morning, so be prepared.

  test · 2026-27

• If we had any time left on a section it was being forwarded to the next section(this was really helpful)

  test · 2026-27

Loading the other 25…

Question patterns reported

The kind of problem, not the problem itself. Our practice questions are written to match these patterns.

• Onlineremove dominated servers by power and cost
• Onlineplace k centres to minimise worst distance, binary search
• Onlinesmallest integer set hitting every interval twice
• Onlinecount leaf-to-ancestor paths with given sum
• Onlinerearrange bits of one string to maximise xor
• Onlinesplit array into k parts, endpoint-sum score
• Technicalpointer difference printed as elements and as bytes
• Technicalfind the missing number in 0..n, several approaches
• Technicalvalidate a binary search tree
• Technicalsort a three-valued linked list in one pass
• Technicalkth smallest element in a tree
• Technicalpalindrome check on a linked list
• Technicaldebug a short recursive function
• Technicalunique ID allocator with recycling for connecting devices
• Technicalminimum platforms from arrival and departure intervals
• Technicalcontact search by prefix with frequency ranking
• Technicaldiagnose slow hash table
• Technicaldesign backend data structures for buyers, sellers, ratings, prefix search
• Technicaldetect duplicate files by content
• Codingmedium-hard DP question
• Codinghard graph question
• Codinginterval with most overlaps, like non-overlapping intervals variant
• Technicalfind bugs and predict output of C pointer program
• Technicalreorder linked list by splitting, reversing half and merging