You're building your DP foundation here. If you can't solve Climbing Stairs in 5 minutes, you're not ready for harder DP. Amazon, Google, and Microsoft use this as a warm-up or phone screen question. Your interviewer tests whether you understand recurrence relations and can optimize from O(n) space to O(1). The Fibonacci pattern appears in House Robber, Decode Ways, and many more.
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
$ curl repovive.com/roadmaps/maang-interview-prep/dynamic-programming/climbing-stairs-why-this-problem
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░██████████████████████████████████████████████████████████████████████████████████████████████████████