Skip to content

Updated Course3 for TejusR #1774

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
+6 −0
Open

Updated Course3 for TejusR #1774

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
6 changes: 6 additions & 0 deletions Course3
View file
Original file line number Diff line number Diff line change
@@ -9,3 +9,9 @@ Pawan Dubey
Dynamic Programming
Understanding the prolem and implementing a solution which is space and time efficient by structuring it into sub problems.

Tejus Raju
Algorithm Analysis
Learnings from the module:
- Understanding different algorithms and the underlying problem statement it tries to solve
- Trying to fit the current problem statement to the ones that have been solved using these algorithms, and then solving them.
- Appreciating how algorithms scale and its complexities(Time and Space) and identifying which suits best based on the constraints at hand.