-
Notifications
You must be signed in to change notification settings - Fork 53
Iris Lux - Water #34
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: master
Are you sure you want to change the base?
Iris Lux - Water #34
Conversation
CheezItMan
left a comment
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Nice work Iris, you hit the learning goals here. Well done. Take a look at my comments and let me know what questions you have.
| # Time complexity: O(n), where n is size of number | ||
| # Space complexity: O(n) | ||
| def factorial(n) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
| # Time complexity: 0(n^2) where n is length od string | ||
| # Space complexity: 0(n^2) where n is length of string | ||
|
|
||
| def reverse(s) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
| # Time complexity: o(n) where n is length of string | ||
| # Space complexity: o(n) | ||
| def reverse_inplace(s, first = 0, last = s.length - 1) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
| # Time complexity: O(n) where n is size of number | ||
| # Space complexity: O(n) | ||
| def bunny(n) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
| # Time complexity: o(n) where n is length of string | ||
| # Space complexity: o(n) | ||
|
|
||
| def nested(s, first = 0, sub_length = s.length) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
| # Time complexity: O(n) where n is length of array | ||
| # Space complexity: O(n) | ||
|
|
||
| def search(array, value, i = 0) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
| # Time complexity: O(n) where n is the length of string | ||
| # Space complexity: O(n) where n is the length of string | ||
| # | ||
| def is_palindrome(s, first = 0, sub_length = s.length) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
| # Time complexity: O(logn) where n is the largest number | ||
| # Space complexity: O(logn) | ||
| def digit_match(n, m, count = 0) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
| # Space complexity: ? | ||
| def is_palindrome(s) | ||
| raise NotImplementedError, "Method not implemented" | ||
| def fib(n) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Time & space complexity?
No description provided.