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).
Implement a function to raise a number to an exponent using your language of choice.
There are two linked lists, each around million nodes long. One linked list merges into the second one. Find the node where the two linked lists merge i.e find the first node that is part of both linked lists.
Halloween has just happened, and all of the kids in the neighborhood have candy. 5 of them are standing in a circle comparing stashes, when one of them (kid 0) gets the idea to steal his neighbor's (kid 1's) candy. Kid 1 gets upset and runs away crying. Kid 2 sees kid 0 stealing from kid 1, thinks that he could do that too, and steals kid 3's candy. Kid 4 sees kid 2, and steals from kid 0, and so on and so forth until there's only one kid left. Given n children, find the index of the last kid remaining.
Write a program that verifies that a binary tree is a binary search tree.
1) Why Bloomberg ? 2) 1 thing you would like to change about Bloomberg ? 3) They will grill you on your resume. Know every thing that you write on it. 4) Implementing queue using stack library in C ? 5) A question on BFS. 6) A puzzle - A mobile phone company is launching a new product (mobile phone) which they say is unbreakable if its thrown from a certain height (a threshold). You are given 2 phones. Find the threshold height of the product if you can throw it from any floor of a 100 story building ?
Viewing 101 - 110 interview questions