Salary is the only benefit on my team.
No charter for our team; major work will be in away teams.
Manager openly told us that we need to work on OE items as additional work, which will not be tracked in the sprint. Whoever does extra will be given additional credits by the manager, leading to a worst work culture in the team.
No learning curve in the team, as we do not follow any kind of best practices like REST principles while building APIs. The code written is such that everyone fears modifying it and puts an if at the top.
No proper help is given from the away team. When I asked the manager or senior team members for away team support, they said that we need to go through the away team's complex code and figure things out ourselves without any away team support, expecting things to work without any issues and delays. Only CR or doc review support was given.
Step 1. HR email or call Step 2. Online assessment Step 3. Technical phone screen Step 4. Video interviews Step 5. Final “Loop” interview Step 6. Hiring meeting Step 7. Reference check How long does the Amazon background check take? Step 8. Offer rol
Good interview experience. It consists of 4 rounds, including an Online Assessment (OA). The last round is a "bar raiser" round. The remaining two are technical rounds. Mostly, the interview focused on Data Structures and Algorithms (DSA) question
It was good. He first introduced himself and directly jumped into DSA problems. The first question was the maximum branch sum in a binary tree. The second was to reverse a stack without using extra space.
Step 1. HR email or call Step 2. Online assessment Step 3. Technical phone screen Step 4. Video interviews Step 5. Final “Loop” interview Step 6. Hiring meeting Step 7. Reference check How long does the Amazon background check take? Step 8. Offer rol
Good interview experience. It consists of 4 rounds, including an Online Assessment (OA). The last round is a "bar raiser" round. The remaining two are technical rounds. Mostly, the interview focused on Data Structures and Algorithms (DSA) question
It was good. He first introduced himself and directly jumped into DSA problems. The first question was the maximum branch sum in a binary tree. The second was to reverse a stack without using extra space.