Implement append_int so a heap-backed buffer grows geometrically, checks multiplication overflow, and leaves the original allocation untouched if realloc fails.
append 4 valuessize 4Write down the input contract and the failure cases before coding.
Use your C runtime locally, then compare with solution.c.
A temporary pointer is essential: assigning realloc directly would lose the original allocation on failure. Geometric growth keeps append amortized O(1), while overflow checks ensure the byte count passed to realloc is representable. The caller remains responsible for free(buffer.data).
your-solution.c.solution.c only after a real attempt.This intermediate C exercise focuses on realloc ownership, Capacity invariants, Overflow-aware allocation. Its requirements define the exact behavior to implement before you write code.
Start with the displayed example input and expected output, then test a boundary case suggested by the requirements. Write and compile the starter in your local C environment, exercise the example and edge cases, then compare your approach with solution.c.
Attempt Grow a dynamic integer buffer first. Then open the read-only solution file to compare the contract, edge-case handling, and implementation choices—not simply to copy the final code.