import heapq class Solution: def minmumNumberOfHost(self , n: int, startEnd: List[List[int]]) -> int: startEnd.sort() heap = [] ans = 1 for l, r in startEnd: if heap and heap[0] <= l: heapq.heappop(heap) heapq.heappush...