TheAlgorithms · Nov 16, 2024
diff --git a/‎dynamic/traprainwater.go
+2 b/‎dynamic/traprainwater.go
+2
diff --git a/‎dynamic/uniquepaths.go
+2 b/‎dynamic/uniquepaths.go
+2
@@ -5,6 +5,8 @@
 // It uses dynamic programming to precompute the maximum height of bars to the left and right of each position.
 // Then, it iterates through the array to calculate the amount of trapped rainwater at each position based on the minimum of the left and right maximum heights.
 // Finally, it sums up the trapped rainwater for all positions and returns the total amount.
+// time complexity: O(n)
+// space complexity: O(n)
 // author(s) [TruongNhanNguyen (SOZEL)](https://github.com/TruongNhanNguyen)
 package dynamic
 
 
@@ -1,4 +1,6 @@
 // See https://leetcode.com/problems/unique-paths/
+// time complexity: O(m*n) where m and n are the dimensions of the grid
+// space complexity: O(m*n) where m and n are the dimensions of the grid
 // author: Rares Mateizer (https://github.com/rares985)
 package dynamic