return count

print(max_subarray_sum([-2, 1, -3, 4, -1, 2, 1, -5, 4])) # Output: 6

Given a string, find the first non-repeating character in it.

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

class Node: def __init__(self, data): self.data = data self.next = None