Simple Java Solution || O(n, k)
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\n/**\n * Definition for singly-linked list.\n * public class ListNode {\n *     int val;\n *     ListNode next;\n *     ListNode() {}\n *     ListNode(int val) { this.val = val; }\n *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }\n * }\n */\nclass Solution {\n    public ListNode[] splitListToParts(ListNode head, int k) {\n        int linkedListLength = 0;\n        ListNode temp = head;\n        while(temp != null) {\n            linkedListLength++;\n            temp = temp.next;\n        }\n        int partLength = linkedListLength / k;\n        int extraNodes = linkedListLength % k;\n        ListNode[] arr = new ListNode[k];\n        temp = head;\n        ListNode prev = null;\n        for(int i = 0; i < arr.length && temp != null; i++, extraNodes--) {\n            arr[i] = temp;\n            for(int j = 0; j < partLength + (extraNodes > 0 ? 1 : 0) && temp != null; j++) {\n                prev = temp;\n                temp = temp.next;\n            }\n            prev.next = null;\n        }\n        return arr;\n    }\n}\n```
['Linked List', 'Java']