<?xml version="1.0" encoding="UTF-8"?>
<!-- This sitemap was dynamically generated on April 3, 2026 at 12:08 pm by All in One SEO - the original SEO plugin for WordPress. -->

<?xml-stylesheet type="text/xsl" href="https://thecodepathshala.in/default.xsl"?>

<rss version="2.0">
	<channel>
		<title>Learn to Code and Code to Learn</title>
		<link><![CDATA[https://thecodepathshala.in]]></link>
		<description><![CDATA[Learn to Code and Code to Learn]]></description>
		<lastBuildDate><![CDATA[2025-08-02T09:43:58+00:00]]></lastBuildDate>
		<docs>https://validator.w3.org/feed/docs/rss2.html</docs>
		<ttl>0</ttl>

		<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/08/02/palindrome-linked-list/ds-algo/competitive-programming/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/08/02/palindrome-linked-list/ds-algo/competitive-programming/]]></link>
			<title>Palindrome Linked List</title>
			<pubDate><![CDATA[2025-08-02T09:43:58+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/08/02/find-the-duplicate-number/ds-algo/competitive-programming/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/08/02/find-the-duplicate-number/ds-algo/competitive-programming/]]></link>
			<title>Find the Duplicate Number</title>
			<pubDate><![CDATA[2025-08-02T07:48:07+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/08/02/remove-nth-node-from-end-of-list/ds-algo/competitive-programming/leetcode-problems/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/08/02/remove-nth-node-from-end-of-list/ds-algo/competitive-programming/leetcode-problems/]]></link>
			<title>Remove Nth Node From End of List</title>
			<pubDate><![CDATA[2025-08-02T06:47:00+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/08/02/linked-list-cycle-ii/ds-algo/competitive-programming/leetcode-problems/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/08/02/linked-list-cycle-ii/ds-algo/competitive-programming/leetcode-problems/]]></link>
			<title>Linked List Cycle II</title>
			<pubDate><![CDATA[2025-08-02T06:14:29+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/03/01/decode-the-string-gfg-ptod-01-mar-medium-level-stack/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/03/01/decode-the-string-gfg-ptod-01-mar-medium-level-stack/ds-algo/]]></link>
			<title>Decode the string | GFG PTOD | 01 Mar| Medium level | STACK</title>
			<pubDate><![CDATA[2025-03-01T12:51:30+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/02/24/gfg-ptod-24-feb-stock-span-problem-medium-level-stack/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/02/24/gfg-ptod-24-feb-stock-span-problem-medium-level-stack/ds-algo/]]></link>
			<title>GFG PTOD | 24 Feb | Stock span problem | Medium level | STACK</title>
			<pubDate><![CDATA[2025-02-24T12:01:35+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/gfg-ptod-24-feb-next-greater-element-medium-level-stack/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/gfg-ptod-24-feb-next-greater-element-medium-level-stack/]]></link>
			<title>GFG PTOD | 24 Feb | Stock span problem | Medium level | STACK</title>
			<pubDate><![CDATA[2025-02-24T11:58:19+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/02/23/gfg-ptod-23-feb-next-greater-element-medium-level-stack/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/02/23/gfg-ptod-23-feb-next-greater-element-medium-level-stack/ds-algo/]]></link>
			<title>GFG PTOD | 23 Feb | Next Greater Element | Medium level | STACK</title>
			<pubDate><![CDATA[2025-02-23T09:49:52+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/02/22/gfg-ptod-22-feb-longest-valid-parentheses-hard-level-stack/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/02/22/gfg-ptod-22-feb-longest-valid-parentheses-hard-level-stack/ds-algo/]]></link>
			<title>GFG PTOD | 22 Feb | Longest valid Parentheses | Hard level | STACK</title>
			<pubDate><![CDATA[2025-02-22T12:29:59+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/02/22/gfg-ptod-21-feb-parenthesis-checker-easy-level-stack/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/02/22/gfg-ptod-21-feb-parenthesis-checker-easy-level-stack/ds-algo/]]></link>
			<title>GFG PTOD | 21 Feb | Parenthesis Checker | Easy level | STACK</title>
			<pubDate><![CDATA[2025-02-22T10:30:33+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/02/20/gfg-ptod-20-feb-find-median-in-a-stream-medium-level-heap/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/02/20/gfg-ptod-20-feb-find-median-in-a-stream-medium-level-heap/ds-algo/]]></link>
			<title>GFG PTOD | 20 Feb | Find median in a stream| Medium level | HEAP</title>
			<pubDate><![CDATA[2025-02-20T10:40:36+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/02/16/gfg-ptod-16-feb-serialize-and-deserialize-a-binary-tree-medium-level-tree/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/02/16/gfg-ptod-16-feb-serialize-and-deserialize-a-binary-tree-medium-level-tree/ds-algo/]]></link>
			<title>GFG PTOD | 16 Feb | Serialize and deserialize a binary tree | Medium level | Tree</title>
			<pubDate><![CDATA[2025-02-16T11:24:19+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/02/08/gfg-ptod-08-feb-tree-boundary-traversal-medium-level-tree/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/02/08/gfg-ptod-08-feb-tree-boundary-traversal-medium-level-tree/ds-algo/]]></link>
			<title>GFG PTOD | 08 Feb | Tree Boundary Traversal   | Medium level | Tree</title>
			<pubDate><![CDATA[2025-02-08T10:00:07+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/02/08/gfg-ptod-07-feb-inorder-traversal-easy-level-tree/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/02/08/gfg-ptod-07-feb-inorder-traversal-easy-level-tree/ds-algo/]]></link>
			<title>GFG PTOD | 07 Feb | Inorder Traversal  | Easy level | Tree</title>
			<pubDate><![CDATA[2025-02-08T09:58:40+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/02/05/gfg-ptod-05-feb-mirror-tree-medium-level-tree/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/02/05/gfg-ptod-05-feb-mirror-tree-medium-level-tree/ds-algo/]]></link>
			<title>GFG PTOD | 05 Feb | Mirror Tree | Medium level | Tree</title>
			<pubDate><![CDATA[2025-02-05T06:06:51+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/02/04/gfg-ptod-03-feb-diameter-of-a-binary-tree-medium-level-tree/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/02/04/gfg-ptod-03-feb-diameter-of-a-binary-tree-medium-level-tree/ds-algo/]]></link>
			<title>GFG PTOD | 04 Feb | Diameter of a Binary Tree | Medium level | Tree</title>
			<pubDate><![CDATA[2025-02-04T08:26:29+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/02/03/gfg-ptod-03-feb-height-of-binary-tree-medium-level-tree/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/02/03/gfg-ptod-03-feb-height-of-binary-tree-medium-level-tree/ds-algo/]]></link>
			<title>GFG PTOD | 03 Feb | Height of Binary Tree | Medium level | Tree</title>
			<pubDate><![CDATA[2025-02-03T11:18:19+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/02/02/gfg-ptod-02-feb-level-order-traversal-medium-level-backtracking/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/02/02/gfg-ptod-02-feb-level-order-traversal-medium-level-backtracking/ds-algo/]]></link>
			<title>GFG PTOD | 02 Feb | Level order traversal | Medium level | Backtracking</title>
			<pubDate><![CDATA[2025-02-02T09:53:07+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/02/01/gfg-ptod-01-feb-word-search-medium-level-backtracking/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/02/01/gfg-ptod-01-feb-word-search-medium-level-backtracking/ds-algo/]]></link>
			<title>GFG PTOD | 01 Feb | Word Search | Medium level | Backtracking</title>
			<pubDate><![CDATA[2025-02-01T09:40:51+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/01/31/gfg-ptod-31-jan-solve-the-sudoku-hard-level-backtracking/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/01/31/gfg-ptod-31-jan-solve-the-sudoku-hard-level-backtracking/ds-algo/]]></link>
			<title>GFG PTOD | 31 Jan | Solve the Sudoku  | Hard level | Backtracking</title>
			<pubDate><![CDATA[2025-01-31T10:43:55+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/01/30/gfg-ptod-29-jan-n-queen-problem-hard-backtracking/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/01/30/gfg-ptod-29-jan-n-queen-problem-hard-backtracking/ds-algo/]]></link>
			<title>GFG PTOD | 30 Jan | N-Queen Problem | Hard | Backtracking</title>
			<pubDate><![CDATA[2025-01-30T12:36:53+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/01/29/gfg-ptod-29-jan-implement-pow/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/01/29/gfg-ptod-29-jan-implement-pow/ds-algo/]]></link>
			<title>GFG PTOD | 29 Jan |  Implement Pow</title>
			<pubDate><![CDATA[2025-01-29T10:25:57+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/01/28/gfg-ptod-28-jan-permutations-of-a-string/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/01/28/gfg-ptod-28-jan-permutations-of-a-string/ds-algo/]]></link>
			<title>GFG PTOD | 28 Jan | Permutations of a String</title>
			<pubDate><![CDATA[2025-01-28T10:46:46+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/01/25/gfg-ptod-26-jan-remove-loop-in-linked-list/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/01/25/gfg-ptod-26-jan-remove-loop-in-linked-list/ds-algo/]]></link>
			<title>GFG PTOD | 26 Jan | Remove loop in Linked List</title>
			<pubDate><![CDATA[2025-01-25T18:53:04+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/01/25/gfg-ptod-25-jan-find-the-first-node-of-loop-in-linked-list-2/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/01/25/gfg-ptod-25-jan-find-the-first-node-of-loop-in-linked-list-2/ds-algo/]]></link>
			<title>GFG PTOD | 25 Jan | Find the first node of loop in linked list</title>
			<pubDate><![CDATA[2025-01-25T18:51:48+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/01/25/gfg-ptod-24-jan-detect-loop-in-linked-list/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/01/25/gfg-ptod-24-jan-detect-loop-in-linked-list/ds-algo/]]></link>
			<title>GFG PTOD | 24 Jan | Detect Loop in linked list</title>
			<pubDate><![CDATA[2025-01-25T10:08:06+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/01/25/gfg-ptod-23-jan-clone-list-with-next-and-random/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/01/25/gfg-ptod-23-jan-clone-list-with-next-and-random/ds-algo/]]></link>
			<title>GFG PTOD | 23 Jan | Clone List with Next and Random</title>
			<pubDate><![CDATA[2025-01-25T10:01:29+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/01/25/gfg-ptod-25-jan-find-the-first-node-of-loop-in-linked-list/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/01/25/gfg-ptod-25-jan-find-the-first-node-of-loop-in-linked-list/ds-algo/]]></link>
			<title>GFG PTOD | 25 Jan |  Find the first node of loop in linked list</title>
			<pubDate><![CDATA[2025-01-25T09:59:15+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/01/22/gfg-ptod-22-jan-2025-add-number-linked-lists/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/01/22/gfg-ptod-22-jan-2025-add-number-linked-lists/ds-algo/]]></link>
			<title>GFG PTOD | 22 Jan 2025 | Add Number Linked Lists</title>
			<pubDate><![CDATA[2025-01-22T09:22:33+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/01/21/gfg-ptod-21-jan-2025-linked-list-group-reverse/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/01/21/gfg-ptod-21-jan-2025-linked-list-group-reverse/ds-algo/]]></link>
			<title>GFG PTOD | 21 Jan 2025 | Linked List Group Reverse</title>
			<pubDate><![CDATA[2025-01-21T08:23:30+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/01/20/gfg-ptod-17-jan-2025-merge-two-sorted-linked-lists/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/01/20/gfg-ptod-17-jan-2025-merge-two-sorted-linked-lists/ds-algo/]]></link>
			<title>GFG PTOD | 20 Jan 2025 | Merge two sorted linked lists</title>
			<pubDate><![CDATA[2025-01-20T11:53:38+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/01/17/gfg-ptod-17-jan-2025-product-array-puzzle/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/01/17/gfg-ptod-17-jan-2025-product-array-puzzle/ds-algo/]]></link>
			<title>GFG PTOD | 17 Jan 2025 | Product array puzzle</title>
			<pubDate><![CDATA[2025-01-17T07:19:03+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/01/16/gfg-ptod-15-jan-2025-largest-subarray-of-0s-and-1s/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/01/16/gfg-ptod-15-jan-2025-largest-subarray-of-0s-and-1s/ds-algo/]]></link>
			<title>GFG PTOD | 16 Jan 2025 | Largest subarray of 0&#8217;s and 1&#8217;s</title>
			<pubDate><![CDATA[2025-01-16T13:34:12+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/01/15/gfg-ptod-15-jan-2025-longest-subarray-with-sum-k/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/01/15/gfg-ptod-15-jan-2025-longest-subarray-with-sum-k/ds-algo/]]></link>
			<title>GFG PTOD | 15 Jan 2025 | Longest Subarray with Sum K</title>
			<pubDate><![CDATA[2025-01-15T09:27:56+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/01/13/gfg-ptod-13-jan-2025-container-with-most-water/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/01/13/gfg-ptod-13-jan-2025-container-with-most-water/ds-algo/]]></link>
			<title>GFG PTOD | 13 Jan 2025 | Container With Most Water</title>
			<pubDate><![CDATA[2025-01-13T18:34:25+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/01/12/gfg-ptod-12-jan-2025-trapping-rain-water/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/01/12/gfg-ptod-12-jan-2025-trapping-rain-water/ds-algo/]]></link>
			<title>GFG PTOD | 12 Jan 2025 | Trapping Rain Water</title>
			<pubDate><![CDATA[2025-01-12T11:33:57+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/01/11/gfg-ptod-11-jan-2025-longest-substring-with-distinct-characters/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/01/11/gfg-ptod-11-jan-2025-longest-substring-with-distinct-characters/ds-algo/]]></link>
			<title>GFG PTOD | 11 Jan 2025 | Longest substring with distinct characters</title>
			<pubDate><![CDATA[2025-01-11T05:00:41+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/01/10/gfg-ptod-10-jan-2025-count-distinct-elements-in-every-window/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/01/10/gfg-ptod-10-jan-2025-count-distinct-elements-in-every-window/ds-algo/]]></link>
			<title>GFG PTOD | 10 Jan 2025 | Count distinct elements in every window</title>
			<pubDate><![CDATA[2025-01-10T07:16:52+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/01/09/gfg-ptod-09-jan-2025-indexes-of-subarray-sum/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/01/09/gfg-ptod-09-jan-2025-indexes-of-subarray-sum/ds-algo/]]></link>
			<title>GFG PTOD | 09 Jan 2025 | Indexes of Subarray Sum</title>
			<pubDate><![CDATA[2025-01-09T11:21:40+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/01/08/gfg-ptod-07-jan-2025-count-the-number-of-possible-triangles/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/01/08/gfg-ptod-07-jan-2025-count-the-number-of-possible-triangles/ds-algo/]]></link>
			<title>GFG PTOD | 08 Jan 2025 | Count the number of possible triangles</title>
			<pubDate><![CDATA[2025-01-08T14:21:39+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/01/07/gfg-ptod-07-jan-2025-pair-with-given-sum-in-a-sorted-array/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/01/07/gfg-ptod-07-jan-2025-pair-with-given-sum-in-a-sorted-array/ds-algo/]]></link>
			<title>GFG PTOD | 07 Jan 2025 | Pair with given sum in a sorted array</title>
			<pubDate><![CDATA[2025-01-07T11:29:37+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/01/06/gfg-ptod-06-jan-2025-sum-pair-closest-to-target/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/01/06/gfg-ptod-06-jan-2025-sum-pair-closest-to-target/ds-algo/]]></link>
			<title>GFG PTOD | 06 Jan 2025 | Sum Pair closest to target</title>
			<pubDate><![CDATA[2025-01-06T09:14:12+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/01/05/gfg-ptod-05-jan-2025-count-pairs-whose-sum-is-less-than-target/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/01/05/gfg-ptod-05-jan-2025-count-pairs-whose-sum-is-less-than-target/ds-algo/]]></link>
			<title>GFG PTOD | 05 Jan 2025 | Count Pairs whose sum is less than target</title>
			<pubDate><![CDATA[2025-01-05T11:21:49+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/01/04/gfg-ptod-04-jan-2025-count-all-triplets-with-given-sum-in-sorted-array/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/01/04/gfg-ptod-04-jan-2025-count-all-triplets-with-given-sum-in-sorted-array/ds-algo/]]></link>
			<title>GFG PTOD | 04 Jan 2025 | Count all triplets with given sum in sorted array</title>
			<pubDate><![CDATA[2025-01-04T10:19:29+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/01/03/gfg-ptod-03-jan-2025-count-subarrays-with-given-xor/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/01/03/gfg-ptod-03-jan-2025-count-subarrays-with-given-xor/ds-algo/]]></link>
			<title>GFG PTOD | 03 Jan 2025 | Count Subarrays with given XOR</title>
			<pubDate><![CDATA[2025-01-03T09:26:17+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/01/02/gfg-ptod-02-jan-2025-subarrays-with-sum-k/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/01/02/gfg-ptod-02-jan-2025-subarrays-with-sum-k/ds-algo/]]></link>
			<title>GFG PTOD | 02 Jan 2025 | Subarrays with sum K</title>
			<pubDate><![CDATA[2025-01-02T10:02:45+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2025/01/01/gfg-ptod-01-jan-2025-problem-solved-successfully/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2025/01/01/gfg-ptod-01-jan-2025-problem-solved-successfully/ds-algo/]]></link>
			<title>GFG PTOD | 01 Jan 2025 | Problem Solved Successfully</title>
			<pubDate><![CDATA[2025-01-01T16:57:14+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2024/12/31/gfg-ptod-31-dec-longest-consecutive-subsequence/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2024/12/31/gfg-ptod-31-dec-longest-consecutive-subsequence/ds-algo/]]></link>
			<title>GFG  PTOD | 31 Dec | Longest Consecutive Subsequence</title>
			<pubDate><![CDATA[2024-12-31T11:09:30+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2024/12/30/gfg-ptod-30-dec-union-of-arrays-with-duplicates/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2024/12/30/gfg-ptod-30-dec-union-of-arrays-with-duplicates/ds-algo/]]></link>
			<title>GFG PTOD | 30 Dec | Union of Arrays with Duplicates</title>
			<pubDate><![CDATA[2024-12-31T05:52:17+00:00]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://thecodepathshala.in/2024/12/29/gfg-ptod-29-dec-intersection-of-two-arrays-with-duplicate-elements/ds-algo/]]></guid>
			<link><![CDATA[https://thecodepathshala.in/2024/12/29/gfg-ptod-29-dec-intersection-of-two-arrays-with-duplicate-elements/ds-algo/]]></link>
			<title>GFG PTOD | 29 DEC | Intersection of Two arrays with Duplicate Elements</title>
			<pubDate><![CDATA[2024-12-29T04:43:52+00:00]]></pubDate>
		</item>
				</channel>
</rss>
