Bloomberg LP Interview Question for Software Engineer / Developers






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

Yy using hash table we can make a search easily and we can use this DBMS so that when ever we try to find out something it will be more useful ...

- sasibhushan July 31, 2010 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

search in hash happens in O(1) time if there are no collisions, and in the average case search happens in constant time. (assuming some collisions in the table)

- rakifeda August 01, 2010 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

Excellent performance in searching, insertion and deletion, average case is O(1), worst case is O(n)

- orangetime23 May 20, 2013 | 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