- Notifications
You must be signed in to change notification settings - Fork20.5k
[FEAT] Implement Flattening MultiLevel LinkedList#6670
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to ourterms of service andprivacy statement. We’ll occasionally send you account related emails.
Already on GitHub?Sign in to your account
Open
Priyanshu1303d wants to merge1 commit intoTheAlgorithms:masterChoose a base branch fromPriyanshu1303d:feat/FlattenMultilevelLinkedList
base:master
Could not load branches
Branch not found:{{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline, and old review comments may become outdated.
Open
[FEAT] Implement Flattening MultiLevel LinkedList#6670
Priyanshu1303d wants to merge1 commit intoTheAlgorithms:masterfromPriyanshu1303d:feat/FlattenMultilevelLinkedList
+204 −0
Conversation
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
codecov-commenter commentedOct 6, 2025 • edited
Loading Uh oh!
There was an error while loading.Please reload this page.
edited
Uh oh!
There was an error while loading.Please reload this page.
Codecov Report✅ All modified and coverable lines are covered by tests. Additional details and impacted files@@ Coverage Diff @@## master #6670 +/- ##============================================+ Coverage 76.45% 76.47% +0.01%- Complexity 5985 5993 +8============================================ Files 716 717 +1 Lines 20265 20286 +21 Branches 3929 3931 +2 ============================================+ Hits 15494 15514 +20- Misses 4180 4181 +1 Partials 591 591 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
2bd3805
tob3a93bd
Compareb3a93bd
toa25b4c1
CompareSign up for freeto 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.
Uh oh!
There was an error while loading.Please reload this page.
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.