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

Added a question in dynamic programming #280

Merged
merged 3 commits into from Oct 29, 2019
Merged

Conversation

imehar
Copy link
Contributor

@imehar imehar commented Oct 26, 2019

Description

Added a new Dynamic Programming quesion.

Fixes #279

Type of change

Please delete options that are not relevant.

  • New feature/question

Checklist:

  • My code follows the style guidelines of this project i.e. Pep8
  • I have performed a self-review of my own code
  • I have commented my code, particularly in hard-to-understand areas
  • Any dependent changes have been merged and published in downstream modules
  • I have squashed unnecessary commits

Copy link
Owner

@prabhupant prabhupant left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Please follow Pep8

@imehar
Copy link
Contributor Author

imehar commented Oct 27, 2019

I've done the required the changes and checked with pep8 style checker, have a look

@prabhupant
Copy link
Owner

Its still not Pep8. Pep8 uses snake_case, not camelCase

@imehar
Copy link
Contributor Author

imehar commented Oct 28, 2019

Done. Sorry for the inconvenience

@prabhupant prabhupant merged commit 4ca6256 into prabhupant:master Oct 29, 2019
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

Successfully merging this pull request may close these issues.

New question : find number of ways to get given sum from "n" dice having "m" faces
2 participants