Implement Queue using Stacks

easy

Acceptance: 63%

StackQueueDesign

Construct a FIFO queue using nothing but two stacks and their standard operations (push to top, pop from top, peek at top, check if empty). Your MyQueue class should provide push, pop, peek, and empty methods that behave exactly like a real queue.

Examples

Example 1:

Input:MyQueue(), push(5), push(10), peek(), pop(), empty()

Output:[null,null,null,5,5,false]

Hints

1234567

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

Implement Queue using Stacks

Examples

Hints

Related Problems