Climbing Stairs at Adobe

Easy53.9% acceptance

This problem has 75.0% frequency at Adobe.

Problem Description

You are climbing a staircase. It takes `n` steps to reach the top. Each time you can either climb `1` or `2` steps. In how many distinct ways can you climb to the top?

Read full problem and hints

Topics

Math Dynamic Programming Memoization

Also asked at 37 companies

Accenture Accolite Agoda Amazon Apple Barclays BlackRock Bloomberg ByteDance Citadel Cognizant Deloitte Disney Flipkart Fractal Analytics Goldman Sachs Google Grammarly HPE HSBC+17 more

View Full Problem

Problem Description

Topics

Also asked at 37 companies

More Adobe Questions