• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

March 24, 2014 by Dhaval Dave

Given n stairs, how many number of ways can you climb if u use either 1, 2 or 3 at a time?

When you find any difficult problem first step is to reduce it to very small problem with example
Consider 3 steps. you can take only one at a time. Then number of ways are 1: ie {(1,1,1)}
Consider 2 steps. you can take 1 or 2 at a time. Then number of ways are 2: ie {(1,1), (2)}

Consider 3 steps. you can take 1 or 2 at a time Number of ways : 3 ie : {(1,2),(2,1),(1,1,1)}
Consider 4 steps. you can take 1 or 2 at a time Number of ways : 5
ie {(1,1,1,1), (1,2,1),(1,1,2),(2,1,1),(2,2)}
See carefully 2,3,5……
This makes Fibonacci series

because If we are at Nth step then to reach at bottom (same as climbing) at each step we can decide whether to take N-1 or N-2 step and at each decision further option keeps open.

so Function if we can take 1 or 2 is

F(n) = F(n-1) + F(n-2) ;
Similarly if we can take three steps 1,2 or 3
F(n) = F(n-1) + F(n-2) + F(n-3) ;

Similar Articles

Filed Under: Adobe Interview Questions, problem, Puzzle Tagged With: Mathematical

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Code Chef PRGIFT Solution

Print Power Set of a Set

Find the smallest window in a string containing all characters of another string

Find if two rectangles overlap

Reliance Jio Software Developer Interview Experience

LeetCode : Word Search

Print vertical sum of all the axis in the given binary tree

Diagonal Traversal of Binary Tree

Maximum of all subarrays of size k

simple sql injection

Binary Tree in Java

Check if an array has duplicate numbers in O(n) time and O(1) space

Python List

Check Binary Tree is Binary Search Tree or not

Serialise Deserialise N-ary Tree

SAP Off Campus Hiring_ March 2015 Analytical Aptitude

Test Cases for Round Function

K’th Largest Element in BST when modification to BST is not allowed

Get K Max and Delete K Max in stream of incoming integers

Difference between a LinkedList and a Binary Search Tree BST

LeetCode: Container With Most Water

SAP Off Campus Hiring_ March 2015 Computer Skills

1014 Practice Question of New GRE – Princeton

SAP Off Campus Hiring_ March 2015 Sample Questions

Spanning Tree

How strtok() Works

Level order traversal in Spiral form

Find the kth number with prime factors 3, 5 and 7

FizzBuzz Solution C C++

Reversal of LinkedList

Copyright © 2025 · Genesis Framework · WordPress · Log in