Given an array of integers A[1...n], compute the array B[1...n] such that B[k] is the product of all the elements of A, except A[k]. Part ii) Try to do it without division (some mobile devices don't have division). Was asked to write code for part ii.
Asked to implement a function that takes an integer and returns whether or not the number had an odd or even number of 1 bits.
Given the head pointers to two linked lists of unknown length, find the node of intersection if they do intersect.
What are the first 2 integers that, when added together, equal 10 in a "very large" array of unsigned integers?
design a ADT to implement push(), pop() method as stack, and also has a getMinElement(). Require that getMinElement() is constant time but push()/pop() do not have to be constant time at first. Then for improvement, these three methods are all required to be constant time
A boy goes to his grandmother’s house. There he either does yoga in the morning / plays tennis in the evening / does neither. However he does not do both on the same day. We know that 22 days he did either 1 activity. 24 mornings he did nothing. 12 evenings he did nothing. How many min days did he stay there to have done this?
Typical coding question of how to determine if a string is a palindrome
Take two arrays and compare them to find duplicates. Only list each duplicate once.
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
what are the different stages in performance testing
Viewing 601 - 610 interview questions