assume you are writing number in ascending order to an array of constant size. once you reach the end of the array, you start writing from the beginning, thus writing over the oldest entries. write an algorithm for finding a specific number in this array.
Write a function that divides two numbers without using the divide '/' operator.
Describe a routine which returns the set of integers in {1..100} divisible without remainder by 3 but not by 9.
1. sliding window algorithm 2. Why ZocDoc? Your interest match with the team and position. 3. System design question involving cache mechanism 4. triangle tree and some questions on threading mechanism
How many rotations does earth make on its axis while going around the sun for one year.
Write a function that finds the median of a set of three numbers, also find the Big O. Can it be done with only 2 comparisons, or do you need 3?
Komprimieren Sie eine gegebene Zeichenkette. Eingabe: aaaaabbccc Ausgabe: a5b2c3
Implement a function that takes the set-wise subtraction of two sorted sets of integers. ie A = {1, 2, 3}, B = {3, 4, 5} => A - B = {1, 2}. There can be duplicates, in which case all duplicates should be removed should there be an occurrence in B. IE: {1, 2, 3, 3, 3} - {2, 3} = {1}.
write a program to print the given series (user need to enter the nth series number from keyboard) 2,3,5,11,23,29,41,53,83,89 .....n
Write a probability formula to tell how many bits will be changed when 1 is added to a 32 bit binary number.
Viewing 81 - 90 interview questions