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.

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

adding my learnings #1765

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

adding my learnings #1765

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
5 changes: 5 additions & 0 deletions Course2
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -7,3 +7,8 @@ You can choose one module from the list below:-
Pawan Dubey
Dynamic Programming
Understanding the prolem and implementing a solution which is space and time efficient by structuring it into sub problems.

Nikhil Rai
Divide and Conquer Algorithms
Through these algorithms I understood how breaking the big problem into smaller ones and storing there resuls helps us in reduced computation time.
Some examples are Recursion,Binary Search