Strings & Sliding Window Patterns

Perform fundamental string manipulations in Java, including reversal and checking for palindromes/anagrams.

Find the longest common prefix among an array of strings.

Apply the fixed-size sliding window technique to solve constrained subarray problems (e.g., max sum subarray of size k).

Find the longest substring without repeating characters using a variable-size sliding window and a HashSet or array.

Solve the 'Minimum Window Substring' problem using a sliding window with a HashMap for frequency tracking.

Count the number of substrings with at most K distinct characters using a sliding window.

Implement the Z-algorithm or KMP algorithm for efficient pattern searching in a string.