w3resource

Python Exercise: Find the three largest integers from a given list of numbers using Heap queue algorithm

Python heap queue algorithm: Exercise-1 with Solution

Write a Python program to find the three largest integers from a given list of numbers using Heap queue algorithm.

Sample Solution:

Python Code:

import heapq as hq
nums_list = [25, 35, 22, 85, 14, 65, 75, 22, 58]
print("Original list:")
print(nums_list)
# Find three largest values
largest_nums = hq.nlargest(3, nums_list)
print("\nThree largest numbers are:", largest_nums)

Sample Output:

Original list:
[25, 35, 22, 85, 14, 65, 75, 22, 58]

Three largest numbers are: [85, 75, 65]

Flowchart:

Python heap queue algorithm: Find the three largest integers from a given list of numbers using Heap queue algorithm.

Visualize Python code execution:

The following tool visualize what the computer is doing step-by-step as it executes the said program:


Python Code Editor:

Have another way to solve this solution? Contribute your code (and comments) through Disqus.

Previous: Python heap queue algorithm Exercise Home.
Next: Write a Python program to find the three smallest integers from a given list of numbers using Heap queue algorithm.

What is the difficulty level of this exercise?

Test your Python skills with w3resource's quiz

Python: Tips of the Day

Returns every nth element in a list

Example:

def tips_every_nth(lst, nth):
  return lst[nth - 1::nth]

print(tips_every_nth([1, 2, 3, 4, 5, 6, 7, 8, 9], 3))]

Output:

[3, 6, 9]