HACKER RANK: Davis Staircase/ Nth Staircase

One of the most famous interview problems, sometimes asked by the name "Nth Staircase". I have solved it using Dynamic Programming.
Before attempting it, have a look at,
Time Complexity- O(n)
Space Complexity: O(n)