Interview Advice & Tips
Jobs Open Hiring
Loading...
Our Sites：
SalaryList
ResumeList
InterviewList
JobsOpenHiring
JobsAndCareer
Become a member
|
Sign In
|
Help
Recent:
Cisco
,
Inside Sales Representative
Home
Most Common
Interview Questions by Function
Interview Questions by Company
Interview Questions by Jobs
Interview Tool
Guides& Tips
Home
» Someone can go up on stairs from one or two steps, how many different ways to go up on a stairs with n steps. What is T(n) for climbing n steps
Someone can go up on stairs from one or two steps, how many different ways to go up on a stairs with n steps. What is T(n) for climbing n steps
You may type your answer here 1.Save to your account for future preparation (If you login, your last draft will be shown here) 2.Save and publish your sample answer, and the community might comment You can also pick sample answers, and it will be shown here for your modification if you’ve logged in.
Save
To my account privately
Publish
To community for feedback
Is this question difficult?
Bad
Boring
Ok
Good
Excellent
Is this question very common?
Bad
Boring
Ok
Good
Excellent
This Question Category
Algorithm Interview Questions
Google Interview Questions
Software Engineer Interview Questions
This Question has been asked
Were you asked this question?
Yes
©2007-2012 InterviewList.com
About
|
Terms
|
Privacy
|
Help
Interview Questions and Answers for Job Interviews
Real Jobs Salary
(Find out your pay)
Today's Hot Jobs
run time=0.15831613540649
