How do you find sequences of consequtive integers in a list that add to a particular number.
Developer Interview Questions
639,751 developer interview questions shared by candidates
Write a function that finds the minimum and maximum values within an unsorted array using divide-and-conquer.
Given an array of integers A[1...n], compute the array B[1...n] such that B[k] is the product of all the elements of A, except A[k]. Part ii) Try to do it without division (some mobile devices don't have division). Was asked to write code for part ii.
A boy goes to his grandmother’s house. There he either does yoga in the morning / plays tennis in the evening / does neither. However he does not do both on the same day. We know that 22 days he did either 1 activity. 24 mornings he did nothing. 12 evenings he did nothing. How many min days did he stay there to have done this?
If you have all the numbers from 1 to 1'000,000, except one of them. How would you find out which number is missing?
You have a long set of numbers. More than 400k. How would you search if a specific number is in set? They expect a better solution than looping the set until you find the number.
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.
Implement the toLowerCase() method
Print out, from small to big, of a sequence intergers, without sorting.
What are Exceptions in Java.
Viewing 421 - 430 interview questions