Skip to content

Conversation

@kaseea
Copy link

@kaseea kaseea commented Sep 3, 2019

No description provided.

Copy link

@CheezItMan CheezItMan left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Nice work, you got all the requirements done here. Take a look at my comments and let me know if you have any questions.

# method to add a new node with the specific data value in the linked list
# insert the new node at the beginning of the linked list
# Time Complexity: O(1)
# Space Complexity n?

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Actually O(1) since you're only adding 1 node to the list.

Comment on lines +165 to +166
# Time Complexity:
# Space Complexity

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Time & Space complexity?

raise NotImplementedError
# find the nth node from the end and return its value
# assume indexing starts at 0 while counting to n
# Time Complexity: O(n) + N

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

You can actually do this in O(n)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants