def count_pairs_with_sum(arr, target_sum): count = 0 seen = set()

class Node: def __init__(self, data): self.data = data self.next = None

return max_sum

Given a linked list, find the middle element.

for char in s: if char_count[char] == 1: return char