Search for a command to run...
Articles tagged with #data-structures
Breadth-First Search (BFS) & Depth-first Search are traversal techniques for navigating all types of Graphs. Highly recommend reading the post on graph data structure patterns, which builds a foundation of how Graph representations appear in most cod...
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 employees in a company. A social network like LinkedIn or Instagram has users as the nodes; the edges...
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 applying it to the following three problems: Find Middle of Linked List Find Kth-node from last Dete...
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 to the other as we always only maintain a pointer to only the next node in the list. After moving, t...
Linked Lists are one of the most fundamental data structures in computer science and are represented mainly by these two types: Singly Linked List Doubly Linked List Node - the Building block The smallest unit of a Linked List is defined by a Nod...
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 Enterprise-grade applications at my full-time job. Java might be a verbose language but it is one of t...
