jaiHo
BAN USER
Comments (7)
Reputation 0
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
0
of 0 vote
are you alluding to the fact that we can toss the coin twice and get 4 different cases?
and in a 10 sided die, you can neglect any three predefined cases?
in such a case (like 10 and 7) there is a chance that you will be in a non-terminating experiment.
if you know the answer, why not just tell rather than act f'cool..
Comment hidden because of low score. Click to expand.
0
of 0 vote
I have no idea what the fuss is all about. It is a simple Fibbonacci series.
f(n) = f(n-1) + f(n-2)
You can reach the nth floor either from n-1 st floor or directly from n-2 nd floor. so total ways to reach nth floor = ways to reach n-1 st floor + ways to reach n-2 nd floor.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
and u invented reverse-dfs or whatever that is? height of arrogance
- jaiHo September 30, 2009