<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>String on Hitesh Patel</title><link>https://hiteshbuilds.com/tags/string/</link><description>Recent content in String on Hitesh Patel</description><generator>Hugo -- 0.155.3</generator><language>en-us</language><lastBuildDate>Tue, 17 Mar 2026 00:00:00 +0530</lastBuildDate><atom:link href="https://hiteshbuilds.com/tags/string/index.xml" rel="self" type="application/rss+xml"/><item><title>How to check if a string is a Valid Palindrome: O(n) two pointer solution explained</title><link>https://hiteshbuilds.com/blind-75/valid-palindrome/</link><pubDate>Tue, 17 Mar 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/valid-palindrome/</guid><description>Explanation with intuitions of how to check if a string is a palindrome by ignoring non-alphanumeric characters with two-pointer approach.</description></item><item><title>How to check Valid Parentheses: O(n) Stack solution explained</title><link>https://hiteshbuilds.com/blind-75/valid-parentheses/</link><pubDate>Mon, 16 Mar 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/valid-parentheses/</guid><description>Step by step explanation of how to validate bracket sequences using a stack, with dry run and C++ code</description></item><item><title>How to Group Anagrams: O(n · m log m) Solution Explained</title><link>https://hiteshbuilds.com/blind-75/group-anagrams/</link><pubDate>Fri, 13 Mar 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/group-anagrams/</guid><description>Step by step explanation of how to group anagrams together using sorting and hashmaps, with brute force and optimized solutions</description></item><item><title>How to find if string is Valid Anagram: O(n) solution explained</title><link>https://hiteshbuilds.com/blind-75/valid-anagram/</link><pubDate>Thu, 12 Mar 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/valid-anagram/</guid><description>Step by step explanation with how we found two string are anagrams or not with optimization</description></item><item><title>Minimum Window Substring: Sliding Window Explained</title><link>https://hiteshbuilds.com/blind-75/minimum-window-substring/</link><pubDate>Wed, 11 Mar 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/minimum-window-substring/</guid><description>Step by step explanation with how we reach the solution of how to find the minimum window substring using Brute Force and Sliding Window</description></item><item><title>Longest Repeating Character Replacement: Sliding Window Explained</title><link>https://hiteshbuilds.com/blind-75/longest-repeating-character-replacement/</link><pubDate>Tue, 10 Mar 2026 12:12:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/longest-repeating-character-replacement/</guid><description>Step by step explanation of how to find the longest repeating character replacement using Brute Force and Sliding Window using hashtable</description></item><item><title>Longest Substring Without Repeating Characters: Sliding Window Explained</title><link>https://hiteshbuilds.com/blind-75/longest-substring-without-repeating-characters/</link><pubDate>Mon, 09 Mar 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/longest-substring-without-repeating-characters/</guid><description>Step by step explanation of how to find the longest substring without repeating characters using Brute Force and Sliding Window, including optimization techniques.</description></item></channel></rss>