How should I practice Insert into a Min-Heap?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Goldman Sachs onsite interview problems in FastPrep.

Is Insert into a Min-Heap associated with Goldman Sachs?

FastPrep tags this as a Goldman Sachs onsite interview coding practice problem when the problem catalog has that company and stage context.

Problem · Array

Insert into a Min-Heap

Learn this problem

● Easy

Goldman SachsFULLTIMEONSITE INTERVIEW

Problem statement

Given an array heap that represents a valid binary min-heap in level order and an integer value, insert value and return the resulting level-order array.

Append the value at the end, then repeatedly swap it with its parent while it is strictly smaller than that parent. Equal values do not swap.

Function

insertIntoMinHeap(heap: int[], value: int) → int[]

Examples

Example 1

heap = [1,3,6,5,9,8]value = 2return = [1,3,2,5,9,8,6]

After appending 2, swap it with its parent 6. Its new parent is 1, so the process stops.

Example 2

heap = []value = 4return = [4]

The inserted value becomes the root of the previously empty heap.

Example 3

heap = [1,2,2,7]value = 2return = [1,2,2,7,2]

The appended value equals its parent, so no swap occurs.

Constraints

0 <= heap.length <= 200000.
heap is a valid binary min-heap.
Every stored value and value is a 32-bit signed integer.