# Create a sample linked list: 1 -> 2 -> 3 -> 4 -> 5 head = Node(1) head.next = Node(2) head.next.next = Node(3) head.next.next.next = Node(4) head.next.next.next.next = Node(5)
for num in arr: complement = target_sum - num if complement in seen: count += 1 seen.add(num)
print(first_non_repeating_char("aabbc")) # Output: "c"
Example: Input - "aabbc", Output - "c"
Example: Input - 1 -> 2 -> 3 -> 4 -> 5, Output - 3
print(is_palindrome("madam")) # Output: True
def count_pairs_with_sum(arr, target_sum): count = 0 seen = set() Tcs Coding Questions 2021
Given a string, find the first non-repeating character in it.
Given a string, check if it's a palindrome or not.
Example: Input - [1, 2, 3, 4, 5], target sum - 7, Output - 2 # Create a sample linked list: 1 ->
print(max_subarray_sum([-2, 1, -3, 4, -1, 2, 1, -5, 4])) # Output: 6
return None
def first_non_repeating_char(s): char_count = {} for char in s: if char in char_count: char_count[char] += 1 else: char_count[char] = 1 target sum - 7