Free juice and snacks.
Allows work from home almost whenever you ask for it.
The experience you get here will be very useless in most other companies.
In most companies, when you get promoted from SDE1 to SDE2 (or SDE2 to SDE3), you get a huge increment in your salary. That doesn't happen here since they don't have roles like SDE1, SDE2, SDE3 – all are called software engineers.
Salary increment doesn't happen or happens very rarely.
I recommend that if some company is giving 10-20% lesser salary than Arista, but is more popular (or is at least offering work on popular technology), that company should be preferred over Arista.
When the American office takes any decision, the Indian office should suggest to the American office if the decision is not good for Indian employees.
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