search

SarthakKeshari / Java-Questions-and-Solutions

This repository aims to solve and create new problems from different spheres of coding. A path to help students to get access to solutions and discuss their doubts.
MIT License
47 stars 98 forks source link

Min Cost Climbing Stairs #408

Closed satyam878 closed 2 years ago

satyam878 commented 2 years ago

Enter your question -

You are given an integer array cost where cost[i] is the cost of ith step on a staircase. Once you pay the cost, you can either climb one or two steps.

You can either start from the step with index 0, or the step with index 1.

Return the minimum cost to reach the top of the floor.

Enter link to the question(if question belongs to any online platform) -

https://leetcode.com/problems/min-cost-climbing-stairs/

Tags for the question(eg - Array, Basic, Stack, etc.) -

Array, Dynamic Programming

satyam878 commented 2 years ago

Kindly assign me this task @SarthakKeshari

SarthakKeshari commented 2 years ago

@satyam878, Kindly add your solution to "leetcode" folder. Deadline - 13/10/2021

This Issue will only be counted towards ranking criteria of this repository. Gentle advice- A bit more tough questions would be appreciated for Hacktoberfest tag.