I applied online. The process took 4 weeks. I interviewed at JPMorganChase (Houston, TX) in Aug 2014
Interview
I applied for 3-4 positions on their website. I received two interview calls. First was a telephone screening interview with a manager (VP) and two developers. They had not read through my resume and asked theoretical questions straight out of college textbook. I had 9+ years of experience, and felt that the questions were not really applicable for the position. I did not get a call for a follow-up interview.
First part of the second interview was 1:1. The interview was technical. The manager (VP) and developers asked questions about programming in Java, multi-threading, etc. I was asked to look at a piece of code and identify the error in it. Rest of the interview was typical. The manager explained the work done by his group and the functionality of the software. They went through my resume and asked questions about previous work experience. Second part was a phone interview with a ED from NY. It was non-technical in nature and focused on conflict resolution, managing priorities etc. Overall, both interviews for the second position went well.
Interview questions [1]
Question 1
Multi-threading, Java, Spring, Hibernate, HTML5, Flex, etc.
I applied through a recruiter. The process took 4 weeks. I interviewed at JPMorganChase (New York, NY) in Aug 2014
Interview
Two phone interviews followed by an in-person (Half day, 4 people)
Location was in Brooklyn--they recently moved a lot of people to MetroTech Center. I didn't like the area surrounding the office, but the office itself was pretty nice. Pretty quiet, low-key atmosphere. There is no business presence in Brooklyn as far as I can tell, so no trading floors etc.
People were nice and relaxed.
Interview questions [5]
Question 1
2 eggs and a building problem. A building has height n and you have 2 eggs. At a certain floor N, an egg dropped from this floor will break. Find a strategy to find the floor N at which eggs will start breaking, while minimizing the number of drops. Note that the key is that you have 2 eggs.
Given a list and bucket size, write an algorithm which returns a list of lists each of which contains [bucket size] number of items. It's not guaranteed that the bucket size will evenly divide into the length of the list. How can you unit test this? What are the base/edge cases?
Given an unsorted list of size n-1 that contains all but one number between 1 and n, write an algorithm that will detect the missing number. Can you do this in constant time? What about if there were k numbers?
