Skip to content
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 our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add "MergeTwo Sorted Linked lists" Problem #92

Open
Amit-yadav099 opened this issue Oct 13, 2024 · 2 comments
Open

Add "MergeTwo Sorted Linked lists" Problem #92

Amit-yadav099 opened this issue Oct 13, 2024 · 2 comments

Comments

@Amit-yadav099
Copy link

There are given two sorted linked lists consisting of nodes respectively.The task is to merge both lists and return the head of the merged list.
note that : the new linked list must be sorted too.
example test case:-
input:- List1: 5->10->15->40, List2: 2->3->20
Output: 2->3->5->10->15->20->40

@jayg2309
Copy link

Please assign this to me @Amit-yadav099 @dubey-harshit

@maneshri00
Copy link

I am interested in this issue please assign me.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

3 participants