[NEW ALGORITHM] Merge k sorted lists

[Dipanita45]

Issue will be closed if:

1. You mention more than one algorithm. You can create a separate issue for each algorithm once the current one is completed.
2. You propose an algorithm that is already present or has been mentioned in a previous issue.
3. You create a new issue without completing your previous issue.

Note: These actions will be taken seriously. Failure to follow the guidelines may result in the immediate closure of your issue.

---

Name:

[NEW ALGORITHM] Merge k sorted lists

About:

You are given an array of k linked-lists lists, each linked-list is sorted in ascending order.

Merge all the linked-lists into one sorted linked-list and return it.

---

Labels:

new algorithm, gssoc-ext, hacktoberfest, level1

---

Assignees:

• [yes] Contributor in GSSoC-ext
• [yes] Want to work on it

Please assign me this issue
@pankaj-bind

[Aachallll]

please assign me this
@pankaj-bind

[Dipanita45]

Please assign me this issue @pankaj-bind

…

On Sun, 10 Nov 2024, 6:07 pm Aachal18, ***@***.***> wrote: please assign me this @pankaj-bind <https://github.com/pankaj-bind> — Reply to this email directly, view it on GitHub <#1857 (comment)>, or unsubscribe <https://github.com/notifications/unsubscribe-auth/A7SRZ6GJ7SPHT5WONFCUYCDZ75HSNAVCNFSM6AAAAABRQDS27WVHI2DSMVQWIX3LMV43OSLTON2WKQ3PNVWWK3TUHMZDINRWG4YTQOJRHE> . You are receiving this because you were mentioned.Message ID: ***@***.***>

[pankaj-bind]

Raise your PR before 11:30PM otherwise, it will not be considered in GSSOC-ext.