← Search

Micro-Drill #70 — Heapify a list

Search Target: 5s

heapify converts a list to a heap in O(n). Faster than n individual pushes.

import heapq
heapq.heapify(a)

Type it from memory. Go.

Practice Problems

• 215. Kth Largest Element in an Array
• 347. Top K Frequent Elements

Related Coding Drills

• Drill #11 — Reverse a linked list Easy
• Drill #58 — Heapify an array Easy