Algorithm · ByteDance · Hard
Requirements This assessment contains four independent programming tasks. Each one is intended to fit into roughly 15–20 minutes within a 70-minute session. Q1 — Aligned Memory Allocator Model memory as a binary array, where 0 means available and 1 means occupied. Every allocation must begin at an index divisible by 8. Create an allocator with the following construction form: Support these operations: alloc x: locate the earliest valid starting index with at least x…
Checking your access…