Java Interview Questions

6,585,363 interview questions shared by candidates

They asked a lot of iOS questions, and some general programming questions. The first question they asked was so obscure that I didn't even really understand it. I was probably dead from that point on. Another question was to figure out a way to combine three lists of items where an item would be placed in a destination array if it existed in any two of the source arrays.
avatar

IOS Developer

Interviewed at Booking.com

4.1
Dec 19, 2013

They asked a lot of iOS questions, and some general programming questions. The first question they asked was so obscure that I didn't even really understand it. I was probably dead from that point on. Another question was to figure out a way to combine three lists of items where an item would be placed in a destination array if it existed in any two of the source arrays.

Een multiset is een set waar repetities zijn toegestaan (ex: MS1 = (1,1,2,2,2,3,3,4,4,4,4,4,5,7,7,9...) Probleem: schrijf een programma dat twee multisets ontvangt en twee intersecties teruggeeft (element 2 verschijnt drie keer op MS1 en vijf keer op MS2
avatar

Software Developer

Interviewed at Booking.com

4.1
Feb 26, 2014

Een multiset is een set waar repetities zijn toegestaan (ex: MS1 = (1,1,2,2,2,3,3,4,4,4,4,4,5,7,7,9...) Probleem: schrijf een programma dat twee multisets ontvangt en twee intersecties teruggeeft (element 2 verschijnt drie keer op MS1 en vijf keer op MS2

You are given an array of numbers. You need to print the length of the maximum continuous sequence that you encounter. For example if input is [3,8,10,1,9,6,5,7,2 ], the continuous sequences are{1,2,3} and {5,6,7,8,9,10} the latter is the longest one so the answer becomes 6. O(n) solution was asked for, assuming you have a hash map which supports O(1) insertion and fetching operations
avatar

Software Development Engineer II

Interviewed at Microsoft

4
Apr 30, 2013

You are given an array of numbers. You need to print the length of the maximum continuous sequence that you encounter. For example if input is [3,8,10,1,9,6,5,7,2 ], the continuous sequences are{1,2,3} and {5,6,7,8,9,10} the latter is the longest one so the answer becomes 6. O(n) solution was asked for, assuming you have a hash map which supports O(1) insertion and fetching operations

Viewing 3691 - 3700 interview questions

Glassdoor has 6,585,363 interview questions. Prepare for your interview. Get hired. Love your job.