Please show how to modify solution so that if a group does not fit within k, it does not get modified. Similar to leetcode 25.

Would also like to know

temp = current should_end = False for i in range(k): if not temp: should_end = True break temp = temp.next if should_end == True: break

I added this piece of check just before we do the reverse sublist and the answer is accepted for leetcode 25

might not be the most efficient way, but you can first check that a reversal can be completed or not.

java solution, add this for loop before the reversing for loop

ListNode temp = curr; for(int i = 0; i < k; i++){ if(temp == null){ return head; } else{ temp = temp.ne...