What are the first 2 integers that, when added together, equal 10 in a "very large" array of unsigned integers?
Developer Big Data Interview Questions
730,119 developer big data interview questions shared by candidates
design a ADT to implement push(), pop() method as stack, and also has a getMinElement(). Require that getMinElement() is constant time but push()/pop() do not have to be constant time at first. Then for improvement, these three methods are all required to be constant time
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?
1) Given a array and a sum, find all the pairs in the array which have the given sum. 2) Given a BST you need to identify swapped nodes
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.
Given two binary trees T1 and T2. Find if T2 is a sub-tree of T1.
Make a program that writes a Binary Search Tree to a file. Now create a program that reads those files and recreates a Binary Search Tree.
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 521 - 530 interview questions
See Interview Questions for Similar Jobs
Developer JavaBig DataPrincipal Statistical ProgrammerSenior Big Data EngineerBig Data Hadoop ConsultantActimize DeveloperSoftware Developer JavaBig Data Hadoop DeveloperPrincipal StatisticianSenior Statistical ProgrammerSenior StatisticianDatabase SqlHadoop Developer Or Hadoop AdministratorStatistical Programmer AnalystMedical Software Developer Java DeveloperMathematical StatisticianSenior BiostatisticianSql Analyst