Climbing stairs using DP

I started interview prep playlist of leetcode called blind - 75 and took Dynamic programming topic for solving and came across this problem climbing stairs Logic is simple .Let us take an example n = 1 means there is 1 stair and number of steps requ...