Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 963d53d

Browse files
Update README.md
1 parent cef5e24 commit 963d53d

File tree

1 file changed

+1
-0
lines changed
  • Practice Problems/Backtracking/Rat In A Maze

1 file changed

+1
-0
lines changed

‎Practice Problems/Backtracking/Rat In A Maze/README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -41,5 +41,6 @@ Complexity Analysis:
4141

4242
Time Complexity: O(2^(n^2)).
4343
The recursion can run upperbound 2^(n^2) times.
44+
4445
Space Complexity: O(n^2).
4546
Output matrix is required so an extra space of size n*n is needed.

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /