Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to Stacks & queues

Ready to read

JSJavaScript⑂Git◎Interview prepΣDSA in JSSDSystem Design
More topics15›
</>HTML{ }CSS⚛ReactNNext.jsNeNest.jsTSTypeScriptNoNode.js🐳DockerDBSQL & Databases✓Testing🔒Web Security☁Cloud & DevOps◈GraphQL◆Redis☸Kubernetes
☰‹›
Description
All topics›JavaScript›Stacks & queues

Implement Queue using Stacks

beginnerlayer B8 · Stacks & queues4 tests

Build a FIFO queue whose only storage is two stacks. A stack lets you push to the end, pop from the end, and read its length — nothing else.

  • push(x) — add x to the back of the queue
  • pop() — remove and return the value at the front
  • peek() — return the front value without removing it
  • empty() — true when the queue holds nothing
  • Do not use shift(), unshift() or indexed reads into the middle of an array — only stack operations

Stuck?

All exercisesPlayground
1234567891011121314
loading the editor…

Nothing yet — hit Run and whatever you log shows up here.

Submit to see how you did.

⌘/Ctrl + Enter run⌘/Ctrl + S save⌘/Ctrl + / comment⌘/Ctrl + F find/replace⌘/Ctrl + D select next matchAlt + click multi-cursorTab indent · ⇧Tab outdentEsc leave fullscreen