← Qualcomm questions
CodingEasyReported in a candidate post, Aug 2026

Climbing Stairs Dynamic Programming

Filed under Qualcomm

You are climbing a staircase that takes n steps to reach the top. Each time you can either climb 1 or 2 steps. Find the number of distinct ways you can reach the top, specifically for n = 10.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Qualcomm questions

Collected from public candidate posts and coding forums. Updated Nov 2026.