Financial Software Engineer Interview Questions | Glassdoor

# Financial Software Engineer Interview Questions

35

Financial software engineer interview questions shared by candidates

## Top Interview Questions

Sort: RelevancePopular Date

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

Sep 12, 2011
 A robot can move only left and down in nXn matrix. Have to get to the bottom right corner of matrix. Write algorithm to find the maximum number paths it can take.4 AnswersWorked on this for 2o mins. They were patiently waiting.static void NumofPaths(int n) { int[][] array = new int[n][n]; for (int i = 0; i < n; i++) { array[0][i] = 1; array[i][0] = 1; } for (int i = 1; i < n; i++) { for (int j = i; j < n; j++) { array[i][j] = array[i-1][j] + array[i][j-1]; array[j][i] = array[j-1][i] + array[j][i-1]; } } System.out.println(array[n - 1][n - 1]); }https://www.khanacademy.org/math/recreational-math/brain-teasers/v/path-counting-brain-teaser - video http://math.stackexchange.com/questions/104032/finding-points-in-a-grid-with-exactly-k-paths-to-them - code.Show More ResponsesI think you mean the robot can only go right and down since the robot starts at the top left. Since the robot must make n-1 right moves and n-1 down moves to reach the bottom right field, Define S to be the bit string of length 2*(n-1) for which 1's are right moves and 0's are left moves that get the robot to the bottom right. Then, there are (2*(n-1))!/((n-1)!)^2 distinguishable permutations of the bit string and so the same number of possible paths to the bottom right.

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

Jan 17, 2013
 Nothing to bad, just need to know your basics well.2 AnswersWhat kind of basic are you referring to? I have an on campus interview soon as well.Basics about C/C++ and algorithms Since I am not from CS, I got brain teasers as well, but they are easy....you can Google a bunch and get prepared.

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

Sep 30, 2011
 How to avoid having instances of your class created on the stack2 AnswersFirst Guess: Declare a private constructor, this should prevent the compiler from allowing it to be called during stack initialization (It should give a compile warning about an unavailable member). Of course, it can't be easily initialized on the heap either, so you'll have to provide a comparable member function (getInstance () or some such).Ryan you are going way too overboard with constructors. Declare static\global, or declare dynamically on the heap (new , malloc). That's it.

### 2013 Financial Software Engineer at Bloomberg L.P. was asked...

Apr 23, 2013
 class A{ void foo(); } class B{void foo1(); } class C {void foo1(); } Design like below: B.foo1() can access A.foo(), but C.foo1() can not access A.foo()2 Answersclass A{ protected: void foo();} class B : class A{ foo1();}class A { private: void foo(); friend class B;}; class B { void foo1(); } class C { void foo1{};

### 2013 Financial Software Engineer at Bloomberg L.P. was asked...

Apr 23, 2013
 You have DB which stored employee ID and a cache. Design how to manage a cache from employee ID took from DB. 2 Answers1 way cache mapping, 2 way cache mapping...One column of Programming pearls discussed this problem.

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

Nov 3, 2011
 You're given a set of strings. You want to test if any two strings in the set are anagrams.2 AnswersI gave a solution that involved sorting the strings and using that as elements of a new set to check for anagrams. They asked me to reduce the memory footprint of my solution without sacrificing the O(N) time (N = number of strings, we assumed that string lengths were O(1)). I suggested that if the strings represent words in a natural language, we might be able to apply the same Huffman encoding to everything in the set, which maybe could reduce space by, say, 50%. They seemed satisfied with that solution.You could also check to see if the words have the same number of characters and same characters using a hash map. Only anagrams can satisfy that.

Nov 2, 2011

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

Mar 31, 2013
 Explain the Hidden Markov Model?1 AnswerHow long did the process take from application to receive an offer? How many rounds of interview? What comes after technical phone interview?

Nov 2, 2011