<?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>Coding Archives - HackerHeap</title>
	<atom:link href="https://www.hackerheap.com/tag/coding/feed/" rel="self" type="application/rss+xml" />
	<link>https://www.hackerheap.com/tag/coding/</link>
	<description>Build with AI agents — Claude Code, MCP, agents, automation. Working code, honest takes, no fluff.</description>
	<lastBuildDate>Tue, 05 May 2026 15:00:01 +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>Coding Archives - HackerHeap</title>
	<link>https://www.hackerheap.com/tag/coding/</link>
	<width>32</width>
	<height>32</height>
</image> 
<site xmlns="com-wordpress:feed-additions:1">105925724</site>	<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>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 Regular Expression Matching Java Solution</title>
		<link>https://www.hackerheap.com/leetcode-regular-expression-matching-java-solution/</link>
		
		<dc:creator><![CDATA[rajendra]]></dc:creator>
		<pubDate>Sat, 27 Jun 2020 02:18:41 +0000</pubDate>
				<category><![CDATA[Data Structures & Algorithms]]></category>
		<category><![CDATA[Leetcode]]></category>
		<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Amazon Interview Questions]]></category>
		<category><![CDATA[Coding]]></category>
		<category><![CDATA[Cracking The Coding Interview]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[How to Crack Coding Interviews]]></category>
		<category><![CDATA[Leetcode Problems]]></category>
		<category><![CDATA[Leetcode Solutions Java]]></category>
		<guid isPermaLink="false">https://www.hackerheap.com/?p=393</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-regular-expression-matching-java-solution/">Leetcode Regular Expression Matching Java Solution</a> appeared first on <a href="https://www.hackerheap.com">HackerHeap</a>.</p>
]]></description>
		
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">393</post-id>	</item>
		<item>
		<title>Leetcode ZigZag Conversion Java Solution</title>
		<link>https://www.hackerheap.com/leetcode-zigzag-conversion-java-solution/</link>
		
		<dc:creator><![CDATA[rajendra]]></dc:creator>
		<pubDate>Sat, 27 Jun 2020 02:10:45 +0000</pubDate>
				<category><![CDATA[Data Structures & Algorithms]]></category>
		<category><![CDATA[Leetcode]]></category>
		<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Amazon Interview Questions]]></category>
		<category><![CDATA[Coding]]></category>
		<category><![CDATA[Cracking The Coding Interview]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Leetcode Problems]]></category>
		<category><![CDATA[Leetcode Solutions Java]]></category>
		<guid isPermaLink="false">https://www.hackerheap.com/?p=391</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-zigzag-conversion-java-solution/">Leetcode ZigZag Conversion Java Solution</a> appeared first on <a href="https://www.hackerheap.com">HackerHeap</a>.</p>
]]></description>
		
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">391</post-id>	</item>
		<item>
		<title>Leetcode Sum Root to Leaf Numbers Java Solution</title>
		<link>https://www.hackerheap.com/leetcode-sum-root-to-leaf-numbers-java-solution/</link>
		
		<dc:creator><![CDATA[rajendra]]></dc:creator>
		<pubDate>Fri, 26 Jun 2020 23:08:38 +0000</pubDate>
				<category><![CDATA[Data Structures & Algorithms]]></category>
		<category><![CDATA[Leetcode]]></category>
		<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Amazon Interview Questions]]></category>
		<category><![CDATA[Coding]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Hacker Rank]]></category>
		<category><![CDATA[How to Crack Coding Interviews]]></category>
		<category><![CDATA[Leetcode Problems]]></category>
		<category><![CDATA[Leetcode Solutions Java]]></category>
		<category><![CDATA[O(N) Time Complexity]]></category>
		<category><![CDATA[Sum Root to Leaf Numbers]]></category>
		<guid isPermaLink="false">https://www.hackerheap.com/?p=387</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-sum-root-to-leaf-numbers-java-solution/">Leetcode Sum Root to Leaf Numbers Java Solution</a> appeared first on <a href="https://www.hackerheap.com">HackerHeap</a>.</p>
]]></description>
		
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">387</post-id>	</item>
		<item>
		<title>Leetcode Find the Duplicate Number Java Solution</title>
		<link>https://www.hackerheap.com/leetcode-find-the-duplicate-number-java-solution/</link>
		
		<dc:creator><![CDATA[rajendra]]></dc:creator>
		<pubDate>Fri, 26 Jun 2020 04:22:25 +0000</pubDate>
				<category><![CDATA[Data Structures & Algorithms]]></category>
		<category><![CDATA[Leetcode]]></category>
		<category><![CDATA[Amazon Interview Questions]]></category>
		<category><![CDATA[Coding]]></category>
		<category><![CDATA[Cracking The Coding Interview]]></category>
		<category><![CDATA[Find the Duplicate Number]]></category>
		<category><![CDATA[Leetcode Find the Duplicate Number Solution Java Solution]]></category>
		<category><![CDATA[Leetcode Solutions Java]]></category>
		<category><![CDATA[Programming]]></category>
		<guid isPermaLink="false">https://www.hackerheap.com/?p=383</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-find-the-duplicate-number-java-solution/">Leetcode Find the Duplicate Number Java Solution</a> appeared first on <a href="https://www.hackerheap.com">HackerHeap</a>.</p>
]]></description>
		
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">383</post-id>	</item>
		<item>
		<title>Leetcode 1 Two Sum Java Solution</title>
		<link>https://www.hackerheap.com/two-sum-java-solution/</link>
		
		<dc:creator><![CDATA[rajendra]]></dc:creator>
		<pubDate>Sun, 14 Jun 2020 00:43:02 +0000</pubDate>
				<category><![CDATA[Data Structures & Algorithms]]></category>
		<category><![CDATA[Leetcode]]></category>
		<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Arrays]]></category>
		<category><![CDATA[Big O Notation]]></category>
		<category><![CDATA[Coding]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[HashMap]]></category>
		<category><![CDATA[Leetcode Solutions Java]]></category>
		<category><![CDATA[Programming]]></category>
		<guid isPermaLink="false">https://www.hackerheap.com/?p=314</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/two-sum-java-solution/">Leetcode 1 Two Sum Java Solution</a> appeared first on <a href="https://www.hackerheap.com">HackerHeap</a>.</p>
]]></description>
		
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">314</post-id>	</item>
	</channel>
</rss>
