| Title | Topics | Action | |||
|---|---|---|---|---|---|
| 481 | Print a Heap in Array OrderComplete `heap_print`. It prints the heap on one line in array order, from index... | easy | ○ Not Started | Data Structures & AlgorithmsHeaps | Solve |
| 482 | Find a Heap Node's Parent and ChildrenComplete the three index helpers `get_parent_index`, `get_left_child_index` and ... | easy | ○ Not Started | Data Structures & AlgorithmsHeaps | Solve |
| 483 | Check Whether a Heap Node Has ChildrenComplete `has_left_child` and `has_right_child`. Each one takes the heap and an ... | easy | ○ Not Started | Data Structures & AlgorithmsHeaps | Solve |
| 484 | Swap Two Slots in the Heap ArrayComplete `swap(MinHeap *heap, int i, int j)`. It trades the values stored at ind... | easy | ○ Not Started | Data Structures & AlgorithmsHeaps | Solve |
| 485 | Check Whether a Heap Is Empty or FullComplete `heap_is_empty` and `heap_is_full`. Each one looks at the heap and retu... | easy | ○ Not Started | Data Structures & AlgorithmsHeaps | Solve |
| 486 | Peek at the Smallest ValueComplete `heap_peek(const MinHeap *heap, int *out)`. It copies the smallest valu... | easy | ○ Not Started | Data Structures & AlgorithmsHeaps | Solve |
| 487 | Search a Heap for a ValueComplete `heap_contains(const MinHeap *heap, int value)`. It returns 1 when `val... | easy | ○ Not Started | Data Structures & AlgorithmsHeaps | Solve |
| 488 | Check Whether an Array Is a Min HeapComplete `is_min_heap`. It reads a plain array of `count` values as a tree and r... | easy | ○ Not Started | Data Structures & AlgorithmsHeaps | Solve |
| 489 | Bubble a New Value Up With heapify_upComplete `heapify_up`. It takes the index of a value that may be smaller than it... | easy | ○ Not Started | Data Structures & AlgorithmsHeaps | Solve |
| 490 | Insert a Value Into a Min HeapComplete `heap_insert`. It adds one value to the heap and returns 1, or returns ... | easy | ○ Not Started | Data Structures & AlgorithmsHeaps | Solve |
| 491 | Pick the Smaller ChildComplete `get_smaller_child_index`. Given an index i, it returns the index of th... | easy | ○ Not Started | Data Structures & AlgorithmsHeaps | Solve |
| 492 | Sink a Value Down With heapify_downComplete `heapify_down`. It takes the index of a value that may be bigger than o... | easy | ○ Not Started | Data Structures & AlgorithmsHeaps | Solve |
| 493 | Remove the Smallest Value From a Min HeapComplete `heap_remove`. It takes the smallest value out of the heap, stores it i... | easy | ○ Not Started | Data Structures & AlgorithmsHeaps | Solve |
| 494 | Build a Min Heap From an Unsorted ArrayComplete `build_heap`. It copies `count` values, in any order, into the heap and... | easy | ○ Not Started | Data Structures & AlgorithmsHeaps | Solve |
| 495 | Print the Path From a Node Up to the RootComplete `print_path_to_root(heap, i)`. It prints the value at index i, then its... | medium | ○ Not Started | Data Structures & AlgorithmsHeaps | Solve |
| 496 | Find the Second Smallest Value Without Removing AnythingComplete `heap_peek_second(heap, out)`. It puts the second smallest value of the... | medium | ○ Not Started | Data Structures & AlgorithmsHeaps | Solve |
| 497 | Print a Heap One Row at a TimeComplete `heap_print_rows(heap)`. It prints the heap the way you would draw it, ... | medium | ○ Not Started | Data Structures & AlgorithmsHeaps | Solve |
| 498 | Find Where an Array Breaks the Heap RuleComplete `find_heap_violation(values, count)`. It checks an array of `count` val... | medium | ○ Not Started | Data Structures & AlgorithmsHeaps | Solve |
| 499 | Insert a Value and Report Where It LandsComplete `heap_insert_at(heap, value)`. It inserts `value` into the min heap and... | medium | ○ Not Started | Data Structures & AlgorithmsHeaps | Solve |
| 500 | Change a Value Inside the HeapComplete `heap_change_value(heap, i, new_value)`. It overwrites the value at ind... | medium | ○ Not Started | Data Structures & AlgorithmsHeaps | Solve |
| 501 | Write heapify_down From ScratchComplete `heapify_down(MinHeap *heap, int i)`. The value at index i may be bigge... | medium | ○ Not Started | Data Structures & AlgorithmsHeaps | Solve |
| 502 | Replace the Smallest Value in One StepComplete `heap_replace_min(MinHeap *heap, int value, int *old_min)`. It takes th... | medium | ○ Not Started | Data Structures & AlgorithmsHeaps | Solve |
| 503 | Delete the Value at Any IndexComplete `heap_delete_at(MinHeap *heap, int i, int *removed)`. It deletes the va... | medium | ○ Not Started | Data Structures & AlgorithmsHeaps | Solve |
| 504 | Sort an Array With a Min HeapComplete `heap_sort(int values[], int count)`. It sorts the first `count` values... | medium | ○ Not Started | Data Structures & AlgorithmsHeaps | Solve |
| 505 | Print Every Value Smaller Than a LimitComplete `print_smaller_than(const MinHeap *heap, int i, int limit)`. It prints ... | medium | ○ Not Started | Data Structures & AlgorithmsHeaps | Solve |