HF RL Explorer

Implement a shift‑to‑middle array

Implement a shift‑to‑middle array: a task in LegoFlow-SWE (Harbor dataset). We need a new generic, resizable double‑ended container (deque) that supports amortized O(1) insertion and removal at both ends. The container must be called ShiftToMiddleArray and operates on user‑provided element sizes…

The task

We need a new generic, resizable double‑ended container (deque) that supports amortized O(1) insertion and removal at both ends. The container must be called `ShiftToMiddleArray` and operates on user‑provided element sizes (stored by value, not by pointer).

Part of Lego-X/LegoFlow-SWE.