CareerCup

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

Bloomberg LP Interview Question for Software Engineer / Developers






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

The probability depends on the no. of datastructures and no. of complexities .Assuming both are n it is 1/n*1/n*1/n.....n times
1/(n power n)

- Ann February 22, 2007 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

Mabye No, I guess it is 1/(n!). Not sure.

- bedscape May 02, 2007 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

No Pal, it is 1/n * 1/n * and so on upto n.. this is because, he can pick the same complexity for a data structure again and again.

- Abhi August 25, 2007 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

shuld be okay.

1/(number of options)^(number of questions)

- Addy June 18, 2009 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 vote

Itz O(log n ) .. i know itz suprising for ppl
but do check out the LAS VEGAS Algorithm which
is a random/probabilistic algorithm!.

plz some one verify.. according to me las vegas algorithm should work fine for the mad monkey problem

- Sunil Mallya September 05, 2007 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

THE LOS VEGAS ALGORITHM!!! Is this some Ocean's series lingo??

- Mayur October 09, 2007 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

He probably means using the Monte Carlo method.

- Me October 29, 2007 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 votes

he means he wants to use the HONOLULU algorithm...

- YOU April 28, 2008 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 votes

before giving weird comments, just check the authenticity of the post.
http://en.wikipedia.org/wiki/Las_Vegas_algorithm
now it's up to you if believe it or make fun of it.

Cheers

- keshav August 17, 2008 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 vote

LAS VEGAS Algorithm does exist, I don't think a link from NIST.GOV would be lying.. lol

http://www.nist.gov/dads/HTML/lasVegas.html

- TimeVision December 01, 2008 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

Funny comment. The question asked to find the probability. The guy responds the complexity of the algorithm. Funny world!!

- Anonymous January 11, 2010 | 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