We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Service Lane
  5. Discussions

Service Lane

  • BoredProgrammer
     + 0 comments
    def serviceLane(n, cases):
    l=[]
    for i in cases:
        l.append(min(width[i[0]:i[1]+1]))
    return l