The biggest asset of this company is the people. Almost all the persons I have met in the company are highly proficient and know how to create products that are a delight for people to use. Plus, it's fun working with them.
Salary is decent in India, less than Apple, Google, Amazon, but it's understandable as it has yet to reach that.
Allows more trust to employees.
The budget for the hackathon in India is abysmal. Right now, it's almost an insult to the people participating in it ($30 per person), which is subpar to industry standards.
Secondly, please increase the salary as well as the responsibilities of HR in India. They earn so little.
Nothing. Ken and Jayshree are the coolest techies and people in the industry!
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