Menu
Tech Interview Handbook LogoTech Interview Handbook
Getting StartedBlogGitHub
Tech Interview Handbook LogoTech Interview Handbook
  • Getting Started
  • Blog
  • GitHub
  • Preface
    • Introduction
    • Landscape
  • Job Application
    • Resume
    • Cover Letter
  • Interview Process
    • Interview Formats
    • Self Introduction
    • Coding Round
      • Overview
      • Picking a Language
      • Study and Practice
      • Best Practice Questions
      • During the Coding Interview
      • Cheatsheet
      • Coding Signals
      • Mock Interviews
      • Cheatsheet (Interviewer)
    • Behavioral Round
      • Overview
      • STAR Format
      • Common Questions
      • Psychological Tricks
    • Questions To Ask
  • Post Interview
    • Understanding Compensation
    • Negotiation
  • Algorithms
    • Introduction
    • Array
    • Binary
    • Dynamic Programming
    • Geometry
    • Graph
    • Hash Table
    • Heap
    • Interval
    • Linked List
    • Math
    • Matrix
    • Object-Oriented Programming
    • Permutation
    • Queue
    • Recursion
    • Sorting and Searching
    • Stack
    • String
    • Tree
    • Trie

Queue

Sample questions#

  • Implement a Queue class from scratch with an existing bug, the bug is that it cannot take more than 5 elements.
  • Implement a Queue using two stacks. You may only use the standard push(), pop(), and peek() operations traditionally available to stacks. You do not need to implement the stack yourself (i.e. an array can be used to simulate a stack).
Edit this page
Last updated on 9/26/2019 by Yangshun Tay
Previous
« Permutation
Next
Recursion »
  • Sample questions
Copyright © 2020 Yangshun Tay. Built with Docusaurus.