Circular 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 Sep 1 · 11 min readarijitkundu.hashnode.dev
Queue 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 righAug 31 · 10 min readarijitkundu.hashnode.dev
Circular 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 slighAug 30 · 13 min readarijitkundu.hashnode.dev
Doubly 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 storAug 30 · 13 min readarijitkundu.hashnode.dev
Stack 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, FirstAug 29 · 10 min readarijitkundu.hashnode.dev
