Sort List LeetCode Programming Solutions | LeetCode Problem Solutions in C++, Java, & Python [💯Correct]

LeetCode Problem | LeetCode Problems For Beginners | LeetCode Problems & Solutions | Improve Problem Solving Skills | LeetCode Problems Java | LeetCode Solutions in C++

Hello Programmers/Coders, Today we are going to share solutions to the Programming problems of LeetCode Solutions in C++, Java, & Python. At Each Problem with Successful submission with all Test Cases Passed, you will get a score or marks and LeetCode Coins. And after solving maximum problems, you will be getting stars. This will highlight your profile to the recruiters.

In this post, you will find the solution for the Sort List in C++, Java & Python-LeetCode problem. We are providing the correct and tested solutions to coding problems present on LeetCode. If you are not able to solve any problem, then you can take help from our Blog/website.

Use “Ctrl+F” To Find Any Questions Answer. & For Mobile User, You Just Need To Click On Three dots In Your Browser & You Will Get A “Find” Option There. Use These Option to Get Any Random Questions Answer.

About LeetCode

LeetCode is one of the most well-known online judge platforms to help you enhance your skills, expand your knowledge and prepare for technical interviews. 

LeetCode is for software engineers who are looking to practice technical questions and advance their skills. Mastering the questions in each level on LeetCode is a good way to prepare for technical interviews and keep your skills sharp. They also have a repository of solutions with the reasoning behind each step.

LeetCode has over 1,900 questions for you to practice, covering many different programming concepts. Every coding problem has a classification of either EasyMedium, or Hard.

LeetCode problems focus on algorithms and data structures. Here is some topic you can find problems on LeetCode:

  • Mathematics/Basic Logical Based Questions
  • Arrays
  • Strings
  • Hash Table
  • Dynamic Programming
  • Stack & Queue
  • Trees & Graphs
  • Greedy Algorithms
  • Breadth-First Search
  • Depth-First Search
  • Sorting & Searching
  • BST (Binary Search Tree)
  • Database
  • Linked List
  • Recursion, etc.

Leetcode has a huge number of test cases and questions from interviews too like Google, Amazon, Microsoft, Facebook, Adobe, Oracle, Linkedin, Goldman Sachs, etc. LeetCode helps you in getting a job in Top MNCs. To crack FAANG Companies, LeetCode problems can help you in building your logic.

Link for the ProblemSort List– LeetCode Problem

Sort List– LeetCode Problem


Given the head of a linked list, return the list after sorting it in ascending order.

Example 1:

sort list 1
Input: head = [4,2,1,3]
Output: [1,2,3,4]

Example 2:

sort list 2
Input: head = [-1,5,3,4,0]
Output: [-1,0,3,4,5]

Example 3:

Input: head = []
Output: []


  • The number of nodes in the list is in the range [0, 5 * 104].
  • -105 <= Node.val <= 105
Sort List– LeetCode Solutions
Sort List Solution in C++:
class Solution {
  ListNode* sortList(ListNode* head) {
    const int length = getLength(head);
    ListNode dummy(0, head);

    for (int k = 1; k < length; k *= 2) {
      ListNode* curr =;
      ListNode* tail = &dummy;
      while (curr) {
        ListNode* l = curr;
        ListNode* r = split(l, k);
        curr = split(r, k);
        auto [mergedHead, mergedTail] = merge(l, r);
        tail->next = mergedHead;
        tail = mergedTail;


  int getLength(ListNode* head) {
    int length = 0;
    for (ListNode* curr = head; curr; curr = curr->next)
    return length;

  ListNode* split(ListNode* head, int k) {
    while (--k && head)
      head = head->next;
    ListNode* rest = head ? head->next : nullptr;
    if (head)
      head->next = nullptr;
    return rest;

  pair<ListNode*, ListNode*> merge(ListNode* l1, ListNode* l2) {
    ListNode dummy(0);
    ListNode* tail = &dummy;

    while (l1 && l2) {
      if (l1->val > l2->val)
        swap(l1, l2);
      tail->next = l1;
      l1 = l1->next;
      tail = tail->next;
    tail->next = l1 ? l1 : l2;
    while (tail->next)
      tail = tail->next;

    return {, tail};
Sort List Solution in Java:
class Solution {
  public ListNode sortList(ListNode head) {
    final int length = getLength(head);
    ListNode dummy = new ListNode(0, head);

    for (int k = 1; k < length; k *= 2) {
      ListNode curr =;
      ListNode tail = dummy;
      while (curr != null) {
        ListNode l = curr;
        ListNode r = split(l, k);
        curr = split(r, k);
        ListNode[] merged = merge(l, r); = merged[0];
        tail = merged[1];


  private int getLength(ListNode head) {
    int length = 0;
    for (ListNode curr = head; curr != null; curr =
    return length;

  private ListNode split(ListNode head, int k) {
    while (--k > 0 && head != null)
      head =;
    ListNode rest = head == null ? null :;
    if (head != null) = null;
    return rest;

  private ListNode[] merge(ListNode l1, ListNode l2) {
    ListNode dummy = new ListNode(0);
    ListNode tail = dummy;

    while (l1 != null && l2 != null) {
      if (l1.val > l2.val) {
        ListNode temp = l1;
        l1 = l2;
        l2 = temp;
      } = l1;
      l1 =;
      tail =;
    } = l1 == null ? l2 : l1;
    while ( != null)
      tail =;

    return new ListNode[] {, tail};
Sort List Solution in Python:
class Solution:
  def sortList(self, head: ListNode) -> ListNode:
    def split(head: ListNode, k: int) -> ListNode:
      while k > 1 and head:
        head =
        k -= 1
      rest = if head else None
      if head: = None
      return rest

    def merge(l1: ListNode, l2: ListNode) -> tuple:
      dummy = ListNode(0)
      tail = dummy

      while l1 and l2:
        if l1.val > l2.val:
          l1, l2 = l2, l1 = l1
        l1 =
        tail = = l1 if l1 else l2
        tail =

      return, tail

    length = 0
    curr = head
    while curr:
      length += 1
      curr =

    dummy = ListNode(0, head)

    k = 1
    while k < length:
      curr =
      tail = dummy
      while curr:
        l = curr
        r = split(l, k)
        curr = split(r, k)
        mergedHead, mergedTail = merge(l, r) = mergedHead
        tail = mergedTail
      k *= 2


37 thoughts on “Sort List LeetCode Programming Solutions | LeetCode Problem Solutions in C++, Java, & Python [💯Correct]”

  1. Awesome things here. I am very happy to look your article.Thanks so much and I’m taking a look forward to contact you.Will you kindly drop me a e-mail?matthyfamily.comMy favorite quote – “Vietnamese girls can be like Thai girls”Have you ever thought about adding a little bit more than just your articles?I mean, what you say is important and all. However just imagine if you added some great picturesor videos to give your posts more, “pop”! Your content is excellent but with images and clips,this blog could definitely be one of the most beneficial in its niche.Terrific blog!I do not know whether it’s just me or if everybody else encountering problems with yourwebsite. It appears as though some of the text within your posts are runningoff the screen. Can somebody else please provide feedback and let me knowif this is happening to them as well? This couldbe a problem with my web browser because I’ve had this happen before.Appreciate itEverything is very open with a precise explanation ofthe issues. It was definitely informative. Your site is very useful.Many thanks for sharing!


Leave a Comment

Ads Blocker Image Powered by Code Help Pro

Ads Blocker Detected!!!

We have detected that you are using extensions to block ads. Please support us by disabling these ads blocker🙏.

Powered By
Best Wordpress Adblock Detecting Plugin | CHP Adblock