Given a linked list, find the middle element.

Example: Input - "aabbc", Output - "c"

Given a string, check if it's a palindrome or not.

# 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)

def is_palindrome(s): return s == s[::-1]

Here are some TCS coding questions from 2021, along with a useful piece of code for each:

print(is_palindrome("madam")) # Output: True

return slow.data

for num in arr: complement = target_sum - num if complement in seen: count += 1 seen.add(num)

print(find_middle_element(head)) # Output: 3

return count

for num in arr: current_sum = max(num, current_sum + num) max_sum = max(max_sum, current_sum)

def max_subarray_sum(arr): max_sum = float('-inf') current_sum = 0