@Back2Lobby
Web Developer
Apr 22, 2025 · 5 min read · We learned linear queue or simple queue last time, now its time to learn circular queue which will fix main issues with the linear queue. We will be able to reuse the empty space for more items. Here is a quick look at it: The way it works is simple...
Join discussionJun 16, 2024 · 4 min read · Another simplest data structure after stack is the "Queue" data structure. As we know the stack data structure is based on LIFO (Last In, First Out), the queue data structure is based on exactly opposite FIFO (First In, First Out). So, first element ...
Join discussionMay 29, 2024 · 4 min read · We covered array and linked lists in previous articles. Now we got a much simpler data structure "Stack". It represents a simple LIFO (The last-in, first-out) list which only allows you to extract/read items one by one starting from the last inserted...
Join discussionApr 23, 2024 · 4 min read · Alright, we covered singly linked list in the previous article, now it's time for a doubly linked list, which to be honest isn't that different much from a singly linked list. The only difference is we that each node contains a reference to the previ...
Join discussionFeb 20, 2024 · 6 min read · We learned our first data structure "Arrays" in the last article. Now, its time to move on to "Linked Lists". Unlike arrays, linked list data structure allows us to store data without having any kind of index. Another difference is that an array is f...
Join discussion