Financial Applications Engineer Interview Questions | Glassdoor

# Financial Applications Engineer Interview Questions

32

Financial applications engineer interview questions shared by candidates

## Top Interview Questions

Sort: RelevancePopular Date

### Financial Applications Engineer at Bloomberg L.P. was asked...

Mar 25, 2012
 If a 3x3 white cube is painted blue on its face and then cut into 1x1 cube, what are the chances of picking a cube with a blue side from a bag5 Answers33%4/9From a 3x3x3 Cube you can make 27 1x1x1 cubes, Since one face of the cube is painted blue. once face of 9 1x1 cubes will be blue. hence the answer is 9/27 = 1/3 = 33%Show More ResponsesIs it 6/27? why is 9?P= 1/3, or 33%

### Financial Applications Engineer at Bloomberg L.P. was asked...

Jan 9, 2013
 Given a sorted sequence of 1 million numbers, write a program to find all pairs of numbers that add to 10.3 Answersx=rand(1000000,1); y=10*x; x=ceil(y); y=length(x); a=1; for z=1:y for z1=1:y if (x(z)+x(z1))== 10 r(a,1)=x(z); r(a,2)=x(z1); a=a+1; end end end MATLAB'd& if they want non repetitive numbers: [code cont'd] g=size(r); b=g(1,1)-1; c=g(1,2); q=1; for d=1:b if r(d,1)~=r(d+1,1) && r(d,2)~=r(d+1,1) l(q,1)=r(d,1); l(q,2)=r(d,2); q=q+1; end endNot really optimal. I'll give you my approach: 1) First you do binary search, to located the Last 10. 2) Create 2 pointers, 1 at the start, and the other from the last 10. 3) Bring them closer together creating a new array of all pairs summing up to 10. 4) If 1 pointer gets out of sync, save the index of that pointer (only once), and skip all same numbers till the pointers get in sync again. 5) Recurse within all the indices you skipped. 6) Return the list of pairs.

### Financial Applications Engineer at Bloomberg L.P. was asked...

Feb 22, 2012
 My clock is 9 minutes slow every hour. At noon, it tells the correct time. After how many hours will it again tell the correct time?3 Answers80 hours.Let us suppose that we have 2 different clocks with the faulty one completing 51 mins in an hour. -the two clocks will again show the same time when the lag time = 12 hours for 1 iteration=>lag time =9 mins for getting a lag time of 12 hours no of iterations needed = 12*60/9=80 one iteration means 1 hour so the next time the clocks will be in sync= 80 hours time at that point=8:00 PMif it is analog it takes 40 hours (6 hours late, and 6 hours passed) if it is digital 80 hours.

### Financial Applications Engineer at Bloomberg L.P. was asked...

Jul 1, 2009
 (Programming Language Test) When casting an object of a polymorphic class from a base class, which kind of cast executes only if it's is valid?3 Answerschoices were a number of different kinds of casts - dynamic, static, reinterpret, etc.You should use dynamic cast. It returns a null pointer if it's not valid. Reinterpret will give you a bad pointer since the cast will be pointing to the wrong part of the polymorphic object.Also, it's important to note the difference between using pointers vs references in the case of casts. In C++, if you use a pointer in a dynamic_cast() and it fails, the result is a null pointer. However, since you cannot have a null reference, dynamic casts need to be wrapped in try/catch blocks.

### Financial Applications Engineer at Bloomberg L.P. was asked...

Aug 20, 2012
 Some problems were quite difficult for this position. Maybe the interviewers didn't like me personally. Check if two linked list intersect, if so, find the intersection point. Travelling salesman problem. 2 AnswersI think the followings are pseudo enough...... --------------------------------------------------------------------------- a = length of ll1, b = length of ll2, c = abs(a-b); do -> ;traverse (longerlist = a > b ? a : b) by c times end do do -> ;traverse (a AND b) in parallel node after node ;if the node at both a and b are the same address -> return this node@Dekus What do you mean by traverse and in parallel? If you do it in parallel, (i++, j++ equivalent) you are making the assumption that the lists are aligned, and the intersection happens at the same place in both of them. Also, the first portion does not make sense. Consider the case wherethey are singly linked lists and two nodes point to 1. My suggestion: traverse a list, and map (hashtable) the addresses of the next pointers to a boolean. then go through the other list and check to see if any next pointers are in the hashtable. This would be time: O(N + M) and space: O(N)

### Financial Applications Engineer at Bloomberg L.P. was asked...

Jun 5, 2009
 Count the number of time the letter "l", upper and lower case, appears in a given paragraph.2 AnswersYou simply count the number "l"s in the paragraph.i would say the same thing, or there is a better way to solve this problem?

### Financial Applications Engineer at Bloomberg L.P. was asked...

Mar 5, 2013
 find the unique numbers in an array.1 AnswerA lot possibilities. Bitmap searching could be one way.

### Financial Applications Engineer at Bloomberg L.P. was asked...

Dec 14, 2011
 Given 8 pennies, 7 of which weigh the same, and one of which is slightly heavier than all the others - state the minimum number of times you could use a balance scale to determine which penny was the heavier one.1 AnswerTwo time. Separate into 3 piles( 3,3,2) 1) Weigh the two piles of three a)if they weight equal. aa) then weigh each of the last two b) if one weighs more bb) then place one penny on each side leaving one out bb) if they weigh the same, the left over penny is it.

### Financial Applications Engineer at Bloomberg L.P. was asked...

Nov 5, 2011
 difference between malloc and new1 Answermalloc will need and head doc, while new won't. malloc is a function, while new is a operation symbol. malloc is to assign space, while new is to create new object. new will be able to construct and analyze corresponding function in data structure, while malloc cannot.

### Financial Applications Engineer at Bloomberg L.P. was asked...

Oct 17, 2009
 Given an unknown function with a limited number of known points, how do you try to estimate the rest of the function?1 AnswerNumerical analysis question, so slightly more quantitative. Start with linear then polynomial interpolation, etc, make sure you are comfortable writing out the equations.
110 of 32 Interview Questions