CareerCup

  • Questions
  • Forum
  • Resume Tips
  • RSS
  • Sign In

Bloomberg LP Interview Question for Financial Software Developers


More Questions from This Interview



Comment hidden because of low score. Click to expand.
0
of 0 vote

Splay tree would do...

- Veeru January 30, 2011 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

Splay trees are good for getting the last accessed element, I doubt how good will it be to store the order of the frequently occuring numbers.

- Anonymous January 31, 2011 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 vote

treap anyone?

- Anonymous January 30, 2011 | Flag Reply
Comment hidden because of low score. Click to expand.
1
of 1 vote

wtf is a treap?

- Anonymous January 31, 2011 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 votes

banned by google?

- Anonymous January 31, 2011 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 votes

Treap is a Tree+Heap. Google it.

- Anonymous November 13, 2013 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 vote

a min heap would suffice...

- Anonymous January 31, 2011 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

I prefer a skip list.

- GekkoGordan January 31, 2011 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

Guys, you can't just make stuff up

- funny bone January 31, 2011 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

@funny bone: there's no right answer for this question because it totally depends on the problem. min heap, splay trees, skip lists etc.. all of them can give O(logn) performance but if the frequency of numbers changes uniformly then that would affect the performance depending on the data structure.

- GekkoGordan January 31, 2011 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 vote

std::make_heap in C++

- Passerby_A March 16, 2014 | Flag Reply


Add a Comment
Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More

Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.

Learn More

Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More