People at Arista believe in making software engineers really effective by developing tools that make their day-to-day job easier.
During technical discussions, everyone's opinion is important.
Managers are software engineers themselves, which means no crazy deadlines.
Quality and testing are of great importance.
Work on interesting features and play an active role in designing them.
Senior people are very helpful in reviewing designs.
The facilities in the Bangalore office are not at par compared to other companies in the same domain. Hopefully, they will improve as we continue to grow.
Keep up the good work and continue treating remote offices as first-class centers for R&D.
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
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
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
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
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
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