Implement Queue Concept

[kodeflap]

Should implement different queue type concept in kotlin This task should implement by creating queue package then seperate sub package for each type of queue. Then implement each kotlin class for each

• [ ] Queue
• [ ] circular queue
• [ ] priority queue
• [ ] Deque

It's operations common for all type of queue

• [ ] Enqueue
• [ ] dequeue
• [ ] isEmpty
• [ ] isFull
• [ ] Peek

[ramyashreeshetty]

can i work on this?

[kodeflap]

yes, you can work on the issue

[ramyashreeshetty]

hey, actually i needed to confirm few things! over here

1. as y'll have created Data_structures.linked_lists, I have to create Data_structures.queues?
2. under that i'll be creating queue, circular q, priority q and deque.

• correct me if i'm wrong

[kodeflap]

Create package called queue in data structure and in there create sub packages

[ramyashreeshetty]

yes got it

ok, but to avoid conflicts I am reformatting the package structure so you can start when I just inform so that you can update the project. Is that ok🙂

[ramyashreeshetty]

@kodeflap for now i m completing the tasks, I havent commited anything so that wont be a problem. Do let me know when you are done wth formatting the project

[ramyashreeshetty]

@kodeflap hey i'm done with the tasks so can i create a pr?

[kodeflap]

@kodeflap hey i'm done with the tasks so can i create a pr?

Yes, you can I will merge it

[ramyashreeshetty]

okay

[ramyashreeshetty]

hey could you assign this issue 😅