Add partition_linked_list
algorithm with doctests
#13201
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.
In this PR, I implemented an algorithm to partition a linked list around a value
x
such that all nodes less thanx
come before nodes greater than or equal tox
, while preserving the original relative order within each partition. I used an approach that creates two linked lists and adds nodes to them based on the criteria. At the end, the two lists are joined. Time complexity O(n), space complexity O(n).Checklist: