Skip to content
This repository has been archived by the owner on Oct 6, 2021. It is now read-only.

Climb Stairs With Minimum Moves using DP #214

Open
nikhil072000 opened this issue Oct 2, 2021 · 4 comments
Open

Climb Stairs With Minimum Moves using DP #214

nikhil072000 opened this issue Oct 2, 2021 · 4 comments

Comments

@nikhil072000
Copy link
Contributor

nikhil072000 commented Oct 2, 2021

🚀 Feature

Climb Stairs with minimum moves: Total no. of stairs and value for each step is given, these value represents till how far from the step you could jump to in a single move. Starting from 0th step, we've to reach to the top of stair case in minimum no. of moves.

Have you read the Contribution Guidelines?

Yes

Pitch

This is a very popular question related to arrays and DP, asked in many placement exams. Please assign this to me for JAVA.

Assignees

(Do not make changes in this section until asked to do so)
C - @anshkush92college
C# -
C++ - @Yash091
Go -
Java - @nikhil072000
Javascript -
Kotlin -
Python -

@Yash091
Copy link
Contributor

Yash091 commented Oct 2, 2021

@manan025 Please assign me this in C++.

@manan025
Copy link
Owner

manan025 commented Oct 2, 2021

@nikhil072000 - Java
@Yash091 -C++ assigned

@anshkush92
Copy link

@manan025 Please assign me this in C

@manan025
Copy link
Owner

manan025 commented Oct 2, 2021

@anshkush92college - C assigned

Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Projects
None yet
Development

No branches or pull requests

4 participants