Title: To Add Merge Two Linked Lists Algorithm

[Armunshi]

Initiative (Required)

Hacktoberfest 2024 🎃

Is your feature request related to a problem? Please describe.

I will be providing an efficient Algorithm that merges two Sorted Linked lists in O(m+n) time where m and n are the lengths of each of the lists respectively

Describe the solution you'd like.

The Algorithm Works by using pointers over both linked lists and connecting their link based on which node is lesser than the other for example if the pointer on the node in the second lists points to a value less than that of the pointer on the first node then the pointer on the first node will point to the second node and thus by changing the links we achieve an efficient solution

Add any other context or screenshots about the feature request here.

No response

[github-actions]

@Armunshi

It's great having you contribute to this project

Thanks for opening this Issue 🙌 , Welcome to SkillShow 💖 We will review everything and get back to you.
Make sure to give a star to this repo before making a fork! Thank you :)

[github-actions]

Thanks for your contribution! 😊 However, it appears that a similar issue has already been reported. Please open a new issue that isn’t already listed, or review the open issues. If you see that someone hasn’t been active, you might consider commenting on that issue. 📋

[Armunshi]

could you please assign me this as this is one of my first contributions

[github-actions]

Hi @Armunshi 👋, your issue #79 has been successfully closed ✅. Thank you for your valuable contribution! 🙌