-
Notifications
You must be signed in to change notification settings - Fork 48
Yieni-Space #30
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?
Yieni-Space #30
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.
You did well on the methods you did finish. Take a look at my few comments and let me know what questions you have.
| # Time Complexity: O(1)? | ||
| # Space Complexity: O(1)? | ||
| def add_first(value) |
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.
👍 , very compact!
| # Time Complexity: o(n)? | ||
| # Space Complexity: O(1)? | ||
| def search(value) |
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.
👍
| # method to return the max value in the linked list | ||
| # returns the data value and not the node | ||
| def find_max |
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)? | ||
| # Space Complexity: O(1)? | ||
| def find_min |
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: ? | ||
| # Space Complexity: ? | ||
| def 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/space complexity ❓
| index.times do | ||
| current = current.next | ||
| end |
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.
What if index >= length?
| # Time Complexity: ? | ||
| # Space Complexity: ? | ||
| def get_at_index(index) |
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.
👍 With one caveat below
| # Time Complexity: ? | ||
| # Space Complexity: ? | ||
| def visit |
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 ❓
Hi Chris,
Sorry couldn't finish the last two. I don't feel good and I hit my wall.