0 out of 464 challenges solved
Write a Python function `overlapping` that checks whether any value in one sequence exists in another sequence. The function should take two sequences as input and return `True` if there is at least one common element between them, otherwise return `False`. #### Example Usage ```python [main.nopy] print(overlapping([1, 2, 3, 4, 5], [6, 7, 8, 9])) # Output: False print(overlapping([1, 2, 3], [3, 4, 5])) # Output: True print(overlapping(['a', 'b'], ['c', 'd', 'a'])) # Output: True ``` #### Requirements - The function should work for sequences of any type (e.g., lists, tuples). - The function should return a boolean value. - Avoid using built-in set operations for this challenge.
def overlapping(seq1, seq2): """ Check if any value in seq1 exists in seq2. Args: seq1: The first sequence. seq2: The second sequence. Returns: bool: True if any value in seq1 exists in seq2, otherwise False. """ # Implement the logic to check for overlapping elements pass