Update exercises/practice/change/.approaches/dynamic-programming/content.md

jagdish-15 · kahgoh · web-flow · commit 5db8204a406f · 2024-11-19T21:38:31.000+05:30
Co-authored-by: Kah Goh &lt;villastar@yahoo.com.au&gt;
diff --git a/exercises/practice/change/.approaches/dynamic-programming/content.md b/exercises/practice/change/.approaches/dynamic-programming/content.md
@@ -63,4 +63,4 @@ It minimizes the number of coins needed by breaking down the problem into smalle
 
 The time complexity of this approach is **O(n * m)**, where `n` is the `grandTotal` and `m` is the number of available coin denominations. This is because we iterate over all coin denominations for each amount up to `grandTotal`.
   
-- **Space Complexity**: The space complexity is **O(n)** due to the list `coinsUsed`, which stores the most efficient coin combination for each total up to `grandTotal`.
+The space complexity is **O(n)** due to the list `coinsUsed`, which stores the most efficient coin combination for each total up to `grandTotal`.

Original file line number	Diff line number	Diff line change
`@@ -63,4 +63,4 @@ It minimizes the number of coins needed by breaking down the problem into smalle`
`63`	`63`
`64`	`64`	The time complexity of this approach is *O(n m)**, where `n` is the `grandTotal` and `m` is the number of available coin denominations. This is because we iterate over all coin denominations for each amount up to `grandTotal`.
`65`	`65`
`66`		-- Space Complexity: The space complexity is O(n) due to the list `coinsUsed`, which stores the most efficient coin combination for each total up to `grandTotal`.
	`66`	+The space complexity is O(n) due to the list `coinsUsed`, which stores the most efficient coin combination for each total up to `grandTotal`.