diff --git a/algorithms/CPlusPlus/Dynamic-Programming/minimum-pathsum.cpp b/algorithms/CPlusPlus/Dynamic-Programming/minimum-pathsum.cpp
index ece3d2cc..255440e6 100644
--- a/algorithms/CPlusPlus/Dynamic-Programming/minimum-pathsum.cpp
+++ b/algorithms/CPlusPlus/Dynamic-Programming/minimum-pathsum.cpp
@@ -34,4 +34,8 @@ int main() {
   int m = matrix[0].size();
   
   cout<<minSumPath(n,m,matrix);
-}
\ No newline at end of file
+}
+// Time Complexity: O(N*M)
+// Space Complexity: O((M-1)+(N-1)) + O(N*M)
+// example : N=2,M=3
+// Min pathsum = 5+9+6+2 =21
\ No newline at end of file
diff --git a/algorithms/CPlusPlus/Dynamic-Programming/unique-paths.cpp b/algorithms/CPlusPlus/Dynamic-Programming/unique-paths.cpp
index 307d8e64..e646980c 100644
--- a/algorithms/CPlusPlus/Dynamic-Programming/unique-paths.cpp
+++ b/algorithms/CPlusPlus/Dynamic-Programming/unique-paths.cpp
@@ -43,4 +43,8 @@ int main() {
   int n=2;
   
   cout<<countWays(m,n);
-}
\ No newline at end of file
+}
+// Time Complexity: O(M*N)
+// Space Complexity: O(M*N)
+// example : M=3,N=2
+// Unique paths = 3
\ No newline at end of file