#data-structures
Read more stories on Hashnode
Articles with this tag
Breadth-First Search (BFS) & Depth-first Search are traversal techniques for navigating all types of Graphs. Highly recommend reading the post on...
A graph generally represents a network of nodes or a hierarchy. In real life, it could be a network of roads, people or computers, or a hierarchy of...
The Slow & Fast Pointer approach is the second pattern that will come in handy when working on Linked list problems. We will learn this pattern by...
We learned in the Basics of Linked Lists that traversal in a Singly Linked list is uni-directional. This means we can only move forward from one node...
Linked Lists are one of the most fundamental data structures in computer science and are represented mainly by these two types: Singly Linked...
Java has been my primary programming language for almost 7+ years now. Out of which I spent 4 years building college projects and 3+ years building...
