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.
Financial Engineer Interview Questions
1,105 financial engineer interview questions shared by candidates
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 ?
Explain OOP.
How to remove duplicates from a linked list
1. Implement a queue using stacks 2. Search through an array of integers and find pairs that add to a target
What is difference between Reentrant and Thread Safe functions ?
how to acces first element in array
Given 99 numbers from 1 to 100 no-duplicate, find the number that is not there between 1 to 100; given 98 numbers from 1 to 100 no-duplicate, find the two numbers missing between 1 to 100.
There are 10 boxes of apples. Each apple in the boxes weights 1 pound, except that one of the boxes contains bad apples, which weights 0.9 pound each. You are given a digital weight (not a scale), and you can take apples out of the boxes. what is the minimum time of weighs to find out which box has bad apples? I gave one solution of 3 times using divide and conquer, but the interviewer said that 1 step is possible. So I couldn`t come up with the solution.
Viewing 121 - 130 interview questions