I applied online. The process took 1 day. I interviewed at Amazon in Oct 2010
Interview
Applied online for a software engineer position for new college graduates. Emailed a few recruiters using Linkedin to get my resume noticed. Received an email to setup a time and date for a phone interview. Phone interview was 45 minutes long, all technical. I will admit that this was my first technical phone interview, so my nerves got the best of me and I didn't answer the questions well. I was expecting conceptual questions instead I got coding questions. My interviewer was talking on a speakerphone and I had some trouble hearing/understanding him which didn't help.
First question was something like, "Write a function that takes an integer and prints out the digits separated by commas. Example input 345, print out 3,4,5 "
Second question was basically write the merge sort function and apply it to two arrays.
Like I said before, this was my first technical phone interview so I was trying to figure out how to answer the questions over the phone. I described the method I would use to solve each problem, but he wanted me to tell him the actual code. Didn't go so well, and I didn't get an offer.
Interview questions [2]
Question 1
Write a function that takes an integer and prints out the digits separated by commas. Example, pass in 345 print out 3,4,5
Given a sample array of integers containing a zero at random location, return reversed sub array before the first 0. Give the full method implementation.
I applied online. The process took 4 weeks. I interviewed at Amazon in Nov 2010
Interview
== Java ==
1. interface vs abstract class
2. the usages of 'final' keyword
3. overload vs override
4. concept of 'equals' and how to override (need to override hashCode() also)
5. checked vs unchecked exception
== Misc ==
1. 50,000 HTML pages, extract the ones with phone numbers (regex)
2. Find the odd-occurence number in an array (I told him that I have seen
the problem before and he asked the next one)
3. Find the duplicate number in an array of N ints (1<=x<=N-1)
4. Design a transportation system (warehouses, routes, trucks, fuel, MPG,
etc)