• 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

Singly linked list

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

Password Predictor

SAP Hiring Off-Campus General Aptitude

Find an index i such that Arr [i] = i in array of n distinct integers sorted in ascending order.

Doubly linked list

Count number of ways to reach a given score in a game

Leetcode: Edit Distance

Printing intermediate Integers between one element & next element of array

Skiing on Mountains Matrix

Linked List V/S Binary Search Tree

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

Test Cases for Round Function

LeetCode: Container With Most Water

simple sql injection

Binary Tree in Java

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

Given a sorted array and a number x, find the pair in array whose sum is closest to x

Maximum size of square sub matrix with all 1’s in a binary matrix

Calculate price of parking from parking start end time prices

How Radix sort works

Coin Collection Dynamic Programming

Walmart Labs Interview Experience

SAP Interview Questions

Hackerearth : Counting Subarrays

Maximum sum contiguous subarray of an Array

LeetCode: Binary Tree Maximum Path Sum

Naurki.com Security Breach

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

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

Copyright © 2025 · Genesis Framework · WordPress · Log in