Given two lists, A and B, of sizes n and k, respectively, describe an algorithm to determine the intersection, C, of the two lists. What is the complexity of your algorithm? (The obvious solution is O(n*k)). Can you describe a solution that is faster? (An optimized solution can do it in O(n+k)).
Given a random array with integers, find every pair that sum up to a certain number.
Given a customer order of N items, design and implement a class that will most efficiently by space place the order in various size boxes
Telephone interview: Find largest integer from an array of integers. The integers in the array are arranged in strictly increasing (no 2 integers are same) or strictly increasing then decreasing; so like a curve and you have to find the peak. Discuss time complexity. Write code.
It was positive experience. People were nice. Like craft demo which help to have discussion with team instead of traditional interview structure.
puzzle : there is a island and the resident are either blue or black eyed. The residents are trapped in the island and want to leave. One day a foreigner comes and says there are few blue eyed people. He will be sending a steamer to the island every day and blue eyed people can leave. But if a black eyed person approaches the steamer, he will be killed. Constraint: No body knows their eye colour and can't even ask or say the colour to any other person. even cant see their reflection. So how many days is required for all the blue eyed person to leave the island.
There are 2 ropes which both last for 1 hour when burning. Use these 2 ropes to get 1 hour and a half.
sort binary array with minimum time complexity
Why do you want to work for Apple
Given an int array, find the sequence of elements that has the largest sum
Viewing 1071 - 1080 interview questions