MISSING VALUE Interview Questions

6,576,714 interview questions shared by candidates

1. Take an integer input and output the number of 1's in it's binary representation. 2. Implement a mergesort. 3. Explain your level of understanding of data structures (trees, etc.) 4. What makes java different than other languages?
avatar

Applications Developer

Interviewed at JPMorganChase

3.9
Feb 26, 2016

1. Take an integer input and output the number of 1's in it's binary representation. 2. Implement a mergesort. 3. Explain your level of understanding of data structures (trees, etc.) 4. What makes java different than other languages?

100 coins in a circle, clockwise labeled 1-100. Starting at coin 1, you flip each one moving clockwise. If a coin lands tails, you keep it, if it lands heads, you remove it. After a long time, only one coin will remain. What would you expect its label is?
avatar

Trader Intern

Interviewed at Jane Street

4.4
Aug 22, 2015

100 coins in a circle, clockwise labeled 1-100. Starting at coin 1, you flip each one moving clockwise. If a coin lands tails, you keep it, if it lands heads, you remove it. After a long time, only one coin will remain. What would you expect its label is?

The question was the following. I'm rephrasing the question to make it clear for everyone to understand: - You are going on a one-way flight trip that includes billions of layovers. - You have 1 ticket for each part of your trip (i.e: if your trip is from city A to city C with a layover in city B, then you will have 1 flight ticket from city A to city B, and 1 flight ticket from city B to city C. - Each layover is unique. You are not stopping twice in the same city. - You forgot the original departure city. - You forgot the final destination city. - All the tickets you have are randomly sorted. Question are: - Design an algorithm to reconstruct your trip with minimum complexity. - How would you improve your algorithm. Example: - randomly sorted: New York->London San Francisco-> Hong Kong Paris->New York London->San Francisco - sorted: Paris->New York New York->London London->San Francisco San Francisco-> Hong Kong
avatar

Software Engineer

Interviewed at Google

4.4
Aug 9, 2009

The question was the following. I'm rephrasing the question to make it clear for everyone to understand: - You are going on a one-way flight trip that includes billions of layovers. - You have 1 ticket for each part of your trip (i.e: if your trip is from city A to city C with a layover in city B, then you will have 1 flight ticket from city A to city B, and 1 flight ticket from city B to city C. - Each layover is unique. You are not stopping twice in the same city. - You forgot the original departure city. - You forgot the final destination city. - All the tickets you have are randomly sorted. Question are: - Design an algorithm to reconstruct your trip with minimum complexity. - How would you improve your algorithm. Example: - randomly sorted: New York->London San Francisco-> Hong Kong Paris->New York London->San Francisco - sorted: Paris->New York New York->London London->San Francisco San Francisco-> Hong Kong

Viewing 1071 - 1080 interview questions

Glassdoor has 6,576,714 interview questions. Prepare for your interview. Get hired. Love your job.