Stack vs Heap Memory | Dataford Interview Questions

Explain the difference between stack and heap memory.

Implement a small memory simulator that models stack values with last-in, first-out behavior and heap values with independently controlled lifetimes. Given valid operations, return the remaining stack values and currently allocated heap values in allocation order.

Function signature: simulate_memory(operations) Each operation is an array such as ["stack_push", id], ["stack_pop"], ["heap_alloc", id], or ["heap_free", id]. Return a dictionary with stack and heap arrays.

Constraints

1 <= operations.length <= 10^4
Each operation is one of ["stack_push", id], ["stack_pop"], ["heap_alloc", id], or ["heap_free", id]
Stack pop operations are only applied when the stack is non-empty
Heap free operations reference an active allocation
Allocation identifiers are non-empty strings

Function Signature

def simulate_memory(operations):

Your question is Stack vs Heap Memory. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Explain the difference between stack and heap memory.

Constraints

1 <= operations.length <= 10^4
Each operation is one of ["stack_push", id], ["stack_pop"], ["heap_alloc", id], or ["heap_free", id]
Stack pop operations are only applied when the stack is non-empty
Heap free operations reference an active allocation
Allocation identifiers are non-empty strings

Function Signature

def simulate_memory(operations):

Your question is Stack vs Heap Memory. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.