def test_remove_dupes_set(test_input, expected):
lst = generate_list(test_input)
remove_dupes_no_temp(lst)
for i, node in enumerate(lst):
assert (expected[i] == node.val)
def test_remove_dupes_pythonic(test_input, expected):
lst = generate_list(test_input)
lst = remove_dupes_pythonic(lst)
for i, node in enumerate(lst):
assert (expected[i] == node.val)
def test_delete_in_middle(test_input, distance, expected):
lst = generate_list(test_input)
node = lst.get_at_index(distance)
delete_in_middle(node)
for i, node in enumerate(lst):
assert (expected[i] == node.val)
def test_partition_1(test_input, partition):
lst = generate_list(test_input)
partition_1(lst, partition)
case = 0
for node in lst:
if node.val >= partition:
case = 1
if case == 0:
assert (node.val < partition)
if case == 1:
assert (node.val >= partition)
def test_intersection(list_1, list_2, from_index, to_index, expected):
list_1 = generate_list(list_1)
list_2 = generate_list(list_2)
ret = is_palindrome(list_1)
assert (ret == expected)
def test_kth_away(test_input, distance, expected):
lst = generate_list(test_input)
kth = kth_away(lst, distance)
assert (kth is expected or kth.val == expected)