HF RL Explorer

Task: Implement an Immutable Queue in Clojure

Task: Implement an Immutable Queue in Clojure: a task in Terminal-Lego-15k (Harbor dataset). Implement a persistent (immutable) queue data structure in Clojure that provides efficient enqueue and dequeue operations. The implementation should leverage Clojure's built-in persistent data structures…

The task

Implement a persistent (immutable) queue data structure in Clojure that provides efficient `enqueue` and `dequeue` operations. The implementation should leverage Clojure's built-in persistent data structures to achieve amortized O(1) or O(log n) performance for both operations.

Part of PrimeIntellect/Terminal-Lego-15k.