Data Structures & Algorithms Breadth-First Search (BFS) - Graph Traversal Pattern 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 coding interview questions. This post aims to teach you a single template for implementing and
Data Structures & Algorithms Graph Data Structure Patterns - Basics with Visualizations 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 between the nodes represent
Data Structures & Algorithms Slow & Fast Pointers - Linked List Pattern 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: 1. Find Middle of Linked List 2. Find Kth-node from last 3. Detect a cycle in Linked List
Data Structures & Algorithms Reversal Pattern - Linked List In this post, we will learn about Reversing a linked list and all the different problems where you can apply this pattern to solve twisted Linked List problems.
Data Structures & Algorithms Featured Basics of Linked List An introduction to the Singly Linked List and Doubly Linked List (DLL) data structures and their applications.
Java Programming Concepts & Applications Java Collections Java Collections Framework is the fundamental library that provides access to commonly used Data-Structures like List, Queue, Set and Map. In this tutorial you will learn in detail about all the Collections supported in Java.
