#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.
Classic one from them: You have an array and you want to find the first non-repeating element.
char *a = "hello"; char b[] = "hello"; char *c = malloc(12); What do these do, what's the difference in where the memory is stored?
If you have all the companies that are traded, and live inputs are coming of which company is being traded and what is the volume, how do you maintain the data, so that you can carry out operation of giving the top 10 most traded companies by volume of shares most efficiently.
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
1) Find the intersection of two arrays as a set. 2) Find the mirror or a binary tree. 3) Find the first non unique character in a stream of potentially infinite data.
Algorithm runtime analysis: What's the complexity of computing the fibonacci numbers?
Implement a queue class.
The chessboard problem. I first mentioned BFS and use of a Queue but the interviewer kept asking about some data structure with less memory that I could extract due to the simple structure of the graph. I did not understand what he meant. I eventually mentioned DFS and proved it works uses less memory. The cache problem took a long time. I kind of though I failed it at some point. I had no prior knowledge of the topic since I am not a CS guy. I eventually, used an array to store the access time to different items and O(n) search through it to find the least frequently used one. The interviewer did not raise the complexity. He wanted me to write code on a paper (which is hard, esp. in C).
Copy a block of memory from source to destination. You need to consider the overlapping cases. Yet I don't think copy from behind will solve the problem. Because the memory may overlap at the beginning. So a pre-check of overlapping region is necessary. In my view, for a typical copy operation the source should not be overwritten, but the answer allows for that. I was pretty confused...
Viewing 851 - 860 interview questions