id int64 1 2.26k | language stringclasses 7
values | category stringclasses 3
values | difficulty stringclasses 2
values | task_description stringclasses 132
values | code stringlengths 68 753 | explanation stringclasses 449
values |
|---|---|---|---|---|---|---|
1,001 | Python | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, pop, push, pop. | from collections import deque
buf = deque()
buf.append(88.91)
buf.append(39.71)
print(buf.popleft())
buf.append(99.4)
print(buf.popleft()) | Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']. |
1,002 | Python | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, pop, push, pop. | from collections import deque
q = deque()
q.append(58.37)
q.append(70.48)
print(q.popleft())
q.append(13.17)
print(q.popleft()) | Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']. |
1,003 | Python | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, pop, push, pop. | from collections import deque
container = deque()
container.append(96.85)
container.append(79.44)
print(container.popleft())
container.append(96.98)
print(container.popleft()) | Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']. |
1,004 | Python | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, pop, push, pop. | from collections import deque
coll = deque()
coll.append(15.57)
coll.append(68.41)
print(coll.popleft())
coll.append(29.69)
print(coll.popleft()) | Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']. |
1,005 | Python | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop. | from collections import deque
s = deque()
s.append(31.06)
s.append(29.54)
s.append(80.18)
s.append(2.54)
print(s.popleft())
print(s.popleft()) | Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']. |
1,006 | Python | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop. | from collections import deque
container = deque()
container.append(13.22)
container.append(49.35)
container.append(1.5)
container.append(35.87)
print(container.popleft())
print(container.popleft()) | Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']. |
1,007 | Python | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop. | from collections import deque
s = deque()
s.append(35.67)
s.append(29.04)
s.append(86.04)
s.append(66.87)
print(s.popleft())
print(s.popleft()) | Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']. |
1,008 | Python | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop. | from collections import deque
q = deque()
q.append(71.61)
q.append(15.12)
q.append(73.57)
q.append(43.77)
print(q.popleft())
print(q.popleft()) | Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']. |
1,009 | Python | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, pop, push, push. | from collections import deque
q = deque()
q.append(47.84)
print(q.popleft())
q.append(81.36)
q.append(64.07) | Queue with float elements, ops=['push', 'pop', 'push', 'push']. |
1,010 | Python | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, pop, push, push. | from collections import deque
box_ = deque()
box_.append(40.51)
print(box_.popleft())
box_.append(89.41)
box_.append(92.1) | Queue with float elements, ops=['push', 'pop', 'push', 'push']. |
1,011 | Python | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, pop, push, push. | from collections import deque
container = deque()
container.append(31.76)
print(container.popleft())
container.append(68.21)
container.append(32.93) | Queue with float elements, ops=['push', 'pop', 'push', 'push']. |
1,012 | Python | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, pop, push, push. | from collections import deque
container = deque()
container.append(14.78)
print(container.popleft())
container.append(25.75)
container.append(42.21) | Queue with float elements, ops=['push', 'pop', 'push', 'push']. |
1,013 | JavaScript | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, push, pop. | class SQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const s = new SQueue();
s.enqueue(39);
s.enqueue(40);
s.enqueue(11);
console.log(s.dequeue()); | Queue with int elements, ops=['push', 'push', 'push', 'pop']. |
1,014 | JavaScript | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, push, pop. | class ContainerQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const container = new ContainerQueue();
container.enqueue(81);
container.enqueue(60);
container.enqueue(70);
console.log(container.dequeue()); | Queue with int elements, ops=['push', 'push', 'push', 'pop']. |
1,015 | JavaScript | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, push, pop. | class Box_Queue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const box_ = new Box_Queue();
box_.enqueue(56);
box_.enqueue(13);
box_.enqueue(18);
console.log(box_.dequeue()); | Queue with int elements, ops=['push', 'push', 'push', 'pop']. |
1,016 | JavaScript | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, push, pop. | class Box_Queue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const box_ = new Box_Queue();
box_.enqueue(89);
box_.enqueue(41);
box_.enqueue(65);
console.log(box_.dequeue()); | Queue with int elements, ops=['push', 'push', 'push', 'pop']. |
1,017 | JavaScript | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, pop, push, pop. | class CollQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const coll = new CollQueue();
coll.enqueue(46);
coll.enqueue(60);
console.log(coll.dequeue());
coll.enqueue(55);
console.log(coll.dequeue()); | Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']. |
1,018 | JavaScript | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, pop, push, pop. | class Box_Queue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const box_ = new Box_Queue();
box_.enqueue(53);
box_.enqueue(60);
console.log(box_.dequeue());
box_.enqueue(72);
console.log(box_.dequeue()); | Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']. |
1,019 | JavaScript | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, pop, push, pop. | class Box_Queue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const box_ = new Box_Queue();
box_.enqueue(12);
box_.enqueue(97);
console.log(box_.dequeue());
box_.enqueue(79);
console.log(box_.dequeue()); | Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']. |
1,020 | JavaScript | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, pop, push, pop. | class SQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const s = new SQueue();
s.enqueue(75);
s.enqueue(66);
console.log(s.dequeue());
s.enqueue(17);
console.log(s.dequeue()); | Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']. |
1,021 | JavaScript | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop. | class ContainerQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const container = new ContainerQueue();
container.enqueue(73);
container.enqueue(38);
container.enqueue(7);
container.enqueue(97);
console.log(container.dequeue());
console.log(container.dequ... | Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']. |
1,022 | JavaScript | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop. | class Box_Queue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const box_ = new Box_Queue();
box_.enqueue(86);
box_.enqueue(1);
box_.enqueue(60);
box_.enqueue(98);
console.log(box_.dequeue());
console.log(box_.dequeue()); | Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']. |
1,023 | JavaScript | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop. | class QQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const q = new QQueue();
q.enqueue(11);
q.enqueue(8);
q.enqueue(35);
q.enqueue(84);
console.log(q.dequeue());
console.log(q.dequeue()); | Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']. |
1,024 | JavaScript | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop. | class ContainerQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const container = new ContainerQueue();
container.enqueue(13);
container.enqueue(38);
container.enqueue(73);
container.enqueue(62);
console.log(container.dequeue());
console.log(container.deq... | Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']. |
1,025 | JavaScript | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, pop, push, push. | class QQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const q = new QQueue();
q.enqueue(16);
console.log(q.dequeue());
q.enqueue(75);
q.enqueue(87); | Queue with int elements, ops=['push', 'pop', 'push', 'push']. |
1,026 | JavaScript | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, pop, push, push. | class ContainerQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const container = new ContainerQueue();
container.enqueue(95);
console.log(container.dequeue());
container.enqueue(7);
container.enqueue(90); | Queue with int elements, ops=['push', 'pop', 'push', 'push']. |
1,027 | JavaScript | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, pop, push, push. | class SQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const s = new SQueue();
s.enqueue(67);
console.log(s.dequeue());
s.enqueue(72);
s.enqueue(95); | Queue with int elements, ops=['push', 'pop', 'push', 'push']. |
1,028 | JavaScript | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, pop, push, push. | class Box_Queue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const box_ = new Box_Queue();
box_.enqueue(18);
console.log(box_.dequeue());
box_.enqueue(87);
box_.enqueue(82); | Queue with int elements, ops=['push', 'pop', 'push', 'push']. |
1,029 | JavaScript | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, push, pop. | class SQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const s = new SQueue();
s.enqueue(30.79);
s.enqueue(31.78);
s.enqueue(98.93);
console.log(s.dequeue()); | Queue with float elements, ops=['push', 'push', 'push', 'pop']. |
1,030 | JavaScript | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, push, pop. | class Box_Queue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const box_ = new Box_Queue();
box_.enqueue(62.74);
box_.enqueue(20.87);
box_.enqueue(7.65);
console.log(box_.dequeue()); | Queue with float elements, ops=['push', 'push', 'push', 'pop']. |
1,031 | JavaScript | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, push, pop. | class QQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const q = new QQueue();
q.enqueue(52.46);
q.enqueue(25.47);
q.enqueue(11.26);
console.log(q.dequeue()); | Queue with float elements, ops=['push', 'push', 'push', 'pop']. |
1,032 | JavaScript | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, push, pop. | class ContainerQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const container = new ContainerQueue();
container.enqueue(44.94);
container.enqueue(6.51);
container.enqueue(13.06);
console.log(container.dequeue()); | Queue with float elements, ops=['push', 'push', 'push', 'pop']. |
1,033 | JavaScript | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, pop, push, pop. | class SQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const s = new SQueue();
s.enqueue(82.21);
s.enqueue(84.33);
console.log(s.dequeue());
s.enqueue(82.35);
console.log(s.dequeue()); | Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']. |
1,034 | JavaScript | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, pop, push, pop. | class CollQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const coll = new CollQueue();
coll.enqueue(62.1);
coll.enqueue(43.8);
console.log(coll.dequeue());
coll.enqueue(19.3);
console.log(coll.dequeue()); | Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']. |
1,035 | JavaScript | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, pop, push, pop. | class CollQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const coll = new CollQueue();
coll.enqueue(24.83);
coll.enqueue(51.64);
console.log(coll.dequeue());
coll.enqueue(20.83);
console.log(coll.dequeue()); | Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']. |
1,036 | JavaScript | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, pop, push, pop. | class BufQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const buf = new BufQueue();
buf.enqueue(67.09);
buf.enqueue(95.95);
console.log(buf.dequeue());
buf.enqueue(67.1);
console.log(buf.dequeue()); | Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']. |
1,037 | JavaScript | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop. | class CollQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const coll = new CollQueue();
coll.enqueue(80.19);
coll.enqueue(46.93);
coll.enqueue(81.54);
coll.enqueue(15.67);
console.log(coll.dequeue());
console.log(coll.dequeue()); | Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']. |
1,038 | JavaScript | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop. | class Box_Queue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const box_ = new Box_Queue();
box_.enqueue(2.09);
box_.enqueue(30.97);
box_.enqueue(64.87);
box_.enqueue(89.43);
console.log(box_.dequeue());
console.log(box_.dequeue()); | Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']. |
1,039 | JavaScript | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop. | class BufQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const buf = new BufQueue();
buf.enqueue(96.32);
buf.enqueue(47.32);
buf.enqueue(72.58);
buf.enqueue(28.41);
console.log(buf.dequeue());
console.log(buf.dequeue()); | Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']. |
1,040 | JavaScript | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop. | class ContainerQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const container = new ContainerQueue();
container.enqueue(21.87);
container.enqueue(90.35);
container.enqueue(52.98);
container.enqueue(51.79);
console.log(container.dequeue());
console.log(c... | Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']. |
1,041 | JavaScript | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, pop, push, push. | class CollQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const coll = new CollQueue();
coll.enqueue(72.2);
console.log(coll.dequeue());
coll.enqueue(71.8);
coll.enqueue(78.88); | Queue with float elements, ops=['push', 'pop', 'push', 'push']. |
1,042 | JavaScript | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, pop, push, push. | class BufQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const buf = new BufQueue();
buf.enqueue(78.71);
console.log(buf.dequeue());
buf.enqueue(92.42);
buf.enqueue(7.75); | Queue with float elements, ops=['push', 'pop', 'push', 'push']. |
1,043 | JavaScript | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, pop, push, push. | class CollQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const coll = new CollQueue();
coll.enqueue(48.89);
console.log(coll.dequeue());
coll.enqueue(60.98);
coll.enqueue(18.86); | Queue with float elements, ops=['push', 'pop', 'push', 'push']. |
1,044 | JavaScript | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, pop, push, push. | class CollQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
const coll = new CollQueue();
coll.enqueue(92.81);
console.log(coll.dequeue());
coll.enqueue(53.02);
coll.enqueue(13.81); | Queue with float elements, ops=['push', 'pop', 'push', 'push']. |
1,045 | Node.js | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, push, pop. | class BufQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { BufQueue };
const buf = new BufQueue();
buf.enqueue(76);
buf.enqueue(75);
buf.enqueue(45);
console.log(buf.dequeue()); | Queue with int elements, ops=['push', 'push', 'push', 'pop']. |
1,046 | Node.js | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, push, pop. | class ContainerQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { ContainerQueue };
const container = new ContainerQueue();
container.enqueue(52);
container.enqueue(9);
container.enqueue(6);
console.log(container.dequeue()); | Queue with int elements, ops=['push', 'push', 'push', 'pop']. |
1,047 | Node.js | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, push, pop. | class CollQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { CollQueue };
const coll = new CollQueue();
coll.enqueue(21);
coll.enqueue(30);
coll.enqueue(13);
console.log(coll.dequeue()); | Queue with int elements, ops=['push', 'push', 'push', 'pop']. |
1,048 | Node.js | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, push, pop. | class QQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { QQueue };
const q = new QQueue();
q.enqueue(64);
q.enqueue(87);
q.enqueue(61);
console.log(q.dequeue()); | Queue with int elements, ops=['push', 'push', 'push', 'pop']. |
1,049 | Node.js | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, pop, push, pop. | class SQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { SQueue };
const s = new SQueue();
s.enqueue(99);
s.enqueue(94);
console.log(s.dequeue());
s.enqueue(14);
console.log(s.dequeue()); | Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']. |
1,050 | Node.js | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, pop, push, pop. | class CollQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { CollQueue };
const coll = new CollQueue();
coll.enqueue(50);
coll.enqueue(97);
console.log(coll.dequeue());
coll.enqueue(9);
console.log(coll.dequeue()); | Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']. |
1,051 | Node.js | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, pop, push, pop. | class ContainerQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { ContainerQueue };
const container = new ContainerQueue();
container.enqueue(33);
container.enqueue(15);
console.log(container.dequeue());
container.enqueue(96);
console.log... | Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']. |
1,052 | Node.js | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, pop, push, pop. | class Box_Queue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { Box_Queue };
const box_ = new Box_Queue();
box_.enqueue(98);
box_.enqueue(48);
console.log(box_.dequeue());
box_.enqueue(81);
console.log(box_.dequeue()); | Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']. |
1,053 | Node.js | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop. | class SQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { SQueue };
const s = new SQueue();
s.enqueue(42);
s.enqueue(14);
s.enqueue(90);
s.enqueue(58);
console.log(s.dequeue());
console.log(s.dequeue()); | Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']. |
1,054 | Node.js | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop. | class CollQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { CollQueue };
const coll = new CollQueue();
coll.enqueue(74);
coll.enqueue(72);
coll.enqueue(26);
coll.enqueue(26);
console.log(coll.dequeue());
console.log(coll.dequeue()); | Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']. |
1,055 | Node.js | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop. | class Box_Queue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { Box_Queue };
const box_ = new Box_Queue();
box_.enqueue(87);
box_.enqueue(37);
box_.enqueue(29);
box_.enqueue(26);
console.log(box_.dequeue());
console.log(box_.dequeue()); | Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']. |
1,056 | Node.js | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop. | class Box_Queue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { Box_Queue };
const box_ = new Box_Queue();
box_.enqueue(68);
box_.enqueue(25);
box_.enqueue(12);
box_.enqueue(75);
console.log(box_.dequeue());
console.log(box_.dequeue()); | Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']. |
1,057 | Node.js | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, pop, push, push. | class CollQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { CollQueue };
const coll = new CollQueue();
coll.enqueue(13);
console.log(coll.dequeue());
coll.enqueue(5);
coll.enqueue(18); | Queue with int elements, ops=['push', 'pop', 'push', 'push']. |
1,058 | Node.js | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, pop, push, push. | class QQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { QQueue };
const q = new QQueue();
q.enqueue(47);
console.log(q.dequeue());
q.enqueue(53);
q.enqueue(73); | Queue with int elements, ops=['push', 'pop', 'push', 'push']. |
1,059 | Node.js | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, pop, push, push. | class ContainerQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { ContainerQueue };
const container = new ContainerQueue();
container.enqueue(10);
console.log(container.dequeue());
container.enqueue(24);
container.enqueue(88); | Queue with int elements, ops=['push', 'pop', 'push', 'push']. |
1,060 | Node.js | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, pop, push, push. | class CollQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { CollQueue };
const coll = new CollQueue();
coll.enqueue(94);
console.log(coll.dequeue());
coll.enqueue(68);
coll.enqueue(64); | Queue with int elements, ops=['push', 'pop', 'push', 'push']. |
1,061 | Node.js | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, push, pop. | class SQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { SQueue };
const s = new SQueue();
s.enqueue(83.41);
s.enqueue(57.47);
s.enqueue(47.9);
console.log(s.dequeue()); | Queue with float elements, ops=['push', 'push', 'push', 'pop']. |
1,062 | Node.js | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, push, pop. | class ContainerQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { ContainerQueue };
const container = new ContainerQueue();
container.enqueue(90.08);
container.enqueue(85.49);
container.enqueue(80.36);
console.log(container.dequeue()); | Queue with float elements, ops=['push', 'push', 'push', 'pop']. |
1,063 | Node.js | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, push, pop. | class CollQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { CollQueue };
const coll = new CollQueue();
coll.enqueue(38.24);
coll.enqueue(8.02);
coll.enqueue(8.74);
console.log(coll.dequeue()); | Queue with float elements, ops=['push', 'push', 'push', 'pop']. |
1,064 | Node.js | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, push, pop. | class BufQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { BufQueue };
const buf = new BufQueue();
buf.enqueue(10.99);
buf.enqueue(50.37);
buf.enqueue(6.1);
console.log(buf.dequeue()); | Queue with float elements, ops=['push', 'push', 'push', 'pop']. |
1,065 | Node.js | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, pop, push, pop. | class QQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { QQueue };
const q = new QQueue();
q.enqueue(23.18);
q.enqueue(94.12);
console.log(q.dequeue());
q.enqueue(25.89);
console.log(q.dequeue()); | Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']. |
1,066 | Node.js | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, pop, push, pop. | class QQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { QQueue };
const q = new QQueue();
q.enqueue(87.37);
q.enqueue(16.63);
console.log(q.dequeue());
q.enqueue(53.91);
console.log(q.dequeue()); | Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']. |
1,067 | Node.js | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, pop, push, pop. | class ContainerQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { ContainerQueue };
const container = new ContainerQueue();
container.enqueue(93.25);
container.enqueue(50.5);
console.log(container.dequeue());
container.enqueue(6.61);
cons... | Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']. |
1,068 | Node.js | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, pop, push, pop. | class QQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { QQueue };
const q = new QQueue();
q.enqueue(58.69);
q.enqueue(93.76);
console.log(q.dequeue());
q.enqueue(65.67);
console.log(q.dequeue()); | Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']. |
1,069 | Node.js | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop. | class Box_Queue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { Box_Queue };
const box_ = new Box_Queue();
box_.enqueue(26.83);
box_.enqueue(34.12);
box_.enqueue(76.71);
box_.enqueue(14.79);
console.log(box_.dequeue());
console.log(box_.dequ... | Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']. |
1,070 | Node.js | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop. | class CollQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { CollQueue };
const coll = new CollQueue();
coll.enqueue(91.32);
coll.enqueue(7.17);
coll.enqueue(49.86);
coll.enqueue(80.76);
console.log(coll.dequeue());
console.log(coll.deque... | Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']. |
1,071 | Node.js | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop. | class QQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { QQueue };
const q = new QQueue();
q.enqueue(35.24);
q.enqueue(8.01);
q.enqueue(42.21);
q.enqueue(74.19);
console.log(q.dequeue());
console.log(q.dequeue()); | Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']. |
1,072 | Node.js | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop. | class Box_Queue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { Box_Queue };
const box_ = new Box_Queue();
box_.enqueue(94.71);
box_.enqueue(27.78);
box_.enqueue(5.13);
box_.enqueue(4.52);
console.log(box_.dequeue());
console.log(box_.dequeu... | Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']. |
1,073 | Node.js | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, pop, push, push. | class Box_Queue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { Box_Queue };
const box_ = new Box_Queue();
box_.enqueue(48.28);
console.log(box_.dequeue());
box_.enqueue(87.77);
box_.enqueue(23.55); | Queue with float elements, ops=['push', 'pop', 'push', 'push']. |
1,074 | Node.js | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, pop, push, push. | class QQueue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { QQueue };
const q = new QQueue();
q.enqueue(3.61);
console.log(q.dequeue());
q.enqueue(20.42);
q.enqueue(61.21); | Queue with float elements, ops=['push', 'pop', 'push', 'push']. |
1,075 | Node.js | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, pop, push, push. | class Box_Queue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { Box_Queue };
const box_ = new Box_Queue();
box_.enqueue(68.51);
console.log(box_.dequeue());
box_.enqueue(55.7);
box_.enqueue(6.16); | Queue with float elements, ops=['push', 'pop', 'push', 'push']. |
1,076 | Node.js | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, pop, push, push. | class Box_Queue {
#items = [];
enqueue(item) { this.#items.push(item); }
dequeue() { return this.#items.shift(); }
}
module.exports = { Box_Queue };
const box_ = new Box_Queue();
box_.enqueue(69.85);
console.log(box_.dequeue());
box_.enqueue(43.26);
box_.enqueue(14.64); | Queue with float elements, ops=['push', 'pop', 'push', 'push']. |
1,077 | Java | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, push, pop. | import java.util.*;
public class Main {
public static void main(String[] args) {
Queue<Integer> box_ = new LinkedList<>();
box_.add(16);
box_.add(79);
box_.add(48);
System.out.println(box_.poll());
}
} | Queue with int elements, ops=['push', 'push', 'push', 'pop']. |
1,078 | Java | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, push, pop. | import java.util.*;
public class Main {
public static void main(String[] args) {
Queue<Integer> s = new LinkedList<>();
s.add(44);
s.add(56);
s.add(8);
System.out.println(s.poll());
}
} | Queue with int elements, ops=['push', 'push', 'push', 'pop']. |
1,079 | Java | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, push, pop. | import java.util.*;
public class Main {
public static void main(String[] args) {
Queue<Integer> s = new LinkedList<>();
s.add(12);
s.add(76);
s.add(2);
System.out.println(s.poll());
}
} | Queue with int elements, ops=['push', 'push', 'push', 'pop']. |
1,080 | Java | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, push, pop. | import java.util.*;
public class Main {
public static void main(String[] args) {
Queue<Integer> box_ = new LinkedList<>();
box_.add(96);
box_.add(97);
box_.add(69);
System.out.println(box_.poll());
}
} | Queue with int elements, ops=['push', 'push', 'push', 'pop']. |
1,081 | Java | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, pop, push, pop. | import java.util.*;
public class Main {
public static void main(String[] args) {
Queue<Integer> q = new LinkedList<>();
q.add(2);
q.add(93);
System.out.println(q.poll());
q.add(8);
System.out.println(q.poll());
}
} | Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']. |
1,082 | Java | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, pop, push, pop. | import java.util.*;
public class Main {
public static void main(String[] args) {
Queue<Integer> q = new LinkedList<>();
q.add(17);
q.add(57);
System.out.println(q.poll());
q.add(37);
System.out.println(q.poll());
}
} | Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']. |
1,083 | Java | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, pop, push, pop. | import java.util.*;
public class Main {
public static void main(String[] args) {
Queue<Integer> buf = new LinkedList<>();
buf.add(45);
buf.add(78);
System.out.println(buf.poll());
buf.add(32);
System.out.println(buf.poll());
}
} | Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']. |
1,084 | Java | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, pop, push, pop. | import java.util.*;
public class Main {
public static void main(String[] args) {
Queue<Integer> s = new LinkedList<>();
s.add(78);
s.add(51);
System.out.println(s.poll());
s.add(85);
System.out.println(s.poll());
}
} | Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']. |
1,085 | Java | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop. | import java.util.*;
public class Main {
public static void main(String[] args) {
Queue<Integer> coll = new LinkedList<>();
coll.add(10);
coll.add(10);
coll.add(33);
coll.add(70);
System.out.println(coll.poll());
System.out.println(coll.poll());
}
... | Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']. |
1,086 | Java | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop. | import java.util.*;
public class Main {
public static void main(String[] args) {
Queue<Integer> coll = new LinkedList<>();
coll.add(95);
coll.add(46);
coll.add(29);
coll.add(57);
System.out.println(coll.poll());
System.out.println(coll.poll());
}
... | Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']. |
1,087 | Java | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop. | import java.util.*;
public class Main {
public static void main(String[] args) {
Queue<Integer> buf = new LinkedList<>();
buf.add(100);
buf.add(71);
buf.add(38);
buf.add(84);
System.out.println(buf.poll());
System.out.println(buf.poll());
}
} | Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']. |
1,088 | Java | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop. | import java.util.*;
public class Main {
public static void main(String[] args) {
Queue<Integer> buf = new LinkedList<>();
buf.add(41);
buf.add(90);
buf.add(70);
buf.add(65);
System.out.println(buf.poll());
System.out.println(buf.poll());
}
} | Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']. |
1,089 | Java | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, pop, push, push. | import java.util.*;
public class Main {
public static void main(String[] args) {
Queue<Integer> buf = new LinkedList<>();
buf.add(53);
System.out.println(buf.poll());
buf.add(80);
buf.add(63);
}
} | Queue with int elements, ops=['push', 'pop', 'push', 'push']. |
1,090 | Java | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, pop, push, push. | import java.util.*;
public class Main {
public static void main(String[] args) {
Queue<Integer> buf = new LinkedList<>();
buf.add(11);
System.out.println(buf.poll());
buf.add(18);
buf.add(67);
}
} | Queue with int elements, ops=['push', 'pop', 'push', 'push']. |
1,091 | Java | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, pop, push, push. | import java.util.*;
public class Main {
public static void main(String[] args) {
Queue<Integer> s = new LinkedList<>();
s.add(40);
System.out.println(s.poll());
s.add(71);
s.add(27);
}
} | Queue with int elements, ops=['push', 'pop', 'push', 'push']. |
1,092 | Java | Data Structures | intermediate | Implement a queue of ints and run the operation sequence: push, pop, push, push. | import java.util.*;
public class Main {
public static void main(String[] args) {
Queue<Integer> q = new LinkedList<>();
q.add(48);
System.out.println(q.poll());
q.add(19);
q.add(5);
}
} | Queue with int elements, ops=['push', 'pop', 'push', 'push']. |
1,093 | Java | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, push, pop. | import java.util.*;
public class Main {
public static void main(String[] args) {
Queue<Double> s = new LinkedList<>();
s.add(70.14);
s.add(65.34);
s.add(45.92);
System.out.println(s.poll());
}
} | Queue with float elements, ops=['push', 'push', 'push', 'pop']. |
1,094 | Java | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, push, pop. | import java.util.*;
public class Main {
public static void main(String[] args) {
Queue<Double> box_ = new LinkedList<>();
box_.add(83.8);
box_.add(27.76);
box_.add(59.24);
System.out.println(box_.poll());
}
} | Queue with float elements, ops=['push', 'push', 'push', 'pop']. |
1,095 | Java | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, push, pop. | import java.util.*;
public class Main {
public static void main(String[] args) {
Queue<Double> q = new LinkedList<>();
q.add(6.91);
q.add(85.6);
q.add(39.01);
System.out.println(q.poll());
}
} | Queue with float elements, ops=['push', 'push', 'push', 'pop']. |
1,096 | Java | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, push, pop. | import java.util.*;
public class Main {
public static void main(String[] args) {
Queue<Double> box_ = new LinkedList<>();
box_.add(39.08);
box_.add(5.4);
box_.add(21.37);
System.out.println(box_.poll());
}
} | Queue with float elements, ops=['push', 'push', 'push', 'pop']. |
1,097 | Java | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, pop, push, pop. | import java.util.*;
public class Main {
public static void main(String[] args) {
Queue<Double> box_ = new LinkedList<>();
box_.add(53.72);
box_.add(66.38);
System.out.println(box_.poll());
box_.add(76.54);
System.out.println(box_.poll());
}
} | Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']. |
1,098 | Java | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, pop, push, pop. | import java.util.*;
public class Main {
public static void main(String[] args) {
Queue<Double> container = new LinkedList<>();
container.add(75.69);
container.add(34.29);
System.out.println(container.poll());
container.add(26.99);
System.out.println(container... | Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']. |
1,099 | Java | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, pop, push, pop. | import java.util.*;
public class Main {
public static void main(String[] args) {
Queue<Double> s = new LinkedList<>();
s.add(75.97);
s.add(34.75);
System.out.println(s.poll());
s.add(43.97);
System.out.println(s.poll());
}
} | Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']. |
1,100 | Java | Data Structures | intermediate | Implement a queue of floats and run the operation sequence: push, push, pop, push, pop. | import java.util.*;
public class Main {
public static void main(String[] args) {
Queue<Double> coll = new LinkedList<>();
coll.add(92.93);
coll.add(75.49);
System.out.println(coll.poll());
coll.add(55.78);
System.out.println(coll.poll());
}
} | Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']. |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.