I applied through a recruiter. The process took 2 weeks. I interviewed at Amazon (Seattle, WA) in Jan 2011
Interview
Posted resume on a "paid membership" jobs site. I have approx 5 yrs of experience.
Got call from amazon recruiter. Said it was for Amazon wireless. Scheduled phone interview.
I didn't understand why they liked my resume. I was not a Java programmer, but i had a computer science degree. Was totally clueless about what to prepare.
Glassdoor.com helped a LOT! 90% of they questions matched what I saw on glassdoor.
My first phone interview was more OOP questions so I think i did well as I use them daily and was in touch with the topic. The second was more Data structures, I did not do well, as I did not have enough time to prepare in depth.
Be prepared for CS basics like difference between low level and high level languages, hash tables, binary search
Interview questions [4]
Question 1
Compilation diffs b/w c++ and java/c#? Advantages of IL and JIT?
2 behavioral 2 coding not very difficult. Behavioral is tell me about a time you took responsibility beyond your role and biggest accomplishment. The process is exactly the guideline they posted for interview.
Interview questions [1]
Question 1
tell me about a time you took responsibility beyond your role
It was a 2-3 round process, depending on how your interview went, with increasingly hard DSA questions followed by some HR and behavioural questions. First round was mostly easy and medium leetcode, followed by medium and hard questions in the second round and above on more complex topics.
I applied online. I interviewed at Amazon (Bengaluru)
Interview
The interview process consisted of an online assessment followed by two technical interview rounds and one behavioral round. The technical rounds focused on Data Structures, Algorithms, Java, and problem-solving skills. The behavioral round covered Amazon Leadership Principles and past project experiences. The interviewers were professional and the process was well structured.
Interview questions [1]
Question 1
Q: Find the first non-repeating character in a string.
