Simran and stairs
Simran is running up a staircase with N steps, and can hop(jump) either 1 step, 2 steps or 3 steps at a time.You have to count, how many possible ways Simran can run up to the stairs.
Input Format:
Input contains integer N that is number of steps
Output Format:
Output for each integer N the no of possible ways w.
Constraints
\(1 \le N \le 30\)
Time Limit:
0.15 sec(s)
for each input file.
Memory Limit:
256 MB
Source Limit:
1024 KB
Marking Scheme:
Marks are awarded when all the testcases pass.
Allowed Languages:
Bash,
C,
C++,
C++14,
Clojure,
C#,
D,
Erlang,
F#,
Go,
Groovy,
Haskell,
Java,
Java 8,
JavaScript(Rhino),
JavaScript(Node.js),
Julia,
Kotlin,
Lisp,
Lisp (SBCL),
Lua,
Objective-C,
OCaml,
Octave,
Pascal,
Perl,
PHP,
Python,
Python 3,
R(RScript),
Racket,
Ruby,
Rust,
Scala,
Swift,
Swift-4.1,
TypeScript,
Visual Basic
![](http://www.facebook.com/sharer.php?s=100&p[url]=https://www.hackerearth.com/practice/basic-programming/recursion/recursion-and-backtracking/practice-problems/algorithm/simran-and-stairs/&p[images][0]=https://static-fastly.hackerearth.com/static/hackerearth/images/logo/HE_cover.jpg&p[title]=Get your %23programming basics right! Solve this problem and see how good you are!"){kind=link}