Queue implementation currently uses a list under the hood. It should be modified to use a deque to make it efficient.

[the-shank]

The Queue implementation, as it currently stands uses a list and then does a self.items.insert(0, item) to insert an item in the Queue.
This is inefficient. A better approach is to modify Queue to use a deque under the hood, instead of a list for increased efficiency.
Please let me know if you agree with the above approach so that I can send a pull request with the appropriate changes.

[prakhar1989]

Completely agree. When I wrote that, I wasn't sure using a library ready queue (deque) was a good idea for implementing a queue. Feel free to send in a PR and I'll take a look. 👍

[the-shank]

Cool ! I will send the PR shortly.

[the-shank]

@prakhar1989 #43 PR sent

[prakhar1989]

Merged. Thanks for contributing 🍻