← Walmart questions

Implement build-heap and analyze its time complexity

Filed under Walmart

Write code to build a binary max-heap from an unsorted array of numbers in-place, and explain the O(n) time complexity of the operation.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Walmart questions

Collected from public candidate posts and coding forums. Updated Nov 2026.