def is_palindrome(s): return s == s[::-1]
return count
Example: Input - [-2, 1, -3, 4, -1, 2, 1, -5, 4], Output - 6 Tcs Coding Questions 2021
while fast and fast.next: slow = slow.next fast = fast.next.next
Example: Input - [1, 2, 3, 4, 5], target sum - 7, Output - 2 def is_palindrome(s): return s == s[::-1] return count
for num in arr: complement = target_sum - num if complement in seen: count += 1 seen.add(num)
# 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) target sum - 7
Given a string, find the first non-repeating character in it.
print(first_non_repeating_char("aabbc")) # Output: "c"