[FEAT] Implement Flattening MultiLevel LinkedList #6670
+204
−0
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.
This pull request adds an implementation for the
Flattening a Multilevel Linked List
.The problem involves a linked list where each node has a next pointer and a child pointer. The child pointer points to a separate, sorted linked list. This algorithm recursively merges these lists into a single, fully sorted list connected by the child pointers.
This submission includes:
FlattenMultilevelLinkedList.java
: The core implementation.FlattenMultilevelLinkedListTest.java
: A corresponding set of unit tests to ensure correctness.All local tests pass successfully.