Print out, from small to big, of a sequence intergers, without sorting.
Programador De Audio Interview Questions
711,259 programador de audio interview questions shared by candidates
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?
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.
Given two binary trees T1 and T2. Find if T2 is a sub-tree of T1.
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
Implement the toLowerCase() method
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.
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.
1st round was apti round then 2nd round was they give an question we have to write progamme to solve this one and also wrrite a flow chart for the same programme
Viewing 501 - 510 interview questions