{"type":"rich","version":"1.0","provider_name":"Transistor","provider_url":"https://transistor.fm","author_name":"Programming Tech Brief By HackerNoon","title":"Java Algorithms: Merge k Sorted Lists (LeetCode)","html":"<iframe width=\"100%\" height=\"180\" frameborder=\"no\" scrolling=\"no\" seamless src=\"https://share.transistor.fm/e/5e361d97\"></iframe>","width":"100%","height":180,"duration":239,"description":"\n        This story was originally published on HackerNoon at: https://hackernoon.com/java-algorithms-merge-k-sorted-lists-leetcode.\nAn easy approach to the hard leetcode problem Merge k Sorted Lists from that many people using Java Algorithms will need to learn in order to be effective.\nCheck more stories related to programming at: https://hackernoon.com/c/programming.\n            You can also check exclusive content about #data-structures, #linked-lists, #interview-questions, #how-to-code, #leetcode, #coding, #java, #algorithms, #hackernoon-es,  and more.\nThis story was written by: @rakhmedovrs. Learn more about this writer by checking @rakhmedovrs's about page,\n            and for more stories, please visit hackernoon.com.\nask description:\n\nYou are given an array of k linked-lists lists, each linked-list is sorted in ascending order.\n\nMerge all the linked-lists into one sorted linked-list and return it.\n\nExample 1:\n\nInput: lists = [[1,4,5],[1,3,4],[2,6]]\nOutput: [1,1,2,3,4,4,5,6]\nExplanation: The linked-lists are:\n[\n  1->4->5,\n  1->3->4,\n  2->6\n]\nmerging them into one sorted list:\n1->1->2->3->4->4->5->6","thumbnail_url":"https://img.transistorcdn.com/KhCapPSRkLGL2Xw8888yuChkNRWthaKapLYTvNdu4W4/rs:fill:0:0:1/w:400/h:400/q:60/mb:500000/aHR0cHM6Ly9pbWct/dXBsb2FkLXByb2R1/Y3Rpb24udHJhbnNp/c3Rvci5mbS9zaG93/LzQxMTY2LzE2ODM1/ODIzMzAtYXJ0d29y/ay5qcGc.webp","thumbnail_width":300,"thumbnail_height":300}