LeetCode 725: Split Linked List in Parts Solution

Master LeetCode problem 725 (Split Linked List in Parts), a medium challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

725. Split Linked List in Parts

Medium

Linked List

Problem Explanation

Explanation

To split the linked list into k consecutive linked list parts, we first need to find the length of the linked list. Then, we calculate the size of each part as length of list / k. We distribute the remaining nodes (if any) to the first few parts. Finally, we iterate through the list to create the parts.

Time Complexity: O(n) where n is the number of nodes in the linked list.
Space Complexity: O(k) where k is the number of parts.

Solution Code

class Solution {
    public ListNode[] splitListToParts(ListNode head, int k) {
        ListNode[] parts = new ListNode[k];
        int length = 0;
        ListNode current = head;

        while (current != null) {
            length++;
            current = current.next;
        }

        int partSize = length / k;
        int extraNodes = length % k;

        current = head;
        for (int i = 0; i < k && current != null; i++) {
            parts[i] = current;
            int partLength = partSize + (extraNodes-- > 0 ? 1 : 0);

            for (int j = 1; j < partLength; j++) {
                current = current.next;
            }

            ListNode next = current.next;
            current.next = null;
            current = next;
        }

        return parts;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 725 (Split Linked List in Parts)?

This page provides optimized solutions for LeetCode problem 725 (Split Linked List in Parts) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 725 (Split Linked List in Parts)?

The time complexity for LeetCode 725 (Split Linked List in Parts) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 725 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 725 in Java, C++, or Python.

Back to LeetCode Solutions