<?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>Two-Pointers on Hitesh Patel</title><link>https://hiteshbuilds.com/tags/two-pointers/</link><description>Recent content in Two-Pointers 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/two-pointers/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>Find the container with most water (Blind 75) — O(n) Solution</title><link>https://hiteshbuilds.com/blind-75/container-most-water/</link><pubDate>Tue, 17 Feb 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/container-most-water/</guid><description>Step by step thought process for how to find the two lines such that they contain most water using two pointer approach</description></item></channel></rss>