• + 0 comments
    def serviceLane(n, cases):
        # Write your code here
        result = []
        for i in range(len(cases)):
            width_max = min(width[cases[i][0]:cases[i][1]+1])
            result.append(width_max)
        return result