Hand in

  Parking simulator

Sign in to test your solution.
import heapq class PriorityQueue: def __init__(self): self.content = [] def add(self, item): heapq.heappush(self.content, item) def peek(self): return self.content[0] def poll(self): return heapq.heappop(self.content) if len(self.content) > 0 else None def is_empty(self): return len(self.content) == 0 def __str__(self): return str(heapq.nsmallest(len(self.content), self.content)) def simuleer_parking(plaatsen, bloktijd, klanten): pass
You can submit as many times as you like. Only your latest submission will be taken into account.
Sign in to test your solution.

  Python sandbox

This window allows you to run Python code without installing a thing. The code you write here is not automatically submitted to Dodona. This feature is still in full development, so we're happy to hear about your suggestions and issues using the contact form.