<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Data Structures &amp; Algorithms Archives - HackerHeap</title>
	<atom:link href="https://www.hackerheap.com/category/data-structures-algorithms/feed/" rel="self" type="application/rss+xml" />
	<link>https://www.hackerheap.com/category/data-structures-algorithms/</link>
	<description>Build with AI agents — Claude Code, MCP, agents, automation. Working code, honest takes, no fluff.</description>
	<lastBuildDate>Tue, 05 May 2026 05:46:49 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.9.4</generator>

<image>
	<url>https://www.hackerheap.com/wp-content/uploads/2019/11/cropped-HackerHeap_Transparent-32x32.png</url>
	<title>Data Structures &amp; Algorithms Archives - HackerHeap</title>
	<link>https://www.hackerheap.com/category/data-structures-algorithms/</link>
	<width>32</width>
	<height>32</height>
</image> 
<site xmlns="com-wordpress:feed-additions:1">105925724</site>	<item>
		<title>LeetCode Maximum Erasure Value</title>
		<link>https://www.hackerheap.com/leetcode-maximum-erasure-value/</link>
		
		<dc:creator><![CDATA[rajendra]]></dc:creator>
		<pubDate>Sun, 12 Jun 2022 21:57:48 +0000</pubDate>
				<category><![CDATA[Data Structures & Algorithms]]></category>
		<category><![CDATA[InterviewPrep]]></category>
		<category><![CDATA[Leetcode]]></category>
		<category><![CDATA[Two Pointers]]></category>
		<category><![CDATA[Cracking The Coding Interview]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Interview Prep]]></category>
		<category><![CDATA[Leetcode Solutions Java]]></category>
		<category><![CDATA[two pointer problem]]></category>
		<guid isPermaLink="false">https://www.hackerheap.com/?p=521</guid>

					<description><![CDATA[<p>// SOLVING THIS WITH AN AI ASSISTANT (2026) If you are working through this problem with an AI coding assistant — Claude, ChatGPT, Cursor chat, Gemini, GitHub Copilot, Aider, or any agent — the goal isn&#8217;t to ask for the answer. It is to use the tool to understand the pattern. The prompt sequence I&#8217;d...</p>
<p>The post <a href="https://www.hackerheap.com/leetcode-maximum-erasure-value/">LeetCode Maximum Erasure Value</a> appeared first on <a href="https://www.hackerheap.com">HackerHeap</a>.</p>
]]></description>
		
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">521</post-id>	</item>
		<item>
		<title>Jump Search Algorithm In Java</title>
		<link>https://www.hackerheap.com/jump-search-algorithm-in-java/</link>
		
		<dc:creator><![CDATA[rajendra]]></dc:creator>
		<pubDate>Sun, 23 Aug 2020 22:19:16 +0000</pubDate>
				<category><![CDATA[Data Structures & Algorithms]]></category>
		<category><![CDATA[Search Algorithms]]></category>
		<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Coding]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Java]]></category>
		<category><![CDATA[Jump Search]]></category>
		<category><![CDATA[Jump Search Algorithm]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Search Algorithm]]></category>
		<category><![CDATA[Time Complexity]]></category>
		<guid isPermaLink="false">https://www.hackerheap.com/?p=450</guid>

					<description><![CDATA[<p>// SOLVING THIS WITH AN AI ASSISTANT (2026) If you are working through this problem with an AI coding assistant — Claude, ChatGPT, Cursor chat, Gemini, GitHub Copilot, Aider, or any agent — the goal isn&#8217;t to ask for the answer. It is to use the tool to understand the pattern. The prompt sequence I&#8217;d...</p>
<p>The post <a href="https://www.hackerheap.com/jump-search-algorithm-in-java/">Jump Search Algorithm In Java</a> appeared first on <a href="https://www.hackerheap.com">HackerHeap</a>.</p>
]]></description>
		
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">450</post-id>	</item>
		<item>
		<title>Knuth Morris Pratt Pattern Search Algorithm</title>
		<link>https://www.hackerheap.com/knuth-morris-pratt-pattern-search-algorithm/</link>
		
		<dc:creator><![CDATA[rajendra]]></dc:creator>
		<pubDate>Wed, 19 Aug 2020 01:31:42 +0000</pubDate>
				<category><![CDATA[Data Structures & Algorithms]]></category>
		<category><![CDATA[Search Algorithms]]></category>
		<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Knuth Morris Pattern]]></category>
		<category><![CDATA[Knuth Morris Pattern Search Algorithm Java]]></category>
		<category><![CDATA[Search Algorithm]]></category>
		<guid isPermaLink="false">https://www.hackerheap.com/?p=431</guid>

					<description><![CDATA[<p>// SOLVING THIS WITH AN AI ASSISTANT (2026) If you are working through this problem with an AI coding assistant — Claude, ChatGPT, Cursor chat, Gemini, GitHub Copilot, Aider, or any agent — the goal isn&#8217;t to ask for the answer. It is to use the tool to understand the pattern. The prompt sequence I&#8217;d...</p>
<p>The post <a href="https://www.hackerheap.com/knuth-morris-pratt-pattern-search-algorithm/">Knuth Morris Pratt Pattern Search Algorithm</a> appeared first on <a href="https://www.hackerheap.com">HackerHeap</a>.</p>
]]></description>
		
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">431</post-id>	</item>
		<item>
		<title>Binary Search Algorithm In Java</title>
		<link>https://www.hackerheap.com/binary-search-algorithm-in-java/</link>
		
		<dc:creator><![CDATA[rajendra]]></dc:creator>
		<pubDate>Tue, 11 Aug 2020 04:06:53 +0000</pubDate>
				<category><![CDATA[Data Structures & Algorithms]]></category>
		<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Binary Search]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Searching Algorithms]]></category>
		<guid isPermaLink="false">https://www.hackerheap.com/?p=420</guid>

					<description><![CDATA[<p>// SOLVING THIS WITH AN AI ASSISTANT (2026) If you are working through this problem with an AI coding assistant — Claude, ChatGPT, Cursor chat, Gemini, GitHub Copilot, Aider, or any agent — the goal isn&#8217;t to ask for the answer. It is to use the tool to understand the pattern. The prompt sequence I&#8217;d...</p>
<p>The post <a href="https://www.hackerheap.com/binary-search-algorithm-in-java/">Binary Search Algorithm In Java</a> appeared first on <a href="https://www.hackerheap.com">HackerHeap</a>.</p>
]]></description>
		
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">420</post-id>	</item>
		<item>
		<title>Leetcode Integer to Roman Java Solution</title>
		<link>https://www.hackerheap.com/leetcode-integer-to-roman-java-solution/</link>
		
		<dc:creator><![CDATA[rajendra]]></dc:creator>
		<pubDate>Tue, 28 Jul 2020 21:55:56 +0000</pubDate>
				<category><![CDATA[Data Structures & Algorithms]]></category>
		<category><![CDATA[InterviewPrep]]></category>
		<category><![CDATA[Leetcode]]></category>
		<category><![CDATA[Math]]></category>
		<category><![CDATA[String]]></category>
		<category><![CDATA[Cracking The Coding Interview]]></category>
		<category><![CDATA[How to Crack Coding Interviews]]></category>
		<category><![CDATA[Leetcode Integer to Roman Java Solution]]></category>
		<category><![CDATA[Leetcode Problems]]></category>
		<category><![CDATA[leetcode solutions]]></category>
		<category><![CDATA[Leetcode Solutions Java]]></category>
		<guid isPermaLink="false">https://www.hackerheap.com/?p=417</guid>

					<description><![CDATA[<p>// SOLVING THIS WITH AN AI ASSISTANT (2026) If you are working through this problem with an AI coding assistant — Claude, ChatGPT, Cursor chat, Gemini, GitHub Copilot, Aider, or any agent — the goal isn&#8217;t to ask for the answer. It is to use the tool to understand the pattern. The prompt sequence I&#8217;d...</p>
<p>The post <a href="https://www.hackerheap.com/leetcode-integer-to-roman-java-solution/">Leetcode Integer to Roman Java Solution</a> appeared first on <a href="https://www.hackerheap.com">HackerHeap</a>.</p>
]]></description>
		
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">417</post-id>	</item>
		<item>
		<title>Leetcode Container With Most Water Java Solution</title>
		<link>https://www.hackerheap.com/leetcode-container-with-most-water-java-solution/</link>
		
		<dc:creator><![CDATA[rajendra]]></dc:creator>
		<pubDate>Mon, 27 Jul 2020 00:38:58 +0000</pubDate>
				<category><![CDATA[Arrays]]></category>
		<category><![CDATA[Data Structures & Algorithms]]></category>
		<category><![CDATA[Leetcode]]></category>
		<category><![CDATA[Two Pointers]]></category>
		<category><![CDATA[Cracking The Coding Interview]]></category>
		<category><![CDATA[How to Crack Coding Interviews]]></category>
		<category><![CDATA[Leetcode Array Problems]]></category>
		<category><![CDATA[Leetcode Problems]]></category>
		<category><![CDATA[Leetcode Solutions Java]]></category>
		<category><![CDATA[Leetcode TwoPointers]]></category>
		<guid isPermaLink="false">https://www.hackerheap.com/?p=415</guid>

					<description><![CDATA[<p>// SOLVING THIS WITH AN AI ASSISTANT (2026) If you are working through this problem with an AI coding assistant — Claude, ChatGPT, Cursor chat, Gemini, GitHub Copilot, Aider, or any agent — the goal isn&#8217;t to ask for the answer. It is to use the tool to understand the pattern. The prompt sequence I&#8217;d...</p>
<p>The post <a href="https://www.hackerheap.com/leetcode-container-with-most-water-java-solution/">Leetcode Container With Most Water Java Solution</a> appeared first on <a href="https://www.hackerheap.com">HackerHeap</a>.</p>
]]></description>
		
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">415</post-id>	</item>
		<item>
		<title>Leetcode Binary Tree Level Order Traversal II Java Solution</title>
		<link>https://www.hackerheap.com/leetcode-binary-tree-level-order-traversal-ii-java-solution/</link>
		
		<dc:creator><![CDATA[rajendra]]></dc:creator>
		<pubDate>Fri, 03 Jul 2020 05:29:35 +0000</pubDate>
				<category><![CDATA[Data Structures & Algorithms]]></category>
		<category><![CDATA[Leetcode]]></category>
		<category><![CDATA[Amazon Interview Question]]></category>
		<category><![CDATA[Depth First Search]]></category>
		<category><![CDATA[DFS]]></category>
		<category><![CDATA[Facebook Interview Questions]]></category>
		<category><![CDATA[Leetcode Problems]]></category>
		<category><![CDATA[Leetcode Solutions Java]]></category>
		<guid isPermaLink="false">https://www.hackerheap.com/?p=411</guid>

					<description><![CDATA[<p>// SOLVING THIS WITH AN AI ASSISTANT (2026) If you are working through this problem with an AI coding assistant — Claude, ChatGPT, Cursor chat, Gemini, GitHub Copilot, Aider, or any agent — the goal isn&#8217;t to ask for the answer. It is to use the tool to understand the pattern. The prompt sequence I&#8217;d...</p>
<p>The post <a href="https://www.hackerheap.com/leetcode-binary-tree-level-order-traversal-ii-java-solution/">Leetcode Binary Tree Level Order Traversal II Java Solution</a> appeared first on <a href="https://www.hackerheap.com">HackerHeap</a>.</p>
]]></description>
		
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">411</post-id>	</item>
		<item>
		<title>Leetcode Unique Paths Java Solution</title>
		<link>https://www.hackerheap.com/leetcode-unique-paths-java-solution/</link>
		
		<dc:creator><![CDATA[rajendra]]></dc:creator>
		<pubDate>Tue, 30 Jun 2020 00:26:27 +0000</pubDate>
				<category><![CDATA[Data Structures & Algorithms]]></category>
		<category><![CDATA[Leetcode]]></category>
		<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Coding]]></category>
		<category><![CDATA[Cracking The Coding Interview]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[dynamic programming]]></category>
		<category><![CDATA[Hacker Rank]]></category>
		<category><![CDATA[Leetcode 62]]></category>
		<category><![CDATA[Leetcode Solutions Java]]></category>
		<category><![CDATA[Leetcode Unique Paths Java Solution]]></category>
		<category><![CDATA[Programming]]></category>
		<guid isPermaLink="false">https://www.hackerheap.com/?p=407</guid>

					<description><![CDATA[<p>// SOLVING THIS WITH AN AI ASSISTANT (2026) If you are working through this problem with an AI coding assistant — Claude, ChatGPT, Cursor chat, Gemini, GitHub Copilot, Aider, or any agent — the goal isn&#8217;t to ask for the answer. It is to use the tool to understand the pattern. The prompt sequence I&#8217;d...</p>
<p>The post <a href="https://www.hackerheap.com/leetcode-unique-paths-java-solution/">Leetcode Unique Paths Java Solution</a> appeared first on <a href="https://www.hackerheap.com">HackerHeap</a>.</p>
]]></description>
		
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">407</post-id>	</item>
		<item>
		<title>Leetcode Reconstruct Itinerary Java Solution</title>
		<link>https://www.hackerheap.com/leetcode-reconstruct-itinerary-java-solution/</link>
		
		<dc:creator><![CDATA[rajendra]]></dc:creator>
		<pubDate>Sun, 28 Jun 2020 16:14:26 +0000</pubDate>
				<category><![CDATA[Data Structures & Algorithms]]></category>
		<category><![CDATA[Leetcode]]></category>
		<category><![CDATA[Amazon Interview Questions]]></category>
		<category><![CDATA[Cracking The Coding Interview]]></category>
		<category><![CDATA[Depth First Search]]></category>
		<category><![CDATA[Facebook Interview Question]]></category>
		<category><![CDATA[Google Interview Questions]]></category>
		<category><![CDATA[How to Crack Coding Interviews]]></category>
		<category><![CDATA[Leetcode 332]]></category>
		<category><![CDATA[Leetcode Reconstruct Itinerary Java Solution]]></category>
		<category><![CDATA[leetocde]]></category>
		<guid isPermaLink="false">https://www.hackerheap.com/?p=400</guid>

					<description><![CDATA[<p>// SOLVING THIS WITH AN AI ASSISTANT (2026) If you are working through this problem with an AI coding assistant — Claude, ChatGPT, Cursor chat, Gemini, GitHub Copilot, Aider, or any agent — the goal isn&#8217;t to ask for the answer. It is to use the tool to understand the pattern. The prompt sequence I&#8217;d...</p>
<p>The post <a href="https://www.hackerheap.com/leetcode-reconstruct-itinerary-java-solution/">Leetcode Reconstruct Itinerary Java Solution</a> appeared first on <a href="https://www.hackerheap.com">HackerHeap</a>.</p>
]]></description>
		
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">400</post-id>	</item>
		<item>
		<title>Leetcode Perfect Squares Java Solution</title>
		<link>https://www.hackerheap.com/leetcode-perfect-squares-java-solution/</link>
		
		<dc:creator><![CDATA[rajendra]]></dc:creator>
		<pubDate>Sat, 27 Jun 2020 16:20:52 +0000</pubDate>
				<category><![CDATA[Data Structures & Algorithms]]></category>
		<category><![CDATA[Leetcode]]></category>
		<category><![CDATA[Amazon Interview Questions]]></category>
		<category><![CDATA[Cracking The Coding Interview]]></category>
		<category><![CDATA[dynamic programming]]></category>
		<category><![CDATA[How to Crack Coding Interviews]]></category>
		<category><![CDATA[leetcode 297]]></category>
		<category><![CDATA[Leetcode Perfect Squares Java Solution]]></category>
		<category><![CDATA[Leetcode Problems]]></category>
		<category><![CDATA[Leetcode Solutions Java]]></category>
		<guid isPermaLink="false">https://www.hackerheap.com/?p=395</guid>

					<description><![CDATA[<p>// SOLVING THIS WITH AN AI ASSISTANT (2026) If you are working through this problem with an AI coding assistant — Claude, ChatGPT, Cursor chat, Gemini, GitHub Copilot, Aider, or any agent — the goal isn&#8217;t to ask for the answer. It is to use the tool to understand the pattern. The prompt sequence I&#8217;d...</p>
<p>The post <a href="https://www.hackerheap.com/leetcode-perfect-squares-java-solution/">Leetcode Perfect Squares Java Solution</a> appeared first on <a href="https://www.hackerheap.com">HackerHeap</a>.</p>
]]></description>
		
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">395</post-id>	</item>
	</channel>
</rss>
