Tag archive

#strings

Topic-specific entry points for internal linking, discovery, and deeper subject exploration.

3 articles

Longest Common Subsequence (LCS) in Java: Dynamic Programming Guide

The Longest Common Subsequence (LCS) problem is a foundation of many string comparison tools, including git diff and bioinformatics software. A subsequence is a sequence that appears in the same relative order, but not n…

Apr 19, 20263 min read

Deep Dive

#dsa#java#algorithms

DSAIntermediate

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…

Apr 18, 202612 min read

Deep Dive

#dsa#java#sliding window

DSAIntermediate

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…

Apr 18, 20269 min read

Deep Dive

#dsa#java#two pointers