London | 25-SDC-July | Ali Qassab | Sprint 2 | Implement a linked list in Python #46
Open
AliQassab wants to merge 1 commit intoCodeYourFuture:mainfrom
Open
London | 25-SDC-July | Ali Qassab | Sprint 2 | Implement a linked list in Python #46AliQassab wants to merge 1 commit intoCodeYourFuture:mainfrom
AliQassab wants to merge 1 commit intoCodeYourFuture:mainfrom
Conversation
|
Your PR description contained template fields which weren't filled in. Check you've ticked everything in the self checklist, and that any sections which prompt you to fill in an answer are either filled in or removed. If this PR is not coursework, please add the NotCoursework label (and message on Slack in #cyf-curriculum or it will probably not be noticed). |
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.
Learners, PR Template
Self checklist
Changelist
Implemented doubly linked list with O(1) operations:
push_head(value) - add to start, return handle
pop_tail() - remove from end
remove(node) - remove using handle
All operations maintain O(1) time complexity with proper edge case handling.
Questions
Ready for review! All tests pass.