Very committed, motivated, and bright set of people.
Very satisfying and challenging work. I think Arista is doing a great job here.
Awesome support system with excellent mentorship for newcomers.
Great balance of work between the US and India offices.
Coders everywhere, including managers and directors!
Good responsibility and trust in the engineers to do the right thing.
Reasonable working hours and understanding management.
Excellent codebase and test infrastructure.
Good feedback system in place.
Good team spirit.
Great opportunity to grow.
Good appreciation for talent and good work.
Some people have mentioned a lack of facilities (not a problem for me personally, though). In any case, this will soon be better.
Not much to say at this point. Keep doing what you are already doing. Keep treating your employees with the dignity that you already give them, and Arista will be a hard place to leave!
I was contacted by a recruiter. The interview process lasted for three weeks and involved three rounds of interviews. The first round focused on data structures and algorithms. The second round was with the hiring manager. The third round included b
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
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
I was contacted by a recruiter. The interview process lasted for three weeks and involved three rounds of interviews. The first round focused on data structures and algorithms. The second round was with the hiring manager. The third round included b
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
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