Implement Queue using Stacks (Round 2, LC 232:)
Asked at Microsoft · Coding & Leetcode-style Questions · Difficulty: Easy
Implement a first in first out (FIFO) queue using only two stacks. The implemented queue should support all the functions of a normal queue (push, peek, pop, and empty).
Loading the problem…
More Microsoft interview questions
- LLM conceptual questions
- Transformer Roofline and FP32→FP16 Drill
- Tiny Next-Token Prediction Model (PyTorch Fill-In)
- DNA Shotgun Sequencing: Chain and Eulerian Path Reconstruction
- Design Search Autocomplete / Typeahead
- Design a Chatbot Personalization / Memory System