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
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?
what are the different stages in performance testing
CMOS Inverter , how to reduce the drive strength of Minimum size inverter
Print out, from small to big, of a sequence intergers, without sorting.
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
How does STP work...how does it know who will control everything?
Write a method that counts how many elements in an unsorted array are out of order.
Given a string of numbers, you can interpolate basic operations (+, -, * and /) to create an equation that can be evaluated using simple math. Given a string of numbers and a value, write a method that prints all of the equations that can be generated using that string that evaluate to the given value. ex- f("323",3) will print out "3 * 2 - 3"
Have you ever had your code formally verified?
Viewing 601 - 610 interview questions