14 lines
365 B
Python
14 lines
365 B
Python
|
"""
|
||
|
|
Tyler Perkins
|
||
|
|
15-11-23
|
||
|
|
|
||
|
|
Good morning! Here's your coding interview problem for today.
|
||
|
|
|
||
|
|
This problem was asked by Apple.
|
||
|
|
|
||
|
|
Implement a queue using two stacks. Recall that a queue is a FIFO (first-in, first-out) data structure with the following methods: enqueue, which inserts an element into the queue, and dequeue, which removes it.
|
||
|
|
|
||
|
|
"""
|
||
|
|
|
||
|
|
print("Hello World!")
|