Array implementation of doubly ended queue (deque) #120
Description
Description of the problem
I propose the implementation of a doubly ended queue (deque) using arrays. A deque allows insertions and deletions from both the front and the rear end. The various methods available will be insert front, insert rear, delete front , delete rear in addition to returning the element at front or rear.
Hope this task will be assigned to me