How do you implement a wrap around queue??
In a normal queue, when implemented as an array, when you pop something of an array, you need to shift all elements in the array by one.. this is not efficient..
Implement a wrap around array to solve this problem