?? Day #39 of My 365 Days Coding Challenge!

?? A Personal Reflection:

Ever stood in a queue waiting for your turn? That’s exactly how a queue works in programming! First In, First Out (FIFO) is the rule, just like waiting in line for coffee ?. Today, I implemented a queue using an array to reinforce this concept.

?? What I Did Today:

I built a custom queue using Python’s list, supporting enqueue, dequeue, peek, and checking if the queue is empty.

?? Key Learning:

• FIFO (First-In-First-Out): The first element enqueued is the first to be dequeued.
• Time Complexity: enqueue(): O(1) (appending to the list) dequeue(): O(n) (removing from the front, shifting elements) peek(): O(1) is_empty(): O(1)

?? Your Turn:

Can you modify this to use a circular queue instead of a simple array?

#365DaysOfCode #CodingChallenge #QueueImplementation