Given an unsorted array of integers, sort them in such a way that all negatives come first, followed by zeroes, followed by all positives. 5,-6,8,0,4,-10,11 could become -6,-10,0,8,4,11 (does not have to be sorted into increasing order) What is the run time of this? Can we reduce the run time, if so, how (implement the new way)? Doing black box testing, how can we determine the run time? How can we determine if we have a memory leak?
given two sorted linked list, merge them into one linked list.
Why Microsoft and not some company like Honeywell?
Write the kernel of the OS of a stopwatch
Evaluate postfix expression
I was asked to write a method which takes an integer as an input parameter and returned a string as the output variable. The string's value was to be the written format of the integer. For example, if the input was, "1,550,225" the output was, "One million, five hundred and fifty thousand, two hundred and twenty five"
I was asked a variant of the Single Source Shortest Path Problem on a general tree.
Find an element in the array in O(log n). Array is circular, shifted by k units, and sorted (before shift).
given three integers, determine whether they can form a triangle? example 1: 3, 4, 5 --> yes example 1: 3, 4, 15 --> no
Derive the formula for a line
Viewing 591 - 600 interview questions