Interview Process

Recruiter Connect: Best way to get noticed by Amazon recruiters is to maintain a good LinkedIn profile and message recruiters. Candidates can also apply on the Amazon job portal, but it is suggested they also get a referral from an Amazon employee.

Interview Rounds: Amazon conducts four interview rounds alongside an initial coding test. The coding test consists of DS/Algo problems.

The first round is an HR round where they ask behavioral questions along with Computer Science theory questions to the candidate. The next three rounds focus solely on DS/Algo.

After Interviews: The recruiter contacts the candidate after these rounds and tells them the verdict. They also look at the candidate’s leadership principles along with technical skills.

Hired: Once the team and you both are comfortable and ready to start, the offer letter is prepared and shared with you by the recruiters, and you are HIRED!

Interview Rounds: HR Round (1 Round): This is when they ask computer science theory and behavioral questions to the candidate. The questions may inquire about the candidate’s experience at previous companies and conflicts the candidate might have faced with colleagues/managers.

Data Structures and Algorithms Rounds (3 Rounds): The candidate is asked DS/Algo problems where production-ready code might be expected. It is not out of the realm of possibility to face minor behavioral questions here as well. The problems range from easy to hard, but they are not the sole deciding factor for the final offer. Leadership principles also come into play here. The interviews are conducted on Amazon Chime.

Gas Station Problem Description

Given two integer arrays, A and B, of size N.

There are N gas stations along a circular route. The amount of gas at station i is A[i]. You have a car with an unlimited gas tank, and it costs B[i] of gas to travel from station i to its next station (i+1).

You begin the journey with an empty tank at one of the gas stations. Return the minimum starting gas station's index if you can travel around the circuit once, otherwise return -1.

You can only travel in one direction: i to i+1, i+2, ... n-1, 0, 1, 2... Completing the circuit means starting at i and ending up at i again.

Problem Constraints:

• 1 <= |A| <= 5 * 10^5
• |A| == |B|
• 0 <= A[i] <= 5 * 10^3
• 0 <= B[i] <= 5 * 10^3

Input Format:

The first argument given is the integer array A. The second argument given is the integer array B.