upgrad-edu · dhureen1 · Feb 12, 2026
diff --git a/.idea/.gitignore b/.idea/.gitignore
diff --git a/.idea/Course.iml b/.idea/Course.iml
diff --git a/.idea/misc.xml b/.idea/misc.xml
diff --git a/.idea/modules.xml b/.idea/modules.xml
diff --git a/.idea/vcs.xml b/.idea/vcs.xml
diff --git a/Course1 b/Course1
@@ -9,4 +9,6 @@ Pawan Dubey
 Dynamic Programming
 Understanding the prolem and implementing a solution which is space and time efficient by structuring it into sub problems.
 
-
+Dhureen Shettigar
+Divide and Conquer Algorithms
+I learned how divide and conquer algorithms break complex problems into smaller subproblems, solve them recursively, and then combine the results efficiently. I understood important techniques like recursion, recurrence relations, and time complexity analysis using Master Theorem.