Suppose you have 11 marbles and a two-pan balance used to compare the weight of 2 things. All of the marbles weigh the same except for one, which is heavier than all of the others. How would you find the heaviest marble if you are only allowed to weigh the marbles 3 times?
questions asked from major project and some personal questions
Enumerate the following from 1 to 4, being 1 the fastest to execute and 4 the slowest: - read cpu register - disk seek - context switch - read from main memory
write the code to draw a circle
Two texts are considered to "match" if they have a common substring of at least length n. Describe an algorithm to determine if two strings are matches.
K nearest points to the origin on a 2D plane; one-pass reverse linked list with constant space.
Given a list of numbers, find the consecutive sequence of numbers whose sums equal to a target number.
Not relevant (see my comment) even if you answered correctly.
Write the code for the preorder traversal of a tree.
Given an array of integers, a, return the maximum difference of any pair of numbers such that the larger integer in the pair occurs at a higher index (in the array) than the smaller integer type of question...
Viewing 91 - 100 interview questions