字符串

LeetCode notes on the Longest Common Substring problem.

LeetCode notes on the Longest Common Subsequence problem.

LeetCode notes on the longest substring without repeating characters.

LeetCode notes on the Edit Distance problem.

Word Break using DFS and DFS with memoization.

Word search in a two-dimensional grid using DFS.

A note for the longest common substring problem.

Longest common subsequence using recursion, DFS with memoization, and dynamic programming.

Letter combinations of a phone number using DFS to enumerate combinations.

Edit distance using recursion and recursion with memoization.

Group anagrams using a brute-force method and hashing.

Find all anagrams in a string using brute force and a sliding window with counts.

Longest common prefix using a brute-force approach, with a trie idea noted.

Check whether a string is a palindrome using reversal and two pointers.

A Go implementation for reversing a string.

Count palindromic substrings using brute force and center expansion.

Longest palindromic substring using brute force and center expansion.

Add large numbers represented as strings by scanning from right to left and carrying.

Decode strings in k[encoded_string] form using a stack.

Use a stack to mark matched parentheses, then count the longest consecutive valid interval.

Enumerate whether to keep or remove each character, then keep the longest valid-parentheses results.

Generate parentheses using full enumeration with a stack, and pruning based on remaining left/right parentheses.

Validate a parentheses sequence using a stack or repeated string replacement.

Regular expression matching with support for . and *.

Find the longest substring without repetition using a brute-force set approach and a sliding window.