Leetcode 746. Min Cost Climbing Stairs

Find the minimum total cost to reach the top when you may start at index 0 or 1 and at each move climb 1 or 2 steps, paying cost[i] when you land on step i — a classic dynamic programming problem taking the min of one- and two-step transitions.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 746. Min Cost Climbing Stairs

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact