Skip to content
Open
Changes from all commits
Commits
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
16 changes: 4 additions & 12 deletions Course2
Original file line number Diff line number Diff line change
@@ -1,12 +1,4 @@
Hello you can tell us your name and the module name from course2 you want to contribute to.
You can choose onemodule from the list below:-
1)Algorithm Analysis
2)Divide and Conquer Algorithms
3)Divide & Conquer Algorithms
4)Greedy Algorithm
5)Dynamic Programming


Pawan Dubey
Dynamic Programming
Understanding the prolem and implementing a solution which is space and time efficient by structuring it into sub problems.
Hello, My Name is Jeevak Kharat from course2

1) Dynamic Programming
Dynamic programming (DP) is a powerful algorithmic technique used to solve complex problems by breaking them down into simpler, overlapping subproblems and storing the results to avoid redundant computations. It is a method for optimizing recursive solutions, often reducing exponential time complexities to polynomial time.