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

<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
	<channel>
		<title>GoodTecher</title>
		<link><![CDATA[https://www.goodtecher.com]]></link>
		<description><![CDATA[GoodTecher]]></description>
		<lastBuildDate><![CDATA[Thu, 25 Nov 2021 17:15:03 +0000]]></lastBuildDate>
		<docs>https://validator.w3.org/feed/docs/rss2.html</docs>
		<atom:link href="https://www.goodtecher.com/sitemap.rss" rel="self" type="application/rss+xml" />
		<ttl><![CDATA[60]]></ttl>

		<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-351-android-unlock-patterns/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-351-android-unlock-patterns/]]></link>
			<title>LeetCode 351. Android Unlock Patterns</title>
			<pubDate><![CDATA[Thu, 25 Nov 2021 17:15:03 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-1110-delete-nodes-and-return-forest/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-1110-delete-nodes-and-return-forest/]]></link>
			<title>LeetCode 1110. Delete Nodes And Return Forest</title>
			<pubDate><![CDATA[Sun, 28 Nov 2021 18:16:06 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-1095-find-in-mountain-array/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-1095-find-in-mountain-array/]]></link>
			<title>LeetCode 1095. Find in Mountain Array</title>
			<pubDate><![CDATA[Sun, 28 Nov 2021 18:10:28 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-1057-campus-bikes/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-1057-campus-bikes/]]></link>
			<title>LeetCode 1057. Campus Bikes</title>
			<pubDate><![CDATA[Sun, 21 Nov 2021 01:16:15 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-1059-all-paths-from-source-lead-to-destination/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-1059-all-paths-from-source-lead-to-destination/]]></link>
			<title>LeetCode 1059. All Paths from Source Lead to Destination</title>
			<pubDate><![CDATA[Sat, 20 Nov 2021 23:27:34 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-359-logger-rate-limiter/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-359-logger-rate-limiter/]]></link>
			<title>LeetCode 359. Logger Rate Limiter</title>
			<pubDate><![CDATA[Sat, 20 Nov 2021 23:22:30 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-1631-path-with-minimum-effort/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-1631-path-with-minimum-effort/]]></link>
			<title>LeetCode 1631. Path With Minimum Effort</title>
			<pubDate><![CDATA[Mon, 15 Nov 2021 23:40:14 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-475-heaters/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-475-heaters/]]></link>
			<title>LeetCode 475. Heaters</title>
			<pubDate><![CDATA[Tue, 09 Nov 2021 14:26:51 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-1197-minimum-knight-moves/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-1197-minimum-knight-moves/]]></link>
			<title>LeetCode 1197. Minimum Knight Moves</title>
			<pubDate><![CDATA[Tue, 26 Oct 2021 13:28:43 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-300-longest-increasing-subsequence/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-300-longest-increasing-subsequence/]]></link>
			<title>LeetCode 300. Longest Increasing Subsequence</title>
			<pubDate><![CDATA[Sat, 06 Nov 2021 12:35:58 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-216-combination-sum-iii/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-216-combination-sum-iii/]]></link>
			<title>LeetCode 216. Combination Sum III</title>
			<pubDate><![CDATA[Tue, 02 Nov 2021 13:58:52 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-236-lowest-common-ancestor-of-a-binary-tree/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-236-lowest-common-ancestor-of-a-binary-tree/]]></link>
			<title>LeetCode 236. Lowest Common Ancestor of a Binary Tree</title>
			<pubDate><![CDATA[Thu, 28 Oct 2021 11:56:33 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-17-letter-combinations-of-a-phone-number/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-17-letter-combinations-of-a-phone-number/]]></link>
			<title>LeetCode 17. Letter Combinations of a Phone Number</title>
			<pubDate><![CDATA[Sat, 30 Oct 2021 12:19:08 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-380-insert-delete-getrandom-o1/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-380-insert-delete-getrandom-o1/]]></link>
			<title>LeetCode 380. Insert Delete GetRandom O(1)</title>
			<pubDate><![CDATA[Mon, 01 Nov 2021 12:26:29 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-264-ugly-number-ii/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-264-ugly-number-ii/]]></link>
			<title>LeetCode 264. Ugly Number II</title>
			<pubDate><![CDATA[Mon, 01 Nov 2021 12:22:33 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-272-closest-binary-search-tree-value-ii/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-272-closest-binary-search-tree-value-ii/]]></link>
			<title>LeetCode 272. Closest Binary Search Tree Value II</title>
			<pubDate><![CDATA[Fri, 29 Oct 2021 12:03:01 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-120-triangle/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-120-triangle/]]></link>
			<title>LeetCode 120. Triangle</title>
			<pubDate><![CDATA[Fri, 05 Nov 2021 12:31:48 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-75-sort-colors/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-75-sort-colors/]]></link>
			<title>LeetCode 75. Sort Colors</title>
			<pubDate><![CDATA[Wed, 20 Oct 2021 13:09:11 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-444-sequence-reconstruction/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-444-sequence-reconstruction/]]></link>
			<title>LeetCode 444. Sequence Reconstruction</title>
			<pubDate><![CDATA[Mon, 25 Oct 2021 18:29:41 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-702-search-in-a-sorted-array-of-unknown-size/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-702-search-in-a-sorted-array-of-unknown-size/]]></link>
			<title>LeetCode 702. Search in a Sorted Array of Unknown Size</title>
			<pubDate><![CDATA[Thu, 21 Oct 2021 14:51:58 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-253-meeting-rooms-ii/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-253-meeting-rooms-ii/]]></link>
			<title>LeetCode 253. Meeting Rooms II</title>
			<pubDate><![CDATA[Mon, 18 Oct 2021 20:37:27 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-133-clone-graph/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-133-clone-graph/]]></link>
			<title>LeetCode 133. Clone Graph</title>
			<pubDate><![CDATA[Wed, 13 Oct 2021 15:09:30 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-3-longest-substring-without-repeating-characters/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-3-longest-substring-without-repeating-characters/]]></link>
			<title>LeetCode 3. Longest Substring Without Repeating Characters</title>
			<pubDate><![CDATA[Wed, 06 Oct 2021 01:33:42 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-1293-shortest-path-in-a-grid-with-obstacles-elimination/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-1293-shortest-path-in-a-grid-with-obstacles-elimination/]]></link>
			<title>LeetCode 1293. Shortest Path in a Grid with Obstacles Elimination</title>
			<pubDate><![CDATA[Tue, 30 Nov 2021 00:03:44 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-209-minimum-size-subarray-sum/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-209-minimum-size-subarray-sum/]]></link>
			<title>LeetCode 209. Minimum Size Subarray Sum</title>
			<pubDate><![CDATA[Thu, 07 Oct 2021 01:07:19 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-159-longest-substring-with-at-most-two-distinct-characters/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-159-longest-substring-with-at-most-two-distinct-characters/]]></link>
			<title>LeetCode 159. Longest Substring with At Most Two Distinct Characters</title>
			<pubDate><![CDATA[Sat, 09 Oct 2021 03:11:24 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-340-longest-substring-with-at-most-k-distinct-characters/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-340-longest-substring-with-at-most-k-distinct-characters/]]></link>
			<title>LeetCode 340. Longest Substring with At Most K Distinct Characters</title>
			<pubDate><![CDATA[Fri, 08 Oct 2021 01:53:37 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-242-valid-anagram/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-242-valid-anagram/]]></link>
			<title>LeetCode 242. Valid Anagram</title>
			<pubDate><![CDATA[Wed, 22 Sep 2021 19:49:36 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-76-minimum-window-substring/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-76-minimum-window-substring/]]></link>
			<title>LeetCode 76. Minimum Window Substring</title>
			<pubDate><![CDATA[Sat, 02 Oct 2021 00:55:32 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-1146-snapshot-array/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-1146-snapshot-array/]]></link>
			<title>LeetCode 1146. Snapshot Array</title>
			<pubDate><![CDATA[Tue, 28 Sep 2021 15:12:08 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-279-perfect-squares/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-279-perfect-squares/]]></link>
			<title>LeetCode 279. Perfect Squares</title>
			<pubDate><![CDATA[Tue, 28 Sep 2021 14:45:59 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-261-graph-valid-tree/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-261-graph-valid-tree/]]></link>
			<title>LeetCode 261. Graph Valid Tree</title>
			<pubDate><![CDATA[Thu, 14 Oct 2021 16:47:02 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/get-well-prepared-for-google-interview/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/get-well-prepared-for-google-interview/]]></link>
			<title>Get Well Prepared for Google Interview</title>
			<pubDate><![CDATA[Sun, 26 Sep 2021 20:35:24 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-222-count-complete-tree-nodes/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-222-count-complete-tree-nodes/]]></link>
			<title>LeetCode 222. Count Complete Tree Nodes</title>
			<pubDate><![CDATA[Sun, 26 Sep 2021 20:34:19 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-410-split-array-largest-sum/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-410-split-array-largest-sum/]]></link>
			<title>LeetCode 410. Split Array Largest Sum</title>
			<pubDate><![CDATA[Sun, 26 Sep 2021 19:32:57 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-1182-shortest-distance-to-target-color/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-1182-shortest-distance-to-target-color/]]></link>
			<title>LeetCode 1182. Shortest Distance to Target Color</title>
			<pubDate><![CDATA[Sun, 26 Sep 2021 15:40:58 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-1138-alphabet-board-path/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-1138-alphabet-board-path/]]></link>
			<title>LeetCode 1138. Alphabet Board Path</title>
			<pubDate><![CDATA[Sun, 26 Sep 2021 15:21:28 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-489-robot-room-cleaner/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-489-robot-room-cleaner/]]></link>
			<title>LeetCode 489. Robot Room Cleaner</title>
			<pubDate><![CDATA[Sat, 25 Sep 2021 20:35:36 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-1047-remove-all-adjacent-duplicates-in-string/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-1047-remove-all-adjacent-duplicates-in-string/]]></link>
			<title>LeetCode 1047. Remove All Adjacent Duplicates In String</title>
			<pubDate><![CDATA[Mon, 27 Sep 2021 19:44:06 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-96-unique-binary-search-trees/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-96-unique-binary-search-trees/]]></link>
			<title>LeetCode 96. Unique Binary Search Trees</title>
			<pubDate><![CDATA[Thu, 23 Sep 2021 18:43:59 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-2012-sum-of-beauty-in-the-array/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-2012-sum-of-beauty-in-the-array/]]></link>
			<title>LeetCode 2012. Sum of Beauty in the Array</title>
			<pubDate><![CDATA[Sat, 25 Sep 2021 18:56:02 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-2011-final-value-of-variable-after-performing-operations/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-2011-final-value-of-variable-after-performing-operations/]]></link>
			<title>LeetCode 2011. Final Value of Variable After Performing Operations</title>
			<pubDate><![CDATA[Sat, 25 Sep 2021 18:28:53 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-1087-brace-expansion/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-1087-brace-expansion/]]></link>
			<title>LeetCode 1087. Brace Expansion</title>
			<pubDate><![CDATA[Mon, 27 Sep 2021 21:00:11 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-652-find-duplicate-subtrees/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-652-find-duplicate-subtrees/]]></link>
			<title>LeetCode 652. Find Duplicate Subtrees</title>
			<pubDate><![CDATA[Thu, 23 Sep 2021 18:12:29 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-833-find-and-replace-in-string/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-833-find-and-replace-in-string/]]></link>
			<title>LeetCode 833. Find And Replace in String</title>
			<pubDate><![CDATA[Thu, 23 Sep 2021 00:07:48 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-844-backspace-string-compare/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-844-backspace-string-compare/]]></link>
			<title>LeetCode 844. Backspace String Compare</title>
			<pubDate><![CDATA[Wed, 22 Sep 2021 16:22:18 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-204-count-primes/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-204-count-primes/]]></link>
			<title>LeetCode 204. Count Primes</title>
			<pubDate><![CDATA[Tue, 14 Dec 2021 17:01:03 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-482-license-key-formatting/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-482-license-key-formatting/]]></link>
			<title>LeetCode 482. License Key Formatting</title>
			<pubDate><![CDATA[Wed, 22 Sep 2021 14:13:12 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-857-minimum-cost-to-hire-k-workers/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-857-minimum-cost-to-hire-k-workers/]]></link>
			<title>LeetCode 857. Minimum Cost to Hire K Workers</title>
			<pubDate><![CDATA[Mon, 20 Sep 2021 15:32:28 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://www.goodtecher.com/leetcode-904-fruit-into-baskets/]]></guid>
			<link><![CDATA[https://www.goodtecher.com/leetcode-904-fruit-into-baskets/]]></link>
			<title>LeetCode 904. Fruit Into Baskets</title>
			<pubDate><![CDATA[Mon, 11 Oct 2021 13:23:42 +0000]]></pubDate>
		</item>
				</channel>
</rss>
