def find_middle_element(head): slow = head fast = head
Example: Input - 1 -> 2 -> 3 -> 4 -> 5, Output - 3
Given an array of integers, find the maximum sum of a subarray.
def count_pairs_with_sum(arr, target_sum): count = 0 seen = set() Tcs Coding Questions 2021
for num in arr: current_sum = max(num, current_sum + num) max_sum = max(max_sum, current_sum)
Example: Input - [1, 2, 3, 4, 5], target sum - 7, Output - 2
# 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 find_middle_element(head): slow = head fast = head
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
while fast and fast.next: slow = slow.next fast = fast.next.next
def max_subarray_sum(arr): max_sum = float('-inf') current_sum = 0 current_sum + num) max_sum = max(max_sum
Example: Input - "madam", Output - True
class Node: def __init__(self, data): self.data = data self.next = None
print(count_pairs_with_sum([1, 2, 3, 4, 5], 7)) # Output: 2
for char in s: if char_count[char] == 1: return char
print(is_palindrome("madam")) # Output: True