string algorithm — 3 Technical Articles

Jan 9, 2026 · Interview Experience

How to Find the Longest Balanced Substring in a Binary String (LeetCode 2609)

The article presents LeetCode problem 2609, defining a balanced substring as a consecutive segment of zeros followed by an equal number of ones, and provides a linear‑time solution using a two‑pointer scan that counts consecutive zeros and ones, with implementations in Java, C++, Python, and TypeScript, along with complexity analysis.

Balanced SubstringC++Java

0 likes · 7 min read

How to Find the Longest Balanced Substring in a Binary String (LeetCode 2609)

Wu Shixiong's Large Model Academy

Sep 7, 2023 · Fundamentals

Find the Longest Common Substring Between Two Code Snippets with DP

This article explains how to locate the longest continuous common substring between two strings representing code lines using a dynamic‑programming approach, provides a clear Python implementation, and details the algorithm's initialization, transition, and time‑space complexity.

dynamic programminglongest common substringstring algorithm

0 likes · 8 min read

Find the Longest Common Substring Between Two Code Snippets with DP

Wu Shixiong's Large Model Academy

Sep 6, 2023 · Fundamentals

How to Minimize Flips to Make a Binary String Strictly Increasing (DP Solution)

Given a binary string of A's and B's, the task is to compute the minimum number of character flips required to transform it into a strictly increasing (lexicographically non‑decreasing) string, using a state‑DP approach that runs in O(N) time and O(N) space.

dynamic programmingminimum flipsstate DP

0 likes · 9 min read

How to Minimize Flips to Make a Binary String Strictly Increasing (DP Solution)