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

<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
	<channel>
		<title>Mikhail Shcherbakov</title>
		<link><![CDATA[https://mikescherbakov.com]]></link>
		<description><![CDATA[Mikhail Shcherbakov]]></description>
		<lastBuildDate><![CDATA[Tue, 31 Oct 2023 05:14:26 +0000]]></lastBuildDate>
		<docs>https://validator.w3.org/feed/docs/rss2.html</docs>
		<atom:link href="https://mikescherbakov.com/sitemap.rss" rel="self" type="application/rss+xml" />
		<ttl><![CDATA[60]]></ttl>

		<item>
			<guid><![CDATA[https://mikescherbakov.com/bfs-iterative-and-recursive-in-tree/]]></guid>
			<link><![CDATA[https://mikescherbakov.com/bfs-iterative-and-recursive-in-tree/]]></link>
			<title>BFS (iterative and recursive) in Tree</title>
			<pubDate><![CDATA[Tue, 31 Oct 2023 05:14:26 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://mikescherbakov.com/]]></guid>
			<link><![CDATA[https://mikescherbakov.com/]]></link>
			<title>Lead Java/Kotlin Developer | AWS &#038; Kafka Certified | 12+ Years</title>
			<pubDate><![CDATA[Tue, 31 Mar 2026 09:21:03 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://mikescherbakov.com/binary-search-algorithm/]]></guid>
			<link><![CDATA[https://mikescherbakov.com/binary-search-algorithm/]]></link>
			<title>Binary search algorithm</title>
			<pubDate><![CDATA[Wed, 01 Nov 2023 04:43:49 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://mikescherbakov.com/bfs-in-graphs/]]></guid>
			<link><![CDATA[https://mikescherbakov.com/bfs-in-graphs/]]></link>
			<title>BFS in Graphs</title>
			<pubDate><![CDATA[Tue, 31 Oct 2023 08:24:02 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://mikescherbakov.com/dfs-in-graphs/]]></guid>
			<link><![CDATA[https://mikescherbakov.com/dfs-in-graphs/]]></link>
			<title>DFS in Graphs</title>
			<pubDate><![CDATA[Tue, 31 Oct 2023 07:27:44 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://mikescherbakov.com/dfs-in-tree-pre-order-in-order-post-order/]]></guid>
			<link><![CDATA[https://mikescherbakov.com/dfs-in-tree-pre-order-in-order-post-order/]]></link>
			<title>DFS in Tree (Pre-order, In-order, Post-order)</title>
			<pubDate><![CDATA[Tue, 31 Oct 2023 05:10:16 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://mikescherbakov.com/courses-and-certificates/]]></guid>
			<link><![CDATA[https://mikescherbakov.com/courses-and-certificates/]]></link>
			<title>Courses and certificates</title>
			<pubDate><![CDATA[Tue, 31 Mar 2026 09:56:29 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://mikescherbakov.com/lld-interview-structure/]]></guid>
			<link><![CDATA[https://mikescherbakov.com/lld-interview-structure/]]></link>
			<title>Low Level Design Interview Structure</title>
			<pubDate><![CDATA[Tue, 09 Jul 2024 06:41:39 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://mikescherbakov.com/implement-a-hashtable/]]></guid>
			<link><![CDATA[https://mikescherbakov.com/implement-a-hashtable/]]></link>
			<title>Implement a HashTable</title>
			<pubDate><![CDATA[Sun, 29 Oct 2023 14:09:35 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://mikescherbakov.com/integer-to-english-words-task-solution-leetcode/]]></guid>
			<link><![CDATA[https://mikescherbakov.com/integer-to-english-words-task-solution-leetcode/]]></link>
			<title>Integer to English Words &#8211; task solution (LeetCode)</title>
			<pubDate><![CDATA[Sun, 05 Nov 2023 15:56:12 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://mikescherbakov.com/integer-to-roman-task-solution-leetcode/]]></guid>
			<link><![CDATA[https://mikescherbakov.com/integer-to-roman-task-solution-leetcode/]]></link>
			<title>Integer to Roman &#8211; task solution (LeetCode)</title>
			<pubDate><![CDATA[Sun, 05 Nov 2023 15:31:55 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://mikescherbakov.com/bellman-ford-algorithm/]]></guid>
			<link><![CDATA[https://mikescherbakov.com/bellman-ford-algorithm/]]></link>
			<title>Bellman-Ford algorithm</title>
			<pubDate><![CDATA[Sun, 05 Nov 2023 05:16:43 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://mikescherbakov.com/elevator-system-low-level-design/]]></guid>
			<link><![CDATA[https://mikescherbakov.com/elevator-system-low-level-design/]]></link>
			<title>Elevator System Low Level Design</title>
			<pubDate><![CDATA[Sat, 27 Jul 2024 06:18:29 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://mikescherbakov.com/dijkstra-algorithm/]]></guid>
			<link><![CDATA[https://mikescherbakov.com/dijkstra-algorithm/]]></link>
			<title>Dijkstra algorithm</title>
			<pubDate><![CDATA[Sat, 04 Nov 2023 06:35:29 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://mikescherbakov.com/counting-sort/]]></guid>
			<link><![CDATA[https://mikescherbakov.com/counting-sort/]]></link>
			<title>Counting sort</title>
			<pubDate><![CDATA[Sat, 04 Nov 2023 05:07:48 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://mikescherbakov.com/quick-sort/]]></guid>
			<link><![CDATA[https://mikescherbakov.com/quick-sort/]]></link>
			<title>Quick sort</title>
			<pubDate><![CDATA[Sat, 04 Nov 2023 04:51:44 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://mikescherbakov.com/bubble-sort/]]></guid>
			<link><![CDATA[https://mikescherbakov.com/bubble-sort/]]></link>
			<title>Bubble sort</title>
			<pubDate><![CDATA[Fri, 03 Nov 2023 06:56:41 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://mikescherbakov.com/implement-a-stack/]]></guid>
			<link><![CDATA[https://mikescherbakov.com/implement-a-stack/]]></link>
			<title>Implement a Stack</title>
			<pubDate><![CDATA[Mon, 30 Oct 2023 15:57:30 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://mikescherbakov.com/implement-a-binary-tree/]]></guid>
			<link><![CDATA[https://mikescherbakov.com/implement-a-binary-tree/]]></link>
			<title>Implement a Binary Tree</title>
			<pubDate><![CDATA[Mon, 30 Oct 2023 15:47:32 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://mikescherbakov.com/merge-sort/]]></guid>
			<link><![CDATA[https://mikescherbakov.com/merge-sort/]]></link>
			<title>Merge sort</title>
			<pubDate><![CDATA[Fri, 03 Nov 2023 16:10:11 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://mikescherbakov.com/implement-a-queue/]]></guid>
			<link><![CDATA[https://mikescherbakov.com/implement-a-queue/]]></link>
			<title>Implement a Queue</title>
			<pubDate><![CDATA[Mon, 30 Oct 2023 05:50:19 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://mikescherbakov.com/implement-a-linkedlist/]]></guid>
			<link><![CDATA[https://mikescherbakov.com/implement-a-linkedlist/]]></link>
			<title>Implement a LinkedList</title>
			<pubDate><![CDATA[Mon, 30 Oct 2023 04:47:36 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://mikescherbakov.com/insertion-sort/]]></guid>
			<link><![CDATA[https://mikescherbakov.com/insertion-sort/]]></link>
			<title>Insertion sort</title>
			<pubDate><![CDATA[Fri, 03 Nov 2023 07:23:01 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://mikescherbakov.com/knowledge-map/]]></guid>
			<link><![CDATA[https://mikescherbakov.com/knowledge-map/]]></link>
			<title>Knowledge Map</title>
			<pubDate><![CDATA[Sun, 29 Oct 2023 12:57:08 +0000]]></pubDate>
		</item>
					<item>
			<guid><![CDATA[https://mikescherbakov.com/selection-sort/]]></guid>
			<link><![CDATA[https://mikescherbakov.com/selection-sort/]]></link>
			<title>Selection sort</title>
			<pubDate><![CDATA[Fri, 03 Nov 2023 07:01:59 +0000]]></pubDate>
		</item>
				</channel>
</rss>
