Open In App

Arista Networks Interview | Set 5 (On-Campus)

Last Updated : 21 Aug, 2016
Improve
Improve
Like Article
Like
Save
Share
Report

Arista Networks came to our campus. Initially, all the branches were allowed and the percentage criterion was 60%. But in the subsequent round, students from only COE, IT were shortlisted. For the next round we were asked to give our resumes and percentages. Students were then shortlisted based on these two. It was apparent that the percentage criterion was updated to 70-75% (as only the students having above 70-75% were selected).

The next round was online coding round on Hackerrank platform. 4 questions were asked ( 1 was very easy but the rest 3 were more of comprehension type and were relatively difficult ). Those who were able to do more than 2 were selected for the next round (PS: Only 4 were selected)

The final round was interview round. We got interviewed for 1-1.5 hours each. The interviewer asked us questions about DS and Algorithms. We were asked to write code and check it.

Interview Questions:

1) Tell me the differences between insertion sort and quick sort. When would we use insertion sort over quick sort?

2) If you are given a small pattern of bits which is to be searched in potentially infinite ,continuous text of bits. How will you search the pattern? Remember the text cannot be stored since it is potentially infinite in length and the bits are coming one by one.

Follow up question –
Now if the pattern length can be between 500-12000 bits. How will you do the above question in O(n) time?

(Hint – Think of pattern as int and compare it one by one)

3) How are files and directories organised in a Linux system? How will you implement it in C. Design a data structure for it.
Now you are given a parent directory in which new directory is to be inserted. How will you do it?
Write a search function for the above data structure that searches for a given directory in all the directories.

4) Questions on deadlocks, process synchronisation etc.

What do you know about Arista? What work do we do? Do you have any questions?

Finally 3 were selected amongst us.


Similar Reads

Arista Networks Interview | Set 4 (On-Campus for Internship)
Arista recently visited our campus for interns. There were three rounds in total. Initially students were shortlisted based on CGPA(8+). Then there was a primary online coding round following which there were two interviews. 1. Coding round on hackerrank There were three coding questions to be solved in 90 minutes. Question 1. The question was base
3 min read
Arista Networks Interview | Set 6 (On-Campus)
Recently Arista Networks visited our campus for hiring interns and full timers. Minimum CGPA required was 8.5.There were a total of 3 rounds. Round 1 : Online coding round conducted on Hacker Rank(1.5 hours) There were 4 coding questions and 5 MCQ's to be solved in 90 minutes. Q1 Remove adjacent elements from circular linked list if they are same.
3 min read
Arista Networks Interview Experience for FTE (On-Campus)
Recently Arista Networks visited our campus. Min CGPA requirement was 8. There was an online coding test followed by 3 FTF interviews on G-meet. Round 1: Online coding round conducted on Hacker Rank(1.5 hours) (Allowed Languages- C, CPP) Minimum time required to reach a given cell (x, y) from (0,0). A particular cell may have a wall i.e. you cannot
5 min read
Arista Networks Internship Interview Experience for Software Developer (On-Campus)
Arista Networks Internship Experience 2021-22. It was open for CS, ECE, EEE, EIE branch, CGPA cutoff to apply for Arista was 8 and I was just lucky to apply for it as my CGPA is just 8+, almost 85 people appeared for the Coding round. Coding Round: The duration was 1.5 hours and it was conducted on Hacker-rank, consisted of 15 MCQs and 3 coding que
4 min read
Arista Networks Interview Experience for Software Engineer (On-Campus)
I applied to Arista Networks through the Placement Cell of my institute and everyone who applied received the online test link. Round 1(Coding and Aptitude - Duration: 60 Minutes): Platform: HackerRank The format was as follows: Section Number of Questions Type Duration (Minutes) 1 15 MCQ15 2 1 Coding - Easy20 3 1 Coding - Medium25 Total 17 60 The
2 min read
Arista Networks Interview Experience for Software Engineer (On-Campus)
I applied to Arista Networks through the Placement Cell of my institute and everyone who applied received the online test link. Round 1(Coding and Aptitude - Duration: 60 Minutes): Platform: HackerRank The format was as follows:- SectionNo of QuestionsTypeDuration115MCQ1521Coding - Easy2031Coding - Medium25Total17 60 The MCQs were from core CSE sub
2 min read
Arista Networks Interview Experience for Internship 2021 (On-Campus)
Arista Networks visited our campus in August 2021 for an internship. Round 1- Online Coding Round (Duration: 75 mins): Online test on HackerRank platform consisted of 3 coding questions. Given an array representing positions of n cars in a parking lot. Find the minimum length of the roof to cover k cars.Given a pile of stones, smash the largest two
4 min read
Arista Networks Interview | Set 3
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 gi
3 min read
Arista Networks Interview | Set 7 (For Internship)
Arista Networks visited our campus to offer internships. Online Coding Round 1 : The test was on Hackerrank and we were given 3 coding problems. 1. Insert a given key (a string) into a trie. (easy if you know about tries) 2. Remove duplicate elements from a circular linked list and the duplicates occur consecutively in the list. It was tricky becau
4 min read
Arista Networks Internship (On campus)
Arista Networks visited our campus for internships Round 1: The first round consisted of 3 online coding questions. Hackerrank was used as the platform. 1. The maximum sum of an N-ary tree 2. Inserting and searching in a Trie (easy if you know Trie) 3. Sorting linked list each of elements which is connected to another linked list that must also be
2 min read