for num in arr: complement = target_sum - num if complement in seen: count += 1 seen.add(num)
print(find_middle_element(head)) # Output: 3
Example: Input - [1, 2, 3, 4, 5], target sum - 7, Output - 2
Example: Input - "aabbc", Output - "c"
Given a string, check if it's a palindrome or not.
Example: Input - "madam", Output - True
print(max_subarray_sum([-2, 1, -3, 4, -1, 2, 1, -5, 4])) # Output: 6
