Bloomberg LP Interview Question

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

I think recursive approach will be more CPU intensive as with every recursive call all the local variables will be pushed to stack and then taken out which is a heavy option....

- Saurabh August 02, 2011 | Flag Reply
Comment hidden because of low score. Click to expand.
of 0 votes

That is not the main reason. If you look at it closely... you are computing almost all fibnacci numbers twice.

fib(n) = fin(n-1) + fib(n-2) <-- fib(n-1) includes a call to fib(n-2).
So you are calling fib(n-2) twice. Similarly for all numbers till n-2

- Satish June 13, 2013 | Flag

Add a Comment

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


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


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