I applied through an employee referral. I interviewed at IBM
Interview
All I had to do to get the interview was talk to a few people at my school's career fair. If you have solid credentials (work experience in open source, good GPA, etc.) then you have a good shot at an interview. They do a lot of Python programming and working with open source technologies in this sector of IBM, so experience in that world is also a plus. The interview was not technical, although they were prepared to make me an offer based on the way that I described my experiences with the various technologies that they were interested in.
I applied through an employee referral. The process took 3 weeks. I interviewed at IBM (Bengaluru) in Sep 2010
Interview
Hiring process was smooth, While the interview process was a bit rocky...
Invited for the technical interview, Made to wait for 20 mins. Technical interviewer finishes the interview. Made to wait for 2 hours to inform that the Mangerial round of interview will not happen the same day. Had to travel to IBM office after a couple of weeks and the interviewer was rude as he was asked to take this interview all of a sudden and he didnt have time for me. FInished the interview, no salary negotiation.
Offer letter was send by courier in a weeks time, well behaved HRs. HRs responded to all queries.
Interview questions [1]
Question 1
All straight forward questions in technical round
Managerial round was with open ended questions and interviewer showed lack of interest in interviewing.
I applied through college or university. The process took 2 days. I interviewed at IBM (Singapur)
Interview
3 rounds of interview - one written test followed by a one on one interview with an existing full time employee. This is then concluded by an onsite interview with a panel of interviewers. Interviews were technical with the exception of the group were a few general questions were asked. Hiring was a simple phone call and email followed by a one day on-boarding process which took care of legal details and company pollicies.
Interview questions [1]
Question 1
The most difficult question started of with a recursion of the fibonacci series. Then it progressed into obtaining algorithms that fit a use case eg. create a recursion that generates this subset of the sequence represented by a binary tree but has to execute in (n*logn)