Skip to contentSkip to footer

Financial Software Developer Internship Interview Questions

Salaries
Interviews

758 financial software developer internship interview questions shared by candidates

If you have all the companies that are traded, and live inputs are coming of which company is being traded and what is the volume, how do you maintain the data, so that you can carry out operation of giving the top 10 most traded companies by volume of shares most efficiently.
avatar

Financial Software Developer Intern

Interviewed at Bloomberg

4★
Apr 14, 2013

If you have all the companies that are traded, and live inputs are coming of which company is being traded and what is the volume, how do you maintain the data, so that you can carry out operation of giving the top 10 most traded companies by volume of shares most efficiently.

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
avatar

2013 Financial Software Developer

Interviewed at Bloomberg

4★
Sep 13, 2013

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

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).
avatar

Financial Software Developer

Interviewed at Bloomberg

4★
Jul 11, 2014

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).

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.
avatar

Financial Software Developer Intern

Interviewed at Bloomberg

4★
Sep 25, 2012

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.
avatar

Financial Software Developer Intern

Interviewed at Bloomberg

4★
Oct 7, 2013

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.

Viewing 101 - 110 interview questions

Glassdoor has 758 interview questions and reports from Financial software developer internship interviews. Prepare for your interview. Get hired. Love your job.