Update algorithms/dynamic_programming/frog_jump/README.md

BrianLusina · coderabbitai[bot] · web-flow · commit 07e2005ba4c7 · 2026-02-06T15:51:14.000+03:00
Co-authored-by: coderabbitai[bot] &lt;136622811+coderabbitai[bot]@users.noreply.github.com&gt;
diff --git a/algorithms/dynamic_programming/frog_jump/README.md b/algorithms/dynamic_programming/frog_jump/README.md
@@ -81,4 +81,4 @@ previous jump lengths, and for each valid state, it performs constant-time looku
 
 ### Space Complexity
 
-The algorithm’s space complexity is `O(n)` occupied by the mapper map.
+The algorithm's space complexity is `O(n)` for the mapper map, plus `O(1)` for the fixed-size 2D DP array (1001 x 1001), assuming the constraints guarantee `n ≤ 1000`.

Original file line number	Diff line number	Diff line change
`@@ -81,4 +81,4 @@ previous jump lengths, and for each valid state, it performs constant-time looku`
`81`	`81`
`82`	`82`	`### Space Complexity`
`83`	`83`
`84`		-The algorithm’s space complexity is `O(n)` occupied by the mapper map.
	`84`	+The algorithm's space complexity is `O(n)` for the mapper map, plus `O(1)` for the fixed-size 2D DP array (1001 x 1001), assuming the constraints guarantee `n ≤ 1000`.