Count ways to N'th Stair | GfG Problem of the Day | Dynamic Programming

[@codetips-byRochak]

Let's Connect 🤝 :
LinkedIn : www.linkedin.com/in/rochak-vyas17/
Code :
class Solution{
public:
int nthStair(int n){
int dp[n+1];
dp[1]=1;
dp[2]=2;
for(int i=3;i

[@jayrathod9271]

return int(n/2) +1

[@codetips-byRochak]

Yeah this can also work

[@vijayanks1714]

your solution ok but for longer run learn the dp variation that is the take from the problem