← Back to Journeys
Series Journey

Patterns in Code: DSA Mastery Journey

A step-by-step journey through data structures and algorithms, exploring one pattern at a time — from simple problems to complex challenges. Learn, code, and master the art of problem-solving in a structured way.

7 articles in this series
Patterns in Code: DSA Mastery Journey

Articles in this series

Technical Directory

Tech Insights & Engineering Articles

Explore technical articles, software architecture deep dives, clean code tutorials, and computer science explorations from my journey.

Expand Around Center — A Symmetry Discovery Pattern

Expand Around Center — A Symmetry Discovery Pattern

When a structure is symmetric, the fastest way to verify it is not from the edges — it’s from the balance point. Inste…

Arun Pandian M
Feb 21, 2026
5 min read
In-Place Slow–Fast Scan Pattern: Remove Duplicates from a Sorted Array

In-Place Slow–Fast Scan Pattern: Remove Duplicates from a Sorted Array

The **in-place Slow–Fast Scan pattern** is designed for problems where data must be processed or cleaned without allocat…

Arun Pandian M
Jan 26, 2026
5 min read
Detecting Cycles & Repeats: Fast & Slow Pointer Pattern

Detecting Cycles & Repeats: Fast & Slow Pointer Pattern

If you’ve ever watched two runners on a track, one sprinting and the other jogging, you know that sometimes the faster r…

Arun Pandian M
Nov 18, 2025
3 min read
The Converging Pointer Pattern: Efficient Pair Searching in Arrays

The Converging Pointer Pattern: Efficient Pair Searching in Arrays

Imagine you’re at a bustling farmers’ market, and you want to pick two fruits whose combined price exactly matches your …

Arun Pandian M
Nov 16, 2025
5 min read
The Two Pointer Pattern — Two Explorers, One Goal

The Two Pointer Pattern — Two Explorers, One Goal

Have you ever seen two detectives chasing the same suspect from different directions?

Arun Pandian M
Nov 9, 2025
3 min read
Kadane’s Algorithm: Maximum Subarray Sum Using Linear Scan

Kadane’s Algorithm: Maximum Subarray Sum Using Linear Scan

In our previous post, we explored the Linear Scan pattern — a simple yet powerful technique where we traverse an array o…

Arun Pandian M
Oct 11, 2025
5 min read
Array Traversal Pattern — Problem: Find Maximum Element in an Array

Array Traversal Pattern — Problem: Find Maximum Element in an Array

Given an array of integers, find the **largest element** in it. You need to scan through all elements and return the one…

Arun Pandian M
Oct 11, 2025
6 min read