Skip to main content

#String Manipulation

Browse articles tagged with #String Manipulation

  • DSA Problems

    Longest Repeating Character Replacement Algorithm

    Learn to find the maximum length of a substring that can be made with at most k replacements to make all characters the same.

  • DSA Problems

    Find All Anagrams in a String Algorithm Solution

    Complete Java implementation for finding all anagrams of a pattern string within a target string using sliding window technique.

  • DSA Problems

    Permutation in String Algorithm Solution

    Complete Java implementation for checking if one string contains a permutation of another string using sliding window technique.

  • DSA Problems

    First Unique Character in a String Algorithm

    Find the first non-repeating character in a string and return its index, with optimal time and space complexity solutions.

  • DSA Patterns

    Longest Substring Without Repeating Characters

    Comprehensive Java solution for finding the longest substring without repeating characters using sliding window technique with detailed complexity analysis and edge case handling.

  • DSA Problems

    Isomorphic Strings Java Solution with HashMap

    Complete Java implementation for determining if two strings are isomorphic, using character mapping with HashMap for optimal time and space complexity.

  • DSA Patterns

    Group Anagrams Problem Solution | LeetCode 49

    Complete Java solution for grouping anagrams with optimal time and space complexity analysis for FAANG interviews.

  • DSA Problems

    Decode String Algorithm Solution

    Java implementation of decode string problem with stack-based approach for handling nested encoded patterns.

  • DSA Patterns

    Valid Anagram Solution Patterns and Implementation

    Complete Java implementation guide for valid anagram problems covering sorting, counting, and hash map approaches with time/space complexity analysis.

  • DSA Problems

    Compare Version Numbers Java Solution

    Complete Java implementation to compare version numbers with proper edge case handling and performance considerations.

  • DSA Problems

    String to Integer Conversion Algorithm

    Implementation of atoi function converting strings to 32-bit signed integers with overflow handling and edge case management.

  • DSA Problems

    Group Anagrams Problem Solution

    Complete Java implementation for grouping anagrams from a string array, including optimal approach and time/space complexity analysis.

Stay in the Loop

Get curated DSA patterns, coding problems, frontend and backend LLD/HLD, and AI/ML System Design insights delivered straight to your inbox. No spam, just focused interview and engineering content.