• 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

‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.

April 13, 2015 by Dhaval Dave

A building has n steps. A person can take 1,2 or 3 steps. In how many ways can a person reach top of building.

In order to build logic, lets think from first step
If N=1 and Steps=1. There is only 1 way to reach with 1 step.
F(1)=1

If N=2 and Steps=1. There 1  way to reach with 1+1 step.
F(2)=1

if N=2 and Steps=1,2 . There are 2 ways to reach, with 1+1 & 0+2 steps.
F(2)=2
if N=3 and Steps=1,2 . There are 3 ways to reach, with 1+1+1 , 1+2 & 2+1 steps.
F(3)=3.


if N=4 and Steps=1,2 . There are 5 ways to reach, with 1+1+1+1 , 1+2+1 , 1+1+2 , 2+1+1  & 2+2 steps.
F(4)=5

So what is that function , does it look similar to fibonacchi series ?

F(n) = F(n-1) + F(n-2)

So Extend the same function for 3 steps

F(n) = F(n-1) + F(n-2) + F(n-3)

So code it

int main()
{
  int n, first = 0, second = 1, third=1, next, c;
  printf("Enter the number of terms\n");
  scanf("%d",&n);
  for ( c = 3; c < n ; c++ )
      {
       next = first + second + third;
       first = second;
       second = third;
       third = next ;
      }

  printf("Total Steps required =%d\n",next);
  return 0;
}

Similar Articles

Filed Under: Adobe Interview Questions, Amazon Interview Question, Microsoft Interview Questions, problem Tagged With: Dynamic Programming, Mathematical, Recursion

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

Binary Tree Isomorphic to each other

Find the number ABCD such that when multipled by 4 gives DCBA.

Flipkart SDET Interview Experience

Hackerearth : Counting Subarrays

Subset Sum Problem Dynamic programming

Longest Increasing Subsequence

Stock Buy Sell to Maximize Profit

The Magic HackerEarth Nirvana solutions Hiring Challenge

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

Maximum difference between two elements s.t larger element appears after the smaller number

Best Java Book | Top Java Programming Book for Beginners

flattens 2 D linked list to a single sorted link list

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

HackeEarth Flipkart’s Drone

Python String and numbers

Interfaces in C++ (Abstract Classes in C++)

Trie Dictionary

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

FizzBuzz Solution C C++

Singly linked list

Wrong Directions given find minimum moves so that he can reach to the destination

Circular Linked List

Possible sizes of bus to carry n groups of friends

Binary Tree in Java

Naurki.com Security Breach

Regular Expression Matching

CodeChef Code SGARDEN

Right view of Binary tree

Find loop in Singly linked list

Test Cases for Round Function

Copyright © 2026 · Genesis Framework · WordPress · Log in