From a371516c70fb41fc9cf0a902f1bb796c52ccb2b7 Mon Sep 17 00:00:00 2001
From: Teju17s <teejuuu06@gmail.com>
Date: Fri, 26 Sep 2025 22:23:04 +0530
Subject: [PATCH 1/2] Update Course1

---
 Course1 | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/Course1 b/Course1
index 2fe30ca6..0963b1d7 100644
--- a/Course1
+++ b/Course1
@@ -9,4 +9,8 @@ Pawan Dubey
 Dynamic Programming
 Understanding the prolem and implementing a solution which is space and time efficient by structuring it into sub problems.
 
+Dynamic Programming (DP) is a powerful technique used in computer science to solve optimization 
+and decision-making problems efficiently by breaking them down into overlapping subproblems and solving
+each subproblem only once, storing the results for future use.
+
 

From d7b6ea50e70bad4705bda0c98d370571f735062c Mon Sep 17 00:00:00 2001
From: telagamesttysabarit <telagamesttysabarit@TBMDVTELAGAMETT.local>
Date: Fri, 26 Sep 2025 22:32:54 +0530
Subject: [PATCH 2/2] Added my name and learnings to course3

---
 .DS_Store | Bin 0 -> 6148 bytes
 Course1   |  10 ++++++++++
 Course2   |   7 +++++++
 Course3   |   7 +++++++
 4 files changed, 24 insertions(+)
 create mode 100644 .DS_Store

diff --git a/.DS_Store b/.DS_Store
new file mode 100644
index 0000000000000000000000000000000000000000..ee2dccb5ce2f687cd455a32ada85af9fd50a302c
GIT binary patch
literal 6148
zcmeHKJ5Iwu5Pcggk%%TG4bq;#Qs4q6aS93=asiZ&0+J&~KtzdqjzJFx-~il(OTe4m
zQ4~9n5&@c#X5V_|&93}xdAtBze>Lp^T>x#mV5`I73zNL~mbEk@NhfO*^WJDuE|yzN
z3;b3E<k=-iF~>FT>d)`>c{8^t^L$*CW5(L|?@#%|;O(@YpYF^ruQuL|mS-vUF+hnG
zZg7hkdS^vB(H-P<l-1LZU_x%Nj~nclo$Ql3+Z{F79b90@9dn!$Q!FrTR6I5+cxh$|
zm;$E2pH+Z8TdaK$(MD6i6fgzW3dr}t(*-ldDq{F_a0o{LV#07R&gJJ#YP@2mSVd%p
z=3*%^mO4FRxLD4(S6-%AMU3TediZd<v(pob3%hfDALwvdL>o;3Q=qQEUcBr|{~vyT
z{;wC=l__8f{3``ql8^E}Z%KRW*3C(;_4G@+nDDBI>k>{vD<)T3@gY4J<6b7jOtFf{
Q2+e*3f($m80zaz2C+cci{Qv*}

literal 0
HcmV?d00001

diff --git a/Course1 b/Course1
index 0963b1d7..0fe91805 100644
--- a/Course1
+++ b/Course1
@@ -14,3 +14,13 @@ and decision-making problems efficiently by breaking them down into overlapping
 each subproblem only once, storing the results for future use.
 
 
+
+
+
+Your Name: Tejaswi
+Module Name: Python Functions
+
+I learned how to create and use functions in Python.  
+It helped me understand how to reuse code and organize logic better.  
+The practical examples made it easier to grasp function arguments and return values.
+
diff --git a/Course2 b/Course2
index c6128422..b25b1897 100644
--- a/Course2
+++ b/Course2
@@ -7,3 +7,10 @@ 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.
+
+Your Name: Tejaswi
+Module Name: Python Functions
+
+I learned how to create and use functions in Python.  
+It helped me understand how to reuse code and organize logic better.  
+The practical examples made it easier to grasp function arguments and return values.
diff --git a/Course3 b/Course3
index 6ebe1c1f..aa641582 100644
--- a/Course3
+++ b/Course3
@@ -9,3 +9,10 @@ Pawan Dubey
 Dynamic Programming
 Understanding the prolem and implementing a solution which is space and time efficient by structuring it into sub problems.
 
+
+Your Name: Tejaswi
+Module Name: Python Functions
+
+I learned how to create and use functions in Python.  
+It helped me understand how to reuse code and organize logic better.  
+The practical examples made it easier to grasp function arguments and return values.