From the course: Python Data Structures and Algorithms
Challenge: Heapq methods practice - Python Tutorial
From the course: Python Data Structures and Algorithms
Challenge: Heapq methods practice
(upbeat music) - [Narrator] Here's a quick challenge based on the priority queue that we just wrote in Python. So using that priority queue that we just wrote, what will be the output of the following code? This challenge should take approximately one minute. It's just a quick exercise thinking about what we just learned.
Practice while you learn with exercise files
Download the files the instructor uses to teach the course. Follow along and learn by watching, listening and practicing.