Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Min Steps to 1 [SWOC] #118

Closed
shradhaagarwal01 opened this issue Jan 9, 2021 · 2 comments
Closed

Min Steps to 1 [SWOC] #118

shradhaagarwal01 opened this issue Jan 9, 2021 · 2 comments

Comments

@shradhaagarwal01
Copy link

Hello sir, I am a participant in SWOC 2021, I would like to contribute by adding the code for Min Steps to 1 In Dynamic Programming.
Kindly assign this issue to me.
Thank you.

@Abhijit2505
Copy link
Member

See the minimum step to 1 depends on the condition given, we already have a stair case method in our dp module, do you want to add something else ?

@shradhaagarwal01
Copy link
Author

Yes, Matrix Chain Multiplication Problem in Dynamic Programming.

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

No branches or pull requests

2 participants