Arista Networks

OA Round There were 4 sections: * 20 minutes for 15 MCQs. * 20 minutes: Integer to Roman. * 25 minutes: In an m*n grid with obstacles, find if (m-1,n-1) can be reached from (0,0) in less than or equal to a given time, where each movement costs 1 un

I received a call via Naukri. The HR consultant called and set up an interview. It was quick; the interview was scheduled within a week. The interviewers were friendly. There were a total of 3 rounds, but I didn't clear the second round.

It was smooth. HR and interviewers were quite helpful. HR had to schedule the interview multiple times as I was busy and asked for time. Each round was approximately 1 hour and provided the CoderPad. Interviewers were looking for a working code solut