AKArijit Kunduinarijitkundu.hashnode.dev·Sep 1 · 11 min readCircular QueueA normal Queue follows FIFO — First In, First Out. Elements are inserted from the rear and removed from the front. But a normal array-based Queue has an interesting problem. Imagine a queue with five 00
AKArijit Kunduinarijitkundu.hashnode.dev·Aug 31 · 10 min readQueue and Deque in DSA: Understanding FIFO with Python and CThere is something strangely satisfying about the word "queue". If you keep removing characters from the right side one by one: QUEUE → QUEU → QUE → QU → Q And if you read the remaining word from righ00
AKArijit Kunduinarijitkundu.hashnode.dev·Aug 30 · 13 min readCircular Linked List in Python: Singly and Doubly Circular Linked ListsLinked Lists are one of the most important data structures in DSA. We have already seen Singly Linked Lists and Doubly Linked Lists, where the last node points to None. A Circular Linked List is sligh00
AKArijit Kunduinarijitkundu.hashnode.dev·Aug 30 · 13 min readDoubly Linked ListA linked list is one of the fundamental data structures in DSA (Data Structures and Algorithms). Unlike an array, where elements are generally stored in contiguous memory locations, a linked list stor00
AKArijit Kunduinarijitkundu.hashnode.dev·Aug 29 · 10 min readStack When we start learning Data Structures and Algorithms, Stack is one of the first data structures we usually encounter. At first, Stack looks very simple. It basically follows one rule: Last In, First00
