Build Max Heap Problem

Build Max Heap Problem — ExecCode Easy DSA Practice

Solve the Build Max Heap problem on ExecCode. Free online easy DSA practice in Heap. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given the input needed to solve Build Max Heap. Your task is to compute the required answer and return max-heap in array form, space-separated. A sequence of values is given, and order matters. In Build Max Heap, the goal is to transform, count, or select values according to the exact rule. nums: line 1 = n; line 2 = n integers.

Examples

Input {"nums": [5, 1, 4, 2, 8]}; Output 8 5 4 2 1. Input {"nums": [3, 1, 2]}; Output 3 1 2. Input {"nums": [4, 1, 3, 2]}; Output 4 2 3 1

Constraints

1 <= len(nums) <= 10^3

Practice Build Max Heap free on ExecCode. Browse DSA problems, topic map, and placement guides.