def solution_1(l_1, l_2): digit_1 = l_1.head.next digit_2 = l_2.head.next answer_l = LinkedList() ten = False while digit_1.next != None: val = digit_1.data + digit_2.data if ten == True: val += 1 ten = False if val >= 10: temp = str(val) val = int(temp[1]) ten = True answer_l.add_node_tail(val) digit_1 = digit_1.next digit_2 = digit_2.next return answer_l
def solution(l_l, x): node = l_l.head.next before = LinkedList() after = LinkedList() while node.next != None: if node.data < 5: before.add_node_tail(node.data) else: after.add_node_tail(node.data) node = node.next return before, after