Financial Technology Associate Interview Questions | Glassdoor

# Financial Technology Associate Interview Questions

9

Financial technology associate interview questions shared by candidates

## Top Interview Questions

Sort: Relevance Popular Date

### Financial Technology Associate at Citadel was asked...

Feb 23, 2011
 Efficient way to compute p^q, where q is an integer 2 Answers Iteratively use p = n(p,q/2)^2 The correct answer to efficiently calculate actually gives you a O(logn) runtime. Here is the code in python: def powlogn(p, q): if q < 0: return powlogn(1/p, -q) elif q == 0: return 1 elif q == 1: return p elif q%2: return p * powlogn(p*p, (q-1)/2) else: return powlogn(p*p, q/2)

### Financial Technology Associate at Citadel was asked...

Jun 11, 2013
 Brain Teaser: Blindfolded. In a room with 8 coins. What is the minimum number of flips required to guarantee that one of the permutations had all coins with the same side? 4 Answers Any answer? I would say : (1/0.5)^8 Infinite, as you cannot guarantee any given coin will ever be flipped to heads/tails, even though the probability of both heads and tails appearing in a series of single coin flips increases according to the formula (.5)^k-1 where k is the number of flips. 127 Show More Responses There is only one way to get all heads and one way to get all tails. Total probability of getting the same set is 2/2^8. The expected time it takes for a result of probability p to appear is 1/p. So the answer is 2^7 = 128

### Financial Technology Associate at Citadel was asked...

Feb 23, 2013
 Why do you want to work in this financial institution versus working in a pure software company like Microsoft, etc? 1 Answer Can you please tell us more specifically about the interview rounds and the questions they asked?

### Financial Technology associate Program at Citadel was asked...

Oct 14, 2009
 Write code to multiply two matrices. 2 Answers int main() { const int N = SOME_NUMBER int a[n][n], int b[n][n], int c[n][n]; int sum = 0; for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { sum = 0; for (int k = 0; k < N; k++) { sum += A[i][k] * B[k][j]; } C[i][j] = sum; } } } This question gives a lot of opportunity for candidate. You could ask interviewer if he expects simple (math) implementation and gave above one. He would like to see fast implementation with processor cache in mind, and go from here with a lot of discussions and optimizations.

### Financial Technology Associate at Citadel was asked...

Feb 23, 2011
 scope of variables in C++, difference between pass by value/reference/pointer

### Financial Technology Associate at Citadel was asked...

Feb 3, 2011
 Some basic logic puzzles, probability. General programming questions

### Financial Technology Associate Intern at Citadel was asked...

Jan 12, 2014
 Given some coins, how do u flip them to make sure all the coin have the same sides. Some basic knowledge on distributed system.

### Financial Technology Associate at Citadel was asked...

Feb 3, 2011
 What is a futex ? How can you parse a sentence in English (compilers) ?

### Finance - Controllers Technology Office - VBA/SQL Developer - Associate at Select Portfolio Servicing was asked...

Feb 27, 2012
 Nothing was really unexpected
19 of 9 Interview Questions