HF RL Explorer

Efficient Queue Implementation in Haskell

Efficient Queue Implementation in Haskell: a task in Terminal-Lego-15k (Harbor dataset). Implement an efficient double-ended queue (deque) data structure in Haskell that allows O(1) amortized access to both the front and back of the queue without expensive reverse operations on every access.

The task

Implement an efficient double-ended queue (deque) data structure in Haskell that allows O(1) amortized access to both the front and back of the queue without expensive `reverse` operations on every access.

Part of PrimeIntellect/Terminal-Lego-15k.