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}.
Implement a power function to raise a double to an int power, including negative powers.
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.
If you were a gerbil, which gerbil would you be?
The Game of Nim worded diffently.
Create a stack of numbers where the maximum number is always known.
Same as above but another one is taken out again. Find the two missing nubmers
Implement division without using multiplication or division. It should work most efficient and fast.
Traverse nodes in a binary tree
Viewing 141 - 150 interview questions