# Introduction In this challenge, we will be implementing a `Queue` class using an array as the underlying data structure. The `Queue` class should have methods to add elements to the queue (`enqueue`), remove elements from the queue (`dequeue`), check if the queue is empty (`empty`), and get the size of the queue (`getSize`). The challenge also includes a test class (`TestQueue`) that adds numbers from 0 to 20 to the queue and then removes and displays them.
Click the virtual machine below to start practicing