---
title: "Discussion on \"Solving Merge k Sorted Lists\" | Hashnode"
description: "Discussion on \"Solving Merge k Sorted Lists\". To see the question, click here.\nNaive Approach\nThe idea is to store all the values of the list nodes in an array, sort them using the Arrays.sort method, and then construct the linked list to return it as the answer.\n// TC: O(nlogn)\n// SC: O(n)\n\nimp..."
url: "https://hashnode.com/posts/solving-merge-k-sorted-lists/669121ce83cea100418ff4b6"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Solving Merge k Sorted Lists](https://vineethchivukula.hashnode.dev/solving-merge-k-sorted-lists?utm_source=hashnode&utm_medium=feed)

To see the question, click here. Naive Approach The idea is to store all the values of the list nodes in an array, sort them using the Arrays.sort method, and then construct the linked list to return it as the answer. // TC: O(nlogn) // SC: O(n) imp...

Jul 12, 2024 · 6 min read · vineethchivukula.hashnode.dev  
Read the article

-   [#merge-k](https://hashnode.com/tag/merge-k)
-   [#merge](https://hashnode.com/tag/merge)
-   [#heap](https://hashnode.com/tag/heap)

## Written by

[Vineeth Chivukula](https://hashnode.com/@vineethchivukula)

@vineethchivukula · Andhra Pradesh, India

  
[View profile](https://hashnode.com/@vineethchivukula)

Developer && Video editor

There's this guy who's mad about editing and programming. It's his jam, you know?

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
