Best place to learn
Best place to learn
- Very helpful colleagues
- Great work culture
- Flat model
- Managers are very interactive
- Flexible timings
- Quality of work is great
- Work-life balance is there
- No perks or facilities
- Average pay
- Less number of PTO's per year
Provide some basic facilities in the office and reconsider the compensation scheme.
Was this helpful?
Arista Networks Interview Questions
Arista Networks Interview Experiences
Software Engineer
Interview Process: * Online assessment * DSA round * Design round (Technical Director) * HR round I only finished the first two rounds. The online assessment included three coding questions, all of which were easy. In the DSA round, there was one
Software Engineer
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
Software Engineer
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
Software Engineer
Bengaluru, Karnataka, IndiaApril 1, 2025Interview Process: * Online assessment * DSA round * Design round (Technical Director) * HR round I only finished the first two rounds. The online assessment included three coding questions, all of which were easy. In the DSA round, there was one
Software Engineer
Bengaluru, Karnataka, IndiaMarch 1, 2025It 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
Software Engineer
Bengaluru, Karnataka, IndiaAugust 1, 2024OA 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
