<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="//freeonlineteq.com/main-sitemap.xsl"?>
<urlset xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:image="http://www.google.com/schemas/sitemap-image/1.1" xsi:schemaLocation="http://www.sitemaps.org/schemas/sitemap/0.9 http://www.sitemaps.org/schemas/sitemap/0.9/sitemap.xsd http://www.google.com/schemas/sitemap-image/1.1 http://www.google.com/schemas/sitemap-image/1.1/sitemap-image.xsd" xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/big-o-rule-1-2/</loc>
		<lastmod>2025-10-21T14:37:14+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/simplifying-big-o-2/</loc>
		<lastmod>2025-10-21T14:36:36+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/solution-big-o-calculation-2-2/</loc>
		<lastmod>2025-10-21T14:35:47+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/exercise-big-o-calculation-2-2/</loc>
		<lastmod>2025-10-21T14:35:03+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/solution-big-o-calculation-3/</loc>
		<lastmod>2025-10-21T14:34:22+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/exercise-big-o-calculation-3/</loc>
		<lastmod>2025-10-21T14:33:51+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/o1-2/</loc>
		<lastmod>2025-10-21T14:32:55+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/on-3/</loc>
		<lastmod>2025-10-21T14:32:26+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/big-o-and-scalability-2/</loc>
		<lastmod>2025-10-21T14:31:40+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/what-is-good-code-2/</loc>
		<lastmod>2025-10-21T14:31:21+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/section-overview-57/</loc>
		<lastmod>2025-10-21T14:30:53+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-challenges-4/</loc>
		<lastmod>2025-10-21T14:20:23+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/become-an-alumni-8/</loc>
		<lastmod>2025-10-21T14:19:27+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/linkedin-endorsements-3/</loc>
		<lastmod>2025-10-21T14:18:50+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/learning-guideline-8/</loc>
		<lastmod>2025-10-21T14:18:19+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/thank-you-16/</loc>
		<lastmod>2025-10-21T14:17:33+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/implementing-our-prefix-trie-data-structure-solution/</loc>
		<lastmod>2025-10-21T14:15:35+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/understanding-the-logic-for-our-methods/</loc>
		<lastmod>2025-10-21T14:14:43+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/question-30-implement-prefix-trie/</loc>
		<lastmod>2025-10-21T14:14:01+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/introducing-tries/</loc>
		<lastmod>2025-10-21T14:13:41+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-our-monarchy-solution/</loc>
		<lastmod>2025-10-21T14:11:27+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/thinking-about-the-logical-of-the-monarchy/</loc>
		<lastmod>2025-10-21T14:10:42+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/figuring-out-our-test-cases-2/</loc>
		<lastmod>2025-10-21T14:09:59+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/understanding-interface-design-question-29-monarchy/</loc>
		<lastmod>2025-10-21T14:09:36+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/thinking-about-the-space-and-time-complexity/</loc>
		<lastmod>2025-10-21T13:56:51+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-the-recursive-backtracking-portion-of-our-solution/</loc>
		<lastmod>2025-10-21T13:55:59+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/setting-up-our-solution-code/</loc>
		<lastmod>2025-10-21T13:55:21+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-how-to-get-box-id/</loc>
		<lastmod>2025-10-21T13:54:55+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/applying-our-backtracking-template-to-sudoku-solver-logic/</loc>
		<lastmod>2025-10-21T13:54:25+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/learning-the-backtracking-template/</loc>
		<lastmod>2025-10-21T13:53:54+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/question-28-sudoku-solver/</loc>
		<lastmod>2025-10-21T13:52:24+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/understanding-the-basics-of-backtracking/</loc>
		<lastmod>2025-10-21T13:51:52+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/dynamic-programming-list/</loc>
		<lastmod>2025-10-21T00:12:38+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/fourth-step-bottom-up-optimization-2/</loc>
		<lastmod>2025-10-21T00:12:05+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/third-step-bottom-up-tabulation-2/</loc>
		<lastmod>2025-10-21T00:11:42+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/figuring-out-the-logic-for-our-bottom-up-solution/</loc>
		<lastmod>2025-10-21T00:08:27+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/second-step-memoizing-our-redundant-recursive-calls-2/</loc>
		<lastmod>2025-10-21T00:08:06+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/first-step-recursive-solution-from-recurrence-relation-2/</loc>
		<lastmod>2025-10-21T00:07:15+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/identifying-the-recurrence-relation/</loc>
		<lastmod>2025-10-21T00:06:49+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/thinking-about-test-cases-to-help-us/</loc>
		<lastmod>2025-10-21T00:06:31+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/question-27-knight-probability-in-chessboard/</loc>
		<lastmod>2025-10-21T00:05:53+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/fourth-step-bottom-up-optimization/</loc>
		<lastmod>2025-10-21T00:03:13+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/third-step-bottom-up-tabulation/</loc>
		<lastmod>2025-10-20T23:23:13+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/understanding-the-bottom-up-approach-tabulation/</loc>
		<lastmod>2025-10-20T23:22:39+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-our-memoization-optimization/</loc>
		<lastmod>2025-10-20T23:22:12+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/second-step-memoizing-our-redundant-recursive-calls/</loc>
		<lastmod>2025-10-20T23:21:18+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/note-correction-to-space-complexity/</loc>
		<lastmod>2025-10-20T23:20:50+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/first-step-recursive-solution-from-recurrence-relation/</loc>
		<lastmod>2025-10-20T23:20:10+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/understanding-identifying-recurrence-relation/</loc>
		<lastmod>2025-10-20T23:19:33+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/question-26-minimum-cost-of-climbing-stairs-how-to-approach-dp/</loc>
		<lastmod>2025-10-20T23:18:59+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-our-solution-with-dijkstra/</loc>
		<lastmod>2025-10-20T23:04:48+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-our-solution-with-bellman-ford/</loc>
		<lastmod>2025-10-20T22:54:42+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/what-is-the-bellman-ford-algorithm-the-algorithm-itself/</loc>
		<lastmod>2025-10-20T22:53:53+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/what-is-the-bellman-ford-algorithm-conceptualizing-dynamic-programming/</loc>
		<lastmod>2025-10-20T22:53:21+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/thinking-about-negative-weights/</loc>
		<lastmod>2025-10-20T22:52:41+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/time-and-space-complexity-of-our-solution/</loc>
		<lastmod>2025-10-20T22:52:13+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/thinking-about-a-solution-with-dijkstras-algorithm/</loc>
		<lastmod>2025-10-20T22:51:41+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/greedy-method-what-is-dijkstras-algorithm/</loc>
		<lastmod>2025-10-20T22:51:20+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/thinking-about-how-to-approach-the-problem/</loc>
		<lastmod>2025-10-20T22:50:55+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/question-25-network-time-delay/</loc>
		<lastmod>2025-10-20T22:50:29+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-our-final-solution/</loc>
		<lastmod>2025-10-20T22:45:11+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/thinking-about-a-solution-with-topological-sort/</loc>
		<lastmod>2025-10-20T22:44:20+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/what-is-topological-sort/</loc>
		<lastmod>2025-10-20T22:43:41+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-out-our-initial-bfs-solution/</loc>
		<lastmod>2025-10-20T22:43:16+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/thinking-about-our-initial-solution-bfs/</loc>
		<lastmod>2025-10-20T22:42:44+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/question-24-course-scheduler/</loc>
		<lastmod>2025-10-20T22:42:18+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-our-dfs-solution/</loc>
		<lastmod>2025-10-20T22:38:51+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/solving-our-problem-logically-using-dfs-traversal/</loc>
		<lastmod>2025-10-20T22:36:57+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/how-to-represent-our-graph-as-an-adjacency-list/</loc>
		<lastmod>2025-10-20T22:36:26+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/verifying-our-constraints-and-thinking-about-test-cases/</loc>
		<lastmod>2025-10-20T22:35:56+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/question-23-time-needed-to-inform-all-employees/</loc>
		<lastmod>2025-10-20T22:35:16+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-dfs/</loc>
		<lastmod>2025-10-20T22:30:16+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/depth-first-search-in-graphs/</loc>
		<lastmod>2025-10-20T22:29:27+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-bfs-2/</loc>
		<lastmod>2025-10-20T22:28:57+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/breadth-first-search-in-graphs/</loc>
		<lastmod>2025-10-20T22:28:36+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/representing-our-graphs-adjacency-list-adjacency-matrix/</loc>
		<lastmod>2025-10-20T22:28:06+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/introduction-to-the-types-of-graphs/</loc>
		<lastmod>2025-10-20T22:27:42+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-out-our-solution-3/</loc>
		<lastmod>2025-10-20T22:22:38+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/figuring-out-our-logical-solution/</loc>
		<lastmod>2025-10-20T22:21:50+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/question-22-walls-and-gates/</loc>
		<lastmod>2025-10-20T22:21:29+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-out-our-solution-2/</loc>
		<lastmod>2025-10-20T22:09:21+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/figuring-out-the-rest-of-our-solution/</loc>
		<lastmod>2025-10-20T22:08:01+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/figuring-out-our-initial-logic/</loc>
		<lastmod>2025-10-20T22:07:26+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/question-21-rotting-oranges/</loc>
		<lastmod>2025-10-20T22:06:09+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/thinking-about-space-and-time-complexity/</loc>
		<lastmod>2025-10-20T22:02:49+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-our-solution-7/</loc>
		<lastmod>2025-10-20T22:00:47+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/approaching-our-problem-thinking-about-traversals/</loc>
		<lastmod>2025-10-20T22:00:28+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/approaching-our-problem-thinking-deeply-about-the-values/</loc>
		<lastmod>2025-10-20T21:59:56+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/question-20-number-of-islands/</loc>
		<lastmod>2025-10-20T21:59:30+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/a-general-approach-to-thinking-about-most-graph-questions/</loc>
		<lastmod>2025-10-20T21:58:18+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-bfs/</loc>
		<lastmod>2025-10-20T21:54:21+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/breadth-first-search-in-2d-arrays/</loc>
		<lastmod>2025-10-20T21:53:41+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-dfs-implementing-recursive-dfs/</loc>
		<lastmod>2025-10-20T21:53:03+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-dfs-setting-up-for-dfs/</loc>
		<lastmod>2025-10-20T21:52:38+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/depth-first-search-in-2d-arrays/</loc>
		<lastmod>2025-10-20T21:51:48+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/introducing-2d-arrays-what-are-they/</loc>
		<lastmod>2025-10-20T21:48:12+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-our-deletion-and-sift-down-methods/</loc>
		<lastmod>2025-10-20T21:05:05+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-our-insertion-and-sift-up-methods/</loc>
		<lastmod>2025-10-20T21:04:19+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/starting-to-code-our-priority-queue-class/</loc>
		<lastmod>2025-10-20T21:03:52+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/deletion-in-heaps-understanding-sift-down/</loc>
		<lastmod>2025-10-20T21:03:23+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/insertion-in-heaps-understanding-sift-up/</loc>
		<lastmod>2025-10-20T21:02:31+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/introducing-heaps/</loc>
		<lastmod>2025-10-20T21:01:49+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-our-our-full-solution/</loc>
		<lastmod>2025-10-20T20:57:27+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/figuring-out-our-boundaries/</loc>
		<lastmod>2025-10-20T20:56:54+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/thinking-about-our-logical-solution/</loc>
		<lastmod>2025-10-20T20:56:17+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/question-19-validate-binary-search-tree/</loc>
		<lastmod>2025-10-20T20:55:48+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-out-our-full-solution/</loc>
		<lastmod>2025-10-20T20:40:47+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/figuring-out-number-of-nodes-at-last-level/</loc>
		<lastmod>2025-10-20T20:18:33+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/thinking-deeply-about-a-full-binary-tree/</loc>
		<lastmod>2025-10-20T20:15:56+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/question-18-number-of-nodes-in-complete-tree/</loc>
		<lastmod>2025-10-20T20:15:34+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-our-final-dfs-solution/</loc>
		<lastmod>2025-10-20T19:28:59+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/completing-our-dfs-solution/</loc>
		<lastmod>2025-10-20T19:27:45+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/thinking-about-pre-order-in-order-and-post-order-traversals-for-our-solution/</loc>
		<lastmod>2025-10-20T19:26:48+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/understanding-the-depth-first-search-approach/</loc>
		<lastmod>2025-10-20T19:25:55+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/understanding-the-breadth-first-search-approach/</loc>
		<lastmod>2025-10-20T19:24:55+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/question-17-right-side-view-of-tree/</loc>
		<lastmod>2025-10-20T19:24:31+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-out-level-order-traversal/</loc>
		<lastmod>2025-10-20T19:18:32+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/walking-through-our-solution-2/</loc>
		<lastmod>2025-10-20T19:17:35+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/question-16-level-order-of-binary-tree/</loc>
		<lastmod>2025-10-20T19:17:09+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-our-solution-6/</loc>
		<lastmod>2025-10-20T19:13:12+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/learning-the-process-for-solving-binary-tree-problems/</loc>
		<lastmod>2025-10-20T19:11:28+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/question-15-maximum-depth-of-binary-tree/</loc>
		<lastmod>2025-10-20T19:10:34+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/intro-to-binary-trees-2/</loc>
		<lastmod>2025-10-20T19:09:41+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-our-solution-5/</loc>
		<lastmod>2025-10-20T19:03:54+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/walking-through-our-solution/</loc>
		<lastmod>2025-10-20T19:02:38+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/question-14-start-and-end-of-target-in-a-sorted-array/</loc>
		<lastmod>2025-10-20T19:02:09+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/how-to-code-binary-search/</loc>
		<lastmod>2025-10-20T19:01:38+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/understanding-binary-search/</loc>
		<lastmod>2025-10-20T19:00:10+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/exercise-imposter-syndrome-7/</loc>
		<lastmod>2025-10-20T18:54:45+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/correction-about-time-complexity/</loc>
		<lastmod>2025-10-20T18:53:36+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-our-solution-with-quickselect/</loc>
		<lastmod>2025-10-20T18:52:52+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/what-is-hoares-quickselect-algorithm/</loc>
		<lastmod>2025-10-20T18:51:58+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-quicksort-into-our-solution/</loc>
		<lastmod>2025-10-20T18:51:25+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/understanding-divide-and-conquer/</loc>
		<lastmod>2025-10-20T18:50:59+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/insights-from-quick-sort/</loc>
		<lastmod>2025-10-20T18:50:19+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/interview-question-13-kth-largest-element/</loc>
		<lastmod>2025-10-20T18:49:45+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/sorting/</loc>
		<lastmod>2025-10-20T18:49:12+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/optional-tail-recursion/</loc>
		<lastmod>2025-10-20T18:48:33+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/introducing-recursion/</loc>
		<lastmod>2025-10-20T18:48:03+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-our-solution-4/</loc>
		<lastmod>2025-10-20T18:26:24+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/figuring-out-our-solution-2/</loc>
		<lastmod>2025-10-20T18:25:23+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/question-12-implement-queue-with-stacks/</loc>
		<lastmod>2025-10-20T18:24:54+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-our-solution-3/</loc>
		<lastmod>2025-10-20T18:21:57+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/thinking-about-our-solution-2/</loc>
		<lastmod>2025-10-20T18:20:58+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/interview-question-11-minimum-brackets-to-remove/</loc>
		<lastmod>2025-10-20T18:20:31+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-our-solution-with-a-stack/</loc>
		<lastmod>2025-10-20T18:17:07+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/walking-through-our-problem-identifying-the-need-for-a-stack/</loc>
		<lastmod>2025-10-20T18:16:05+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/interview-question-10-valid-parentheses/</loc>
		<lastmod>2025-10-20T18:15:46+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/intro-to-stacks-and-queues/</loc>
		<lastmod>2025-10-20T18:15:21+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/optional-proof-of-how-and-why-floyds-algorithm-works/</loc>
		<lastmod>2025-10-20T18:10:07+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-floyds-algorithm/</loc>
		<lastmod>2025-10-20T18:09:10+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/what-is-floyds-tortoise-and-hare-algorithm/</loc>
		<lastmod>2025-10-20T18:08:40+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/interview-question-9-cycle-detection/</loc>
		<lastmod>2025-10-20T18:08:10+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-out-our-solution/</loc>
		<lastmod>2025-10-20T18:03:04+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/thinking-about-our-approach/</loc>
		<lastmod>2025-10-20T18:02:13+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/note-a-great-visualization-helper-written-in-python-by-karen-fisher/</loc>
		<lastmod>2025-10-20T18:01:46+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/figuring-out-our-test-cases/</loc>
		<lastmod>2025-10-20T18:00:44+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/interview-question-8-merge-multi-level-doubly-linked-list/</loc>
		<lastmod>2025-10-20T18:00:09+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-our-solution-2/</loc>
		<lastmod>2025-10-20T17:43:37+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coming-up-with-a-logical-solution/</loc>
		<lastmod>2025-10-20T17:43:08+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/interview-question-7-m-n-reversals/</loc>
		<lastmod>2025-10-20T17:42:34+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-reverse-a-linked-list-solution/</loc>
		<lastmod>2025-10-20T17:40:59+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/thinking-about-our-solution/</loc>
		<lastmod>2025-10-20T17:40:16+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/basic-algorithm-reverse-a-linked-list/</loc>
		<lastmod>2025-10-20T17:39:43+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/linked-list-introduction-2/</loc>
		<lastmod>2025-10-20T17:38:37+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-our-solution/</loc>
		<lastmod>2025-10-20T17:33:36+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/figuring-out-our-solution/</loc>
		<lastmod>2025-10-20T17:32:08+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/almost-a-palindrome/</loc>
		<lastmod>2025-10-20T17:31:38+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/interview-question-6-valid-palindrome/</loc>
		<lastmod>2025-10-20T17:30:58+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/intro-to-palindromes/</loc>
		<lastmod>2025-10-20T17:30:21+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/optimal-code-and-leetcode-2/</loc>
		<lastmod>2025-10-20T15:33:27+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/note-correction-for-explanation-of-1/</loc>
		<lastmod>2025-10-20T15:32:51+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-our-optimal-solution-4/</loc>
		<lastmod>2025-10-20T15:31:59+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/thinking-about-optimal-solution/</loc>
		<lastmod>2025-10-20T15:31:24+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/hints-for-optimizing-our-solution/</loc>
		<lastmod>2025-10-20T15:30:45+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/sliding-window-technique/</loc>
		<lastmod>2025-10-20T15:30:09+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/space-and-time-complexity-2/</loc>
		<lastmod>2025-10-20T15:29:32+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-our-brute-force-3/</loc>
		<lastmod>2025-10-20T15:28:53+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coming-up-with-a-brute-force-approach/</loc>
		<lastmod>2025-10-20T15:28:10+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/interview-question-5-longest-substring-without-repeating-characters/</loc>
		<lastmod>2025-10-20T15:27:27+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/submitting-to-leetcode-2/</loc>
		<lastmod>2025-10-20T15:14:42+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-our-optimal-solution-3/</loc>
		<lastmod>2025-10-20T15:13:24+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coming-up-with-optimal-solution/</loc>
		<lastmod>2025-10-20T15:12:29+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/space-and-time-complexity/</loc>
		<lastmod>2025-10-20T15:11:43+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-our-brute-force-2/</loc>
		<lastmod>2025-10-20T15:11:06+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/logic-of-our-brute-force/</loc>
		<lastmod>2025-10-20T15:10:23+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/interview-question-4-typed-out-strings/</loc>
		<lastmod>2025-10-20T15:09:42+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/optimal-code-and-leetcode/</loc>
		<lastmod>2025-10-20T14:53:06+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-our-optimal-solution-2/</loc>
		<lastmod>2025-10-20T14:51:35+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/figuring-out-our-optimization-strategy/</loc>
		<lastmod>2025-10-20T14:50:59+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-our-brute-force/</loc>
		<lastmod>2025-10-20T14:49:56+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/thinking-about-a-logical-solution/</loc>
		<lastmod>2025-10-20T14:49:31+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/interview-question-3-trapping-rainwater/</loc>
		<lastmod>2025-10-20T14:48:58+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-our-optimal-solution-and-testing-on-leetcode/</loc>
		<lastmod>2025-10-20T14:24:12+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/thinking-about-our-optimal-solution/</loc>
		<lastmod>2025-10-20T14:23:30+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/stepping-through-our-code/</loc>
		<lastmod>2025-10-20T14:23:01+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coding-out-our-brute-force-solution/</loc>
		<lastmod>2025-10-20T14:22:35+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/thinking-through-a-logical-brute-force-solution/</loc>
		<lastmod>2025-10-20T14:22:11+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/coming-up-with-test-cases/</loc>
		<lastmod>2025-10-20T14:21:41+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/interview-question-2-container-with-most-water/</loc>
		<lastmod>2025-10-20T14:21:18+00:00</lastmod>
	</url>
	<url>
		<loc>https://freeonlineteq.com/courses/master-the-coding-interview-big-tech-faang-interviews/lessons/web-python-machine-learning-monthly-resources-2/</loc>
		<lastmod>2025-10-20T14:15:42+00:00</lastmod>
	</url>
</urlset>
<!-- XML Sitemap generated by Rank Math SEO Plugin (c) Rank Math - rankmath.com -->