unsorted integer array size n. unmodifiable list of "less than" / "greater than" operators. place elements from int array in between each "<" and ">" operator so that every comparison holds true. e.g. 6, 2, 8, 1, 3, 9, 4, 0, 5, 7 <, >, <, <, <, >, <, >, > answer: 0 < 9 > 1 < 2 < 3 < 8 > 4 < 7 > 6 > 5
Suppose there is a building with 25 floors. If n-1 people enter an elevator and press a floor button. What is the probability that when the nth person enters, the 19th floor has already been pressed?
Implement a function to raise a number to an exponent using your language of choice.
Implementing the LRU algo
Write a program that given a 2D integer matrix (default value: 0) and a coordinate in the matrix, it sets all of the elements diagonal to the coordinate to a value of 1 (so that if you wrote it on a piece of paper there's an X with the coordinate at the center).
There are 20 floors in a building. I step into the elevator with 5 other people. What is the probability that I do not have to press my button? (ie someone else chooses the same floor as me)
#1: We have a linked list, but it is special in that it can have pointers down, as well as next. Any node can have an arbitrary number of links down as well as across. Write a function that will "flatten" this linked list so that it does not have any down pointers, but all elements remain in order.
How C allocate a piece of free memory?
Why we need exception handling?
There is a Class A, which has some instance variables. One thread needs to do read and write on that variable, while another thread should not be able to access it at all. Asked me to design such a class.
Viewing 2051 - 2060 interview questions