Skip to content

Dynamic Programming #1786

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.

Sign up for GitHub

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

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Dynamic Programming #1786

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions Course2
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,6 +4,6 @@ You can choose one module from the list below:-
2)Divide and Conquer Algorithms
3)Dynamic Programming

Pawan Dubey
Kushagra Dwivedi
Dynamic Programming
Understanding the prolem and implementing a solution which is space and time efficient by structuring it into sub problems.
Dynamic Programming is a method used in computer science and mathematics to solve complex problems by breaking them down into simpler subproblems. It stores the results of subproblems to avoid redundant calculations, making algorithms more efficient. DP is commonly used in optimization problems, like shortest paths, knapsack, or sequence alignment.