Tag archive

#string

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

3 articles

Suffix Automaton in Java: The Ultimate String Data Structure

When it comes to string processing, the Suffix Automaton (SAM) is often considered the most powerful data structure. It is a minimal Deterministic Finite Automaton (DFA) that recognizes all suffixes of a given string. Wh…

Apr 21, 20263 min read

Deep Dive

#dsa#java#string

DSAIntermediate

Manacher's Algorithm in Java: Linear Time Palindrome Search

Finding the longest palindromic substring is a classic interview problem. While the naive approach takes $O(N^3)$ and dynamic programming takes $O(N^2)$, Manacher's Algorithm achieves the same result in linear time ($O(N…

Apr 20, 20263 min read

Deep Dive

#dsa#java#string

DSAExpert

Suffix Arrays and Suffix Trees in Java: Advanced String Structures

When it comes to advanced string processing, Suffix Trees and Suffix Arrays are the heavy hitters. They allow you to answer complex queries about a string—like "What is the longest repeated substring?" or "How many times…

Apr 19, 20263 min read

Deep Dive

#dsa#java#algorithms