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
Developer Intern Interview Questions
716,170 developer intern interview questions shared by candidates
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.
Assume there is a method provided getNextperson() which gives Person objects which have comparable interface implemented, now read from a file records and sort it and give first 1000 records, write code on the paper
Print out, from small to big, of a sequence intergers, without sorting.
What are Exceptions in Java.
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?
Implement the toLowerCase() method
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.
Viewing 511 - 520 interview questions