DSA Articles

BFS (Breadth First Search) in Java: Level-Order and Shortest Path

Introduction to Breadth First Search (BFS) Breadth First Search (BFS) is a fundamental algorithm for traversing or searching tree or graph data structures. Unlike DFS, which explores as deeply as possible along each bran…

Apr 18, 2026·11 min read

#dsa#java#bfs

Read Article →

More DSA Guides

Big-O Notation in Java: Time and Space Complexity for Interview Problem Solving

Big-O notation scares a lot of people because it often gets explained as math first and problem solving second. In interviews, that is backward. You do not need to sound like a theoretician. You need to look at code, est…

#dsa#java#big-o

Binary Search Pattern in Java: Efficiently Searching Sorted Data

Introduction to the Binary Search Pattern The Binary Search pattern is a highly efficient algorithm for finding an item from a sorted list of items. It works by repeatedly dividing in half the portion of the list that co…

#dsa#java#binary search

DFS (Depth First Search) in Java: Tree and Graph Traversals

Introduction to Depth First Search (DFS) Depth First Search (DFS) is a fundamental algorithm for traversing or searching tree or graph data structures. It explores as far as possible along each branch before backtracking…

#dsa#java#dfs

Dijkstra’s Algorithm in Java: Finding Shortest Paths in Weighted Graphs

Introduction to Dijkstra’s Algorithm Dijkstra's Algorithm is a classic and widely used algorithm for finding the shortest paths between nodes in a graph. Specifically, it finds the shortest path from a single source node…

#dsa#java#dijkstra

#dsa#java#dutch national flag

Dutch National Flag Pattern in Java: Efficient Three-Way Partitioning

Introduction to the Dutch National Flag (DNF) Pattern The Dutch National Flag (DNF) pattern, also known as three-way partitioning, is an algorithm for sorting an array containing three distinct values (or elements that c…

Apr 18, 20268 min read

Fast & Slow Pointers in Java: Detecting Cycles and Finding Middle Elements

Introduction to the Fast & Slow Pointers Pattern The Fast & Slow Pointers pattern, also known as the Hare and Tortoise algorithm, is a powerful and elegant technique used primarily in problems involving linked lists and …

#dsa#java#fast slow pointers

In-place Reversal of a Linked List in Java: Efficient Memory Management

Introduction to In-place Linked List Reversal Reversing a linked list is a fundamental operation in Data Structures and Algorithms (DSA) that frequently appears in technical interviews. The in-place reversal technique is…

#dsa#java#linked list

Kadane’s Algorithm in Java: Finding the Maximum Subarray Sum Efficiently

Introduction to Kadane’s Algorithm Kadane’s Algorithm is a classic and highly efficient dynamic programming approach used to find the maximum sum of a contiguous subarray within a one-dimensional array of numbers. This p…

#dsa#java#kadane's algorithm

Monotonic Queue Pattern in Java: Efficiently Solving Sliding Window Maximum

Introduction to the Monotonic Queue Pattern The Monotonic Queue pattern, often implemented using a (double-ended queue), is a specialized data structure technique used to efficiently solve problems involving sliding win…

#dsa#java#monotonic queue

Monotonic Stack Pattern in Java: Efficiently Finding Next Greater/Smaller Elements

Introduction to the Monotonic Stack Pattern The Monotonic Stack pattern is a specialized application of the stack data structure where the elements within the stack are always kept in a specific order (either strictly in…

#dsa#java#monotonic stack

Prefix Sum Pattern in Java: Efficiently Calculate Range Sums and Subarray Properties

Introduction to the Prefix Sum Pattern The Prefix Sum pattern is a fundamental technique in Data Structures and Algorithms (DSA) used to efficiently answer queries about the sum (or other aggregate properties) of element…

#dsa#java#prefix sum

Sliding Window Pattern in Java: Efficiently Solve Array and String Subarray Problems

Introduction to the Sliding Window Pattern The Sliding Window pattern is a powerful technique used to solve problems that involve finding a subarray, subsegment, or substring in a given array or string that satisfies a c…

#dsa#java#sliding window

Sorting Algorithms in Java: QuickSort, MergeSort, and HeapSort Explained

Introduction to Sorting Algorithms Sorting is one of the most fundamental and widely studied problems in computer science. It involves arranging elements of a list or array in a specific order (e.g., numerical, lexicogra…

#dsa#java#sorting algorithms

Topological Sort in Java: Handling Dependencies with Kahn's Algorithm

Introduction to Topological Sort Topological Sort (or Topological Ordering) is an algorithm for ordering the vertices of a Directed Acyclic Graph (DAG) such that for every directed edge , vertex comes before vertex in …

#dsa#java#topological sort

Two Pointers Pattern in Java: Solve Array and String Problems Efficiently

The two pointers pattern is one of the fastest ways to turn a slow nested-loop solution into a clean linear-time solution. It shows up everywhere: - sorted arrays - palindrome problems - deduplication - partitioning - li…

#dsa#java#two pointers