I applied through other source. The process took 3 weeks. I interviewed at Arista (San Jose, CA) in Nov 2022
Interview
As a new graduate position. The first round was general questions, easy. The interviewer was friendly and lovely. In the second round, they will match you with someone. I am good at cloud. But the process experience was not good. The interviewer is from Extensible Operating System, and all the questions are about the operating system, old and basses . No one ever told you this, my field is not that. He didn't take anything from your resume. He asked all the questions about the operating system. I don't know why for a new grad job all the questions are not based on the person's field and experience even though they say they will match you with good one. It's a horrible experience for new graduates.
Interview questions [1]
Question 1
First round, binary search Second, topological sort,
I applied through a recruiter. The process took 4 weeks. I interviewed at Arista in Apr 2022
Interview
Had to solve a Hackerrank coding problem with 100% succeeding tests in 60 minutes. After that we arranged a 90 minutes long pair programming call. The call was arranged on Google Meets.
Their response time was good.
Interview questions [3]
Question 1
Reformat string in alphanumeric blocks of 3 characters delimited with spaces. At the end of resulting string may contain 1 or 2 blocks with length of two.
I applied online. The process took 1 day. I interviewed at Arista in May 2018
Interview
Accepted Offer
Application
I applied through a recruiter. I interviewed at Arista Networks.
Interview
My interview was a phone interview that required me to ssh into their servers die a technical coding interview. The coding portion took around 20 minutes, and the remaining time of the 1 hour interview involved questions on data structures and talking about what I have done and my experiences. The coding portion was implementing functions of a binary search tree
Interview questions [1]
Question 1
I was asked to implement some functions of a binary search tree such as finding the next node with inorder traversal. It was then tested with pre-written tests. This was all done in C.
