Open
Conversation
Implemented three methods to reverse a singly-linked list using iteration and recursion.
Implemented two methods to remove the nth node from the end of a singly-linked list using different approaches.
Implement cycle detection in a linked list using the two-pointer technique.
Owner
|
The student has done a good job in providing multiple solutions to the problem. The iterative solution (way3) is the most efficient and matches the reference solution in terms of time and space complexity. The recursive solution is also correct but less efficient in terms of space. Strengths:
Areas for Improvement:
|
This file contains hidden or 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
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.