Task: Implement a Data Structure with O(1) Random Access and Worst-Case O(1) Append
Task: Implement a Data Structure with O(1) Random Access and Worst-Case O(1) Append: a task in Terminal-Lego-15k (Harbor dataset). Implement a data structure that supports: - O(1) random access (indexing by position) - Worst-case O(1) append (not amortized — every single append must be O(1)) -…
The task
Implement a data structure that supports: - **O(1) random access** (indexing by position) - **Worst-case O(1) append** (not amortized — every single append must be O(1)) - **Iteration** over all elements in insertion order
Part of PrimeIntellect/Terminal-Lego-15k.