answer:from datetime import datetime, timedelta from collections import defaultdict, deque def detect_brute_force_attacks(logs, k, m): Identifies IP addresses with `k` or more failed login attempts within any `m` minute window. Args: logs (list): List of log entries as tuples (timestamp, IP, status). k (int): Number of failed attempts to consider as a brute force attack. m (int): Window of time in minutes within which the fails should be counted. Returns: list: List of IP addresses. failed_attempts = defaultdict(deque) result = set() # Convert logs into tuples and sort by timestamp log_entries = [(datetime.strptime(log[0], "%Y-%m-%d %H:%M:%S"), log[1], log[2]) for log in logs] log_entries.sort() for timestamp, ip, status in log_entries: if status == "FAIL": attempt_window = failed_attempts[ip] # Add the current attempt to the queue attempt_window.append(timestamp) # Remove attempts older than the m-minute window while attempt_window and (timestamp - attempt_window[0]).total_seconds() > m * 60: attempt_window.popleft() # Check if the number of failed attempts within the window meets or exceeds k if len(attempt_window) >= k: result.add(ip) return list(result)

answer:def is_beautiful_sequence(n, sequence): Determines if the sequence is beautiful. A sequence is considered beautiful if the difference between consecutive integers is either 1 or -1. Parameters: n (int): Number of elements in the sequence. sequence (list of int): The sequence of integers. Returns: str: "BEAUTIFUL" if the sequence is beautiful, otherwise "NOT BEAUTIFUL". for i in range(1, n): if abs(sequence[i] - sequence[i-1]) != 1: return "NOT BEAUTIFUL" return "BEAUTIFUL"

answer:def max_passengers(n, stations): Calculate the maximum number of passengers on the train at any point. Parameters: n (int): Number of stations. stations (list of tuple): List of tuples where each tuple contains two integers, passengers getting on and off the train at each station. Returns: int: The maximum number of passengers on the train at any point. current_passengers = 0 max_passengers = 0 for on, off in stations: current_passengers += on current_passengers -= off max_passengers = max(max_passengers, current_passengers) return max_passengers

answer:def search_in_circular_array(n, x, a): Determines if the integer 'x' exists in the sorted circular array 'a'. Returns the index of 'x' if it exists, or -1 if it does not. for i in range(n): if a[i] == x: return i return -1