Circular queue implementation using linked list in java

#datastructure #codingchallenge 

Need to build a circular queue, first item will get overwritten when the queue overflows or the capacity finishes. In normal sense, newest item would replace the oldest item.  

Circular Queue is also a linear data structure, which follows the principle of FIFO(First In First Out),

but instead of ending the queue at the last position, it again starts from the first position after the last,

hence making the queue behave like a circular data structure.

Youtube playlist for more coding challenge like this:

Github Code Repository for coding challenge:

https://github.com/premaseem/AlgoAndDataStructureInJava/tree/master/src/codechallenge

For details visit:

https://premaseem.wordpress.com/category/coding-challenge/

If you have a better/ different solution, please share your solution in the comment.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.