Fire - Noor #37
Open
Fire - Noor #37
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
CheezItMan
reviewed
Nov 4, 2020
Comment on lines
+3
to
5
| # Time complexity: O(n) | ||
| # Space complexity: O(n) | ||
| def factorial(n) |
Comment on lines
+11
to
13
| # Time complexity: O(n) | ||
| # Space complexity: O(n) | ||
| def reverse(s) |
Comment on lines
+27
to
29
| # Time complexity: O(n) | ||
| # Space complexity: O(n) | ||
| def reverse_inplace(s) |
There was a problem hiding this comment.
Think about if we changed the method signature to the following
Suggested change
| # Time complexity: O(n) | |
| # Space complexity: O(n) | |
| def reverse_inplace(s) | |
| # Time complexity: O(n) | |
| # Space complexity: O(n) | |
| def reverse_inplace(s, low = 0, high= s.length - 1) |
Can you see a way to do this with O(n) space/time complexity now?
Comment on lines
+38
to
40
| # Time complexity: O(n) | ||
| # Space complexity: O(n) | ||
| def bunny(n) |
Comment on lines
+50
to
+51
| if s[i+1] == "(" && s[-i] == ")" | ||
| return true |
There was a problem hiding this comment.
Suggested change
| if s[i+1] == "(" && s[-i] == ")" | |
| return true | |
| if s[i-1] == "(" && s[-i] == ")" | |
| return nested(s, i + 1) |
Comment on lines
+59
to
+61
| # Time complexity: O(n) | ||
| # Space complexity: O(n) | ||
| def search(array, value, i = 0) |
Comment on lines
+68
to
70
| # Time complexity: O(n) | ||
| # Space complexity: O(n) | ||
| def is_palindrome(s) |
There was a problem hiding this comment.
👍 Because of the slice you are doing with each recursive call, it's O(n^2)
Comment on lines
+81
to
+87
| if n[i] == m[i] | ||
| return count + 1 | ||
| else | ||
| return count | ||
| end | ||
|
|
||
| return digit_match(n, m, i + 1, count) |
There was a problem hiding this comment.
Suggested change
| if n[i] == m[i] | |
| return count + 1 | |
| else | |
| return count | |
| end | |
| return digit_match(n, m, i + 1, count) | |
| if n[i] == m[i] | |
| count += 1 | |
| end | |
| return digit_match(n, m, i + 1, count) |
Comment on lines
+78
to
+79
| n.to_s | ||
| m.to_s |
There was a problem hiding this comment.
Suggested change
| n.to_s | |
| m.to_s | |
| n = n.to_s | |
| m = m.to_s |
Comment on lines
+75
to
+77
| # Time complexity: O(n) | ||
| # Space complexity: O(n) | ||
| def digit_match(n, m, i = 0, count = 0) |
There was a problem hiding this comment.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
No description provided.