<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.sitemaps.org/schemas/sitemap/0.9 http://www.sitemaps.org/schemas/sitemap/0.9/sitemap.xsd" xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
<url>
<loc>https://namnguyendanh.github.io/technology/load-balancing</loc>
<lastmod>2022-05-09T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/technology/load-model-with-openCV</loc>
<lastmod>2022-05-09T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/technology/prometheus</loc>
<lastmod>2022-05-09T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/about/</loc>
</url>
<url>
<loc>https://namnguyendanh.github.io/categories/</loc>
</url>
<url>
<loc>https://namnguyendanh.github.io/</loc>
</url>
<url>
<loc>https://namnguyendanh.github.io/projects/</loc>
</url>
<url>
<loc>https://namnguyendanh.github.io/resume/</loc>
</url>
<url>
<loc>https://namnguyendanh.github.io/tags/</loc>
</url>
<url>
<loc>https://namnguyendanh.github.io/posts/</loc>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/OOD/AirlineManagementSystem</loc>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/OOD/AmazonLockerService</loc>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/OOD/OnlineBookStore</loc>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/OOD/ParkingLot</loc>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/OOD/XmlToJson</loc>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/bigdata/beam_examples</loc>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/bigdata/blogs</loc>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/bigdata/fundamentals-and-concepts</loc>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/bigdata/hadoop_basics</loc>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/bigdata/hive-queries</loc>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/bigdata/pipeline-examples</loc>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/bigdata/spark</loc>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/bigdata/sql_deadlock_fix</loc>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/spotify/spotify</loc>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/sql/important-sql-queries</loc>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/ticketmaster/ticketmaster</loc>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/twitter/twitter</loc>
</url>
<url>
<loc>https://namnguyendanh.github.io/assets/nguyendanhnam_cv.pdf</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/assets/nguyendanhnam_resume.pdf</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/1-introduction/1-Who-should-take-this-course.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/1-introduction/2-Course-Overview-Grokking-the-Coding-Interview-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/10-pattern-two-heaps/2-Find-the-Median-of-a-Number-Stream-medium/1.1Find-the-Median-of-a-Number-Stream-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/10-pattern-two-heaps/2-Find-the-Median-of-a-Number-Stream-medium/1.2Find-the-Median-of-a-Number-Stream-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/10-pattern-two-heaps/2-Find-the-Median-of-a-Number-Stream-medium/1.3Find-the-Median-of-a-Number-Stream-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/10-pattern-two-heaps/2-Find-the-Median-of-a-Number-Stream-medium/1.4Find-the-Median-of-a-Number-Stream-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/1-Introduction/Introduction-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/10-Problem-Challenge-2/1.1Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/10-Problem-Challenge-2/1.2Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/10-Problem-Challenge-2/1.3Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/10-Problem-Challenge-2/1.4Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/11-Solution-Review-Problem-Challenge-2/1.1Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/11-Solution-Review-Problem-Challenge-2/1.2Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/11-Solution-Review-Problem-Challenge-2/1.3Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/11-Solution-Review-Problem-Challenge-2/1.4Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/12-Problem-Challenge-3/1.1Problem-Challenge-3-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/12-Problem-Challenge-3/1.2Problem-Challenge-3-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/12-Problem-Challenge-3/1.3Problem-Challenge-3-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/12-Problem-Challenge-3/1.4Problem-Challenge-3-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/13-Solution-Review-Problem-Challenge-3/1.1Solution-Review_-Problem-Challenge-3.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/13-Solution-Review-Problem-Challenge-3/1.2Solution-Review_-Problem-Challenge-3.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/13-Solution-Review-Problem-Challenge-3/1.3Solution-Review_-Problem-Challenge-3.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/13-Solution-Review-Problem-Challenge-3/1.4Solution-Review_-Problem-Challenge-3.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/2-Subsets-easy/1.1Subsets-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/2-Subsets-easy/1.2Subsets-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/2-Subsets-easy/1.3Subsets-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/2-Subsets-easy/1.4Subsets-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/3-Subsets-With-Duplicates-easy/1.1Subsets-With-Duplicates-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/3-Subsets-With-Duplicates-easy/1.2Subsets-With-Duplicates-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/3-Subsets-With-Duplicates-easy/1.3Subsets-With-Duplicates-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/3-Subsets-With-Duplicates-easy/1.4Subsets-With-Duplicates-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/4-Permutations-medium/1.1Permutations-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/4-Permutations-medium/1.2Permutations-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/4-Permutations-medium/1.3Permutations-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/4-Permutations-medium/1.4Permutations-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/5-String-Permutations-by-changing-case-medium/1.1String-Permutations-by-changing-case-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/5-String-Permutations-by-changing-case-medium/1.2String-Permutations-by-changing-case-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/5-String-Permutations-by-changing-case-medium/1.3String-Permutations-by-changing-case-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/5-String-Permutations-by-changing-case-medium/1.4String-Permutations-by-changing-case-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/6-Balanced-Parentheses-hard/1.1Balanced-Parentheses-hard-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/6-Balanced-Parentheses-hard/1.2Balanced-Parentheses-hard-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/6-Balanced-Parentheses-hard/1.3Balanced-Parentheses-hard-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/6-Balanced-Parentheses-hard/1.4Balanced-Parentheses-hard-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/7-Unique-Generalized-Abbreviations-hard/1.1.1Unique-Generalized-Abbreviations-hard.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/7-Unique-Generalized-Abbreviations-hard/1.1.2Unique-Generalized-Abbreviations-hard.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/7-Unique-Generalized-Abbreviations-hard/1.2Unique-Generalized-Abbreviations-hard.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/7-Unique-Generalized-Abbreviations-hard/1.3Unique-Generalized-Abbreviations-hard.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/7-Unique-Generalized-Abbreviations-hard/1.4Unique-Generalized-Abbreviations-hard.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/8-Problem-Challenge-1/1.1Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/8-Problem-Challenge-1/1.2Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/8-Problem-Challenge-1/1.3Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/8-Problem-Challenge-1/1.4Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/9-Solution-Review-Problem-Challenge-1/1.1Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/9-Solution-Review-Problem-Challenge-1/1.2Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/9-Solution-Review-Problem-Challenge-1/1.3Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/11-pattern-subsets/9-Solution-Review-Problem-Challenge-1/1.4Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/1-Introduction/Introduction-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/10-Solution-Review-Problem-Challenge-1/1.1Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/10-Solution-Review-Problem-Challenge-1/1.2Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/10-Solution-Review-Problem-Challenge-1/1.3Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/10-Solution-Review-Problem-Challenge-1/1.4Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/11-Problem-Challenge-2/1.1Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/11-Problem-Challenge-2/1.2Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/11-Problem-Challenge-2/1.3Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/11-Problem-Challenge-2/1.4Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/12-Solution-Review-Problem-Challenge-2/1.1Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/12-Solution-Review-Problem-Challenge-2/1.2Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/12-Solution-Review-Problem-Challenge-2/1.3Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/12-Solution-Review-Problem-Challenge-2/1.4Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/13-Problem-Challenge-3/1.1Problem-Challenge-3-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/13-Problem-Challenge-3/1.2Problem-Challenge-3-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/13-Problem-Challenge-3/1.3Problem-Challenge-3-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/13-Problem-Challenge-3/1.4Problem-Challenge-3-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/14-Solution-Review-Problem-Challenge-3/1.1Solution-Review_-Problem-Challenge-3.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/14-Solution-Review-Problem-Challenge-3/1.2Solution-Review_-Problem-Challenge-3.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/14-Solution-Review-Problem-Challenge-3/1.3Solution-Review_-Problem-Challenge-3.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/14-Solution-Review-Problem-Challenge-3/1.4Solution-Review_-Problem-Challenge-3.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/2-Order-agnostic-Binary-Search-easy/1.1Order-agnostic-Binary-Search-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/2-Order-agnostic-Binary-Search-easy/1.2Order-agnostic-Binary-Search-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/2-Order-agnostic-Binary-Search-easy/1.3Order-agnostic-Binary-Search-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/2-Order-agnostic-Binary-Search-easy/1.4Order-agnostic-Binary-Search-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/3-Ceiling-of-a-Number-medium/1.1Ceiling-of-a-Number-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/3-Ceiling-of-a-Number-medium/1.2Ceiling-of-a-Number-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/3-Ceiling-of-a-Number-medium/1.3Ceiling-of-a-Number-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/3-Ceiling-of-a-Number-medium/1.4Ceiling-of-a-Number-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/4-Next-Letter-medium/1.1Next-Letter-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/4-Next-Letter-medium/1.2Next-Letter-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/4-Next-Letter-medium/1.3Next-Letter-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/4-Next-Letter-medium/1.4Next-Letter-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/5-Number-Range-medium/1.1Number-Range-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/5-Number-Range-medium/1.2Number-Range-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/5-Number-Range-medium/1.3Number-Range-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/5-Number-Range-medium/1.4Number-Range-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/6-Search-in-a-Sorted-Infinite-Array-medium/1.1Search-in-a-Sorted-Infinite-Array-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/6-Search-in-a-Sorted-Infinite-Array-medium/1.2Search-in-a-Sorted-Infinite-Array-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/6-Search-in-a-Sorted-Infinite-Array-medium/1.3Search-in-a-Sorted-Infinite-Array-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/6-Search-in-a-Sorted-Infinite-Array-medium/1.4Search-in-a-Sorted-Infinite-Array-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/7-Minimum-Difference-Element-medium/1.1Minimum-Difference-Element-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/7-Minimum-Difference-Element-medium/1.2Minimum-Difference-Element-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/7-Minimum-Difference-Element-medium/1.3Minimum-Difference-Element-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/7-Minimum-Difference-Element-medium/1.4Minimum-Difference-Element-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/8-Bitonic-Array-Maximum-easy/1.1Bitonic-Array-Maximum-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/8-Bitonic-Array-Maximum-easy/1.2Bitonic-Array-Maximum-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/8-Bitonic-Array-Maximum-easy/1.3Bitonic-Array-Maximum-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/8-Bitonic-Array-Maximum-easy/1.4Bitonic-Array-Maximum-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/9-Problem-Challenge-1/1.1Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/9-Problem-Challenge-1/1.2Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/9-Problem-Challenge-1/1.3Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/12-pattern-modified-binary-search/9-Problem-Challenge-1/1.4Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/13-pattern-bitwise-XOR/1-Introduction/1.1Introduction-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/13-pattern-bitwise-XOR/1-Introduction/1.2Introduction-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/13-pattern-bitwise-XOR/1-Introduction/1.3Introduction-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/13-pattern-bitwise-XOR/1-Introduction/1.4Introduction-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/13-pattern-bitwise-XOR/2-Single-Number-easy/1.1Single-Number-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/13-pattern-bitwise-XOR/2-Single-Number-easy/1.2Single-Number-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/13-pattern-bitwise-XOR/2-Single-Number-easy/1.3Single-Number-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/13-pattern-bitwise-XOR/2-Single-Number-easy/1.4Single-Number-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/13-pattern-bitwise-XOR/3-Two-Single-Numbers-medium/1.1Two-Single-Numbers-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/13-pattern-bitwise-XOR/3-Two-Single-Numbers-medium/1.2Two-Single-Numbers-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/13-pattern-bitwise-XOR/3-Two-Single-Numbers-medium/1.3Two-Single-Numbers-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/13-pattern-bitwise-XOR/3-Two-Single-Numbers-medium/1.4Two-Single-Numbers-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/13-pattern-bitwise-XOR/4-Complement-of-Base-10-Number-medium/1.1Complement-of-Base-10-Number-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/13-pattern-bitwise-XOR/4-Complement-of-Base-10-Number-medium/1.2Complement-of-Base-10-Number-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/13-pattern-bitwise-XOR/4-Complement-of-Base-10-Number-medium/1.3Complement-of-Base-10-Number-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/13-pattern-bitwise-XOR/4-Complement-of-Base-10-Number-medium/1.4Complement-of-Base-10-Number-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/13-pattern-bitwise-XOR/5-Problem-Challenge-1/1.1Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/13-pattern-bitwise-XOR/5-Problem-Challenge-1/1.2Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/13-pattern-bitwise-XOR/5-Problem-Challenge-1/1.3Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/13-pattern-bitwise-XOR/5-Problem-Challenge-1/1.4Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/13-pattern-bitwise-XOR/6-Solution-Review-Problem-Challenge-1/1.1Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/13-pattern-bitwise-XOR/6-Solution-Review-Problem-Challenge-1/1.2Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/13-pattern-bitwise-XOR/6-Solution-Review-Problem-Challenge-1/1.3Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/13-pattern-bitwise-XOR/6-Solution-Review-Problem-Challenge-1/1.4Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/1-Introduction/Introduction-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/10-Maximum-Distinct-Elements-medium/1.1.1Maximum-Distinct-Elements-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/10-Maximum-Distinct-Elements-medium/1.1.2Maximum-Distinct-Elements-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/10-Maximum-Distinct-Elements-medium/1.2Maximum-Distinct-Elements-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/10-Maximum-Distinct-Elements-medium/1.3Maximum-Distinct-Elements-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/10-Maximum-Distinct-Elements-medium/1.4Maximum-Distinct-Elements-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/11-Sum-of-Elements-medium/1.1Sum-of-Elements-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/11-Sum-of-Elements-medium/1.2Sum-of-Elements-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/11-Sum-of-Elements-medium/1.3Sum-of-Elements-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/11-Sum-of-Elements-medium/1.4Sum-of-Elements-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/12-Rearrange-String-hard/1.1Rearrange-String-hard-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/12-Rearrange-String-hard/1.2Rearrange-String-hard-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/12-Rearrange-String-hard/1.3Rearrange-String-hard-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/12-Rearrange-String-hard/1.4Rearrange-String-hard-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/13-Problem-Challenge-1/1.1Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/13-Problem-Challenge-1/1.2Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/13-Problem-Challenge-1/1.3Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/13-Problem-Challenge-1/1.4Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/14-Solution-Review-Problem-Challenge-1/1.1Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/14-Solution-Review-Problem-Challenge-1/1.2Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/14-Solution-Review-Problem-Challenge-1/1.3Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/14-Solution-Review-Problem-Challenge-1/1.4Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/15-Problem-Challenge-2/1.1Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/15-Problem-Challenge-2/1.2Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/15-Problem-Challenge-2/1.3Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/15-Problem-Challenge-2/1.4Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/16-Solution-Review-Problem-Challenge-2/1.1Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/16-Solution-Review-Problem-Challenge-2/1.2Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/16-Solution-Review-Problem-Challenge-2/1.3Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/16-Solution-Review-Problem-Challenge-2/1.4Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/17-Problem-Challenge-3/1.1Problem-Challenge-3-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/17-Problem-Challenge-3/1.2Problem-Challenge-3-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/17-Problem-Challenge-3/1.3Problem-Challenge-3-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/17-Problem-Challenge-3/1.4Problem-Challenge-3-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/18-Solution-Review-Problem-Challenge-3/1.1Solution-Review_-Problem-Challenge-3.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/18-Solution-Review-Problem-Challenge-3/1.2Solution-Review_-Problem-Challenge-3.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/18-Solution-Review-Problem-Challenge-3/1.3Solution-Review_-Problem-Challenge-3.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/18-Solution-Review-Problem-Challenge-3/1.4Solution-Review_-Problem-Challenge-3.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/2-Top-_K_-Numbers-easy/1.1Top-_K_-Numbers-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/2-Top-_K_-Numbers-easy/1.2Top-_K_-Numbers-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/2-Top-_K_-Numbers-easy/1.3Top-_K_-Numbers-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/2-Top-_K_-Numbers-easy/1.4Top-_K_-Numbers-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/3-Kth-Smallest-Number-easy/1.1Kth-Smallest-Number-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/3-Kth-Smallest-Number-easy/1.2Kth-Smallest-Number-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/3-Kth-Smallest-Number-easy/1.3Kth-Smallest-Number-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/3-Kth-Smallest-Number-easy/1.4Kth-Smallest-Number-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/4-_K_-Closest-Points-to-the-Origin-easy/1.1_K_-Closest-Points-to-the-Origin-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/4-_K_-Closest-Points-to-the-Origin-easy/1.2_K_-Closest-Points-to-the-Origin-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/4-_K_-Closest-Points-to-the-Origin-easy/1.3_K_-Closest-Points-to-the-Origin-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/4-_K_-Closest-Points-to-the-Origin-easy/1.4_K_-Closest-Points-to-the-Origin-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/5-Connect-Ropes-easy/1.1Connect-Ropes-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/5-Connect-Ropes-easy/1.2Connect-Ropes-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/5-Connect-Ropes-easy/1.3Connect-Ropes-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/5-Connect-Ropes-easy/1.4Connect-Ropes-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/6-Top-_K_-Frequent-Numbers-medium/1.1Top-_K_-Frequent-Numbers-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/6-Top-_K_-Frequent-Numbers-medium/1.2Top-_K_-Frequent-Numbers-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/6-Top-_K_-Frequent-Numbers-medium/1.3Top-_K_-Frequent-Numbers-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/6-Top-_K_-Frequent-Numbers-medium/1.4Top-_K_-Frequent-Numbers-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/7-Frequency-Sort-medium/1.1Frequency-Sort-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/7-Frequency-Sort-medium/1.2Frequency-Sort-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/7-Frequency-Sort-medium/1.3Frequency-Sort-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/7-Frequency-Sort-medium/1.4Frequency-Sort-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/8-Kth-Largest-Number-in-a-Stream-medium/1.1Kth-Largest-Number-in-a-Stream-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/8-Kth-Largest-Number-in-a-Stream-medium/1.2Kth-Largest-Number-in-a-Stream-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/8-Kth-Largest-Number-in-a-Stream-medium/1.3Kth-Largest-Number-in-a-Stream-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/8-Kth-Largest-Number-in-a-Stream-medium/1.4Kth-Largest-Number-in-a-Stream-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/9-_K_-Closest-Numbers-medium/1.1_K_-Closest-Numbers-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/9-_K_-Closest-Numbers-medium/1.2_K_-Closest-Numbers-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/9-_K_-Closest-Numbers-medium/1.3_K_-Closest-Numbers-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/14-pattern-top-k-elements/9-_K_-Closest-Numbers-medium/1.4_K_-Closest-Numbers-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/15-pattern-k-way-merge/1-Introduction/Introduction-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/15-pattern-k-way-merge/2-Merge-K-Sorted-Lists-medium/1.1Merge-K-Sorted-Lists-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/15-pattern-k-way-merge/2-Merge-K-Sorted-Lists-medium/1.2Merge-K-Sorted-Lists-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/15-pattern-k-way-merge/2-Merge-K-Sorted-Lists-medium/1.3Merge-K-Sorted-Lists-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/15-pattern-k-way-merge/2-Merge-K-Sorted-Lists-medium/1.4Merge-K-Sorted-Lists-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/15-pattern-k-way-merge/3-Kth-Smallest-Number-in-M-Sorted-Lists-Medium/1.1Kth-Smallest-Number-in-M-Sorted-Lists-Medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/15-pattern-k-way-merge/3-Kth-Smallest-Number-in-M-Sorted-Lists-Medium/1.2Kth-Smallest-Number-in-M-Sorted-Lists-Medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/15-pattern-k-way-merge/3-Kth-Smallest-Number-in-M-Sorted-Lists-Medium/1.3Kth-Smallest-Number-in-M-Sorted-Lists-Medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/15-pattern-k-way-merge/3-Kth-Smallest-Number-in-M-Sorted-Lists-Medium/1.4Kth-Smallest-Number-in-M-Sorted-Lists-Medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/15-pattern-k-way-merge/4-Kth-Smallest-Number-in-a-Sorted-Matrix-Hard/1.1.1Kth-Smallest-Number-in-a-Sorted-Matrix-Hard.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/15-pattern-k-way-merge/4-Kth-Smallest-Number-in-a-Sorted-Matrix-Hard/1.1.2Kth-Smallest-Number-in-a-Sorted-Matrix-Hard.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/15-pattern-k-way-merge/4-Kth-Smallest-Number-in-a-Sorted-Matrix-Hard/1.2Kth-Smallest-Number-in-a-Sorted-Matrix-Hard.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/15-pattern-k-way-merge/4-Kth-Smallest-Number-in-a-Sorted-Matrix-Hard/1.3Kth-Smallest-Number-in-a-Sorted-Matrix-Hard.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/15-pattern-k-way-merge/4-Kth-Smallest-Number-in-a-Sorted-Matrix-Hard/1.4Kth-Smallest-Number-in-a-Sorted-Matrix-Hard.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/15-pattern-k-way-merge/5-Smallest-Number-Range-Hard/1.1Smallest-Number-Range-Hard-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/15-pattern-k-way-merge/5-Smallest-Number-Range-Hard/1.2Smallest-Number-Range-Hard-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/15-pattern-k-way-merge/5-Smallest-Number-Range-Hard/1.3Smallest-Number-Range-Hard-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/15-pattern-k-way-merge/5-Smallest-Number-Range-Hard/1.4Smallest-Number-Range-Hard-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/15-pattern-k-way-merge/6-Problem-Challenge-1/1.1Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/15-pattern-k-way-merge/6-Problem-Challenge-1/1.2Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/15-pattern-k-way-merge/6-Problem-Challenge-1/1.3Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/15-pattern-k-way-merge/6-Problem-Challenge-1/1.4Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/15-pattern-k-way-merge/7-Solution-Review-Problem-Challenge-1/1.1Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/15-pattern-k-way-merge/7-Solution-Review-Problem-Challenge-1/1.2Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/15-pattern-k-way-merge/7-Solution-Review-Problem-Challenge-1/1.3Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/15-pattern-k-way-merge/7-Solution-Review-Problem-Challenge-1/1.4Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/1-Introduction/Introduction-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/2-01-Knapsack-medium/1.-0_1-Knapsack-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/2-01-Knapsack-medium/2.-0_1-Knapsack-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/2-01-Knapsack-medium/3.-0_1-Knapsack-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/2-01-Knapsack-medium/4.-0_1-Knapsack-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/3-Equal-Subset-Sum-Partition-medium/1.1-Equal-Subset-Sum-Partition-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/3-Equal-Subset-Sum-Partition-medium/1.2-Equal-Subset-Sum-Partition-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/3-Equal-Subset-Sum-Partition-medium/1.3-Equal-Subset-Sum-Partition-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/3-Equal-Subset-Sum-Partition-medium/1.4-Equal-Subset-Sum-Partition-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/4-Subset-Sum-medium/1.1Subset-Sum-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/4-Subset-Sum-medium/1.2Subset-Sum-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/4-Subset-Sum-medium/1.3Subset-Sum-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/4-Subset-Sum-medium/1.4Subset-Sum-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/5-Minimum-Subset-Sum-Difference-hard/1.1Minimum-Subset-Sum-Difference-hard.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/5-Minimum-Subset-Sum-Difference-hard/1.2Minimum-Subset-Sum-Difference-hard.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/5-Minimum-Subset-Sum-Difference-hard/1.3Minimum-Subset-Sum-Difference-hard.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/5-Minimum-Subset-Sum-Difference-hard/1.4Minimum-Subset-Sum-Difference-hard.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/6-Problem-Challenge-1/1.1Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/6-Problem-Challenge-1/1.2Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/6-Problem-Challenge-1/1.3Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/6-Problem-Challenge-1/1.4Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/7-Solution-Review-Problem-Challenge-1/1.1Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/7-Solution-Review-Problem-Challenge-1/1.2Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/7-Solution-Review-Problem-Challenge-1/1.3Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/7-Solution-Review-Problem-Challenge-1/1.4Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/8-Problem-Challenge-2/1.1Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/8-Problem-Challenge-2/1.2Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/8-Problem-Challenge-2/1.3Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/8-Problem-Challenge-2/1.4Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/9-Solution-Review_-Problem-Challenge-2/1.1-Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/9-Solution-Review_-Problem-Challenge-2/1.2Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/9-Solution-Review_-Problem-Challenge-2/1.3Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/16-pattern-0-or-1-DP/9-Solution-Review_-Problem-Challenge-2/1.4Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/1-Introduction/Introduction-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/10-Solution-Review-Problem-Challenge-2/1.1Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/10-Solution-Review-Problem-Challenge-2/1.2Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/10-Solution-Review-Problem-Challenge-2/1.3Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/10-Solution-Review-Problem-Challenge-2/1.4Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/2-Topological-Sort-medium/1.1Topological-Sort-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/2-Topological-Sort-medium/1.2Topological-Sort-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/2-Topological-Sort-medium/1.3Topological-Sort-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/2-Topological-Sort-medium/1.4Topological-Sort-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/3-Tasks-Scheduling-medium/1.1.1Tasks-Scheduling-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/3-Tasks-Scheduling-medium/1.1.2Tasks-Scheduling-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/3-Tasks-Scheduling-medium/1.2Tasks-Scheduling-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/3-Tasks-Scheduling-medium/1.3Tasks-Scheduling-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/3-Tasks-Scheduling-medium/1.4Tasks-Scheduling-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/4-Tasks-Scheduling-Order-medium/1.1.1Tasks-Scheduling-Order-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/4-Tasks-Scheduling-Order-medium/1.1.2Tasks-Scheduling-Order-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/4-Tasks-Scheduling-Order-medium/1.2Tasks-Scheduling-Order-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/4-Tasks-Scheduling-Order-medium/1.3Tasks-Scheduling-Order-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/4-Tasks-Scheduling-Order-medium/1.4Tasks-Scheduling-Order-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/5-All-Tasks-Scheduling-Orders-hard/1.1.1All-Tasks-Scheduling-Orders-hard.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/5-All-Tasks-Scheduling-Orders-hard/1.1.2All-Tasks-Scheduling-Orders-hard.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/5-All-Tasks-Scheduling-Orders-hard/1.2All-Tasks-Scheduling-Orders-hard.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/5-All-Tasks-Scheduling-Orders-hard/1.3All-Tasks-Scheduling-Orders-hard.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/5-All-Tasks-Scheduling-Orders-hard/1.4All-Tasks-Scheduling-Orders-hard.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/6-Alien-Dictionary-hard/1.1.1Alien-Dictionary-hard-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/6-Alien-Dictionary-hard/1.1.2Alien-Dictionary-hard-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/6-Alien-Dictionary-hard/1.2Alien-Dictionary-hard-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/6-Alien-Dictionary-hard/1.3Alien-Dictionary-hard-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/6-Alien-Dictionary-hard/1.4Alien-Dictionary-hard-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/7-Problem-Challenge-1/1.1Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/7-Problem-Challenge-1/1.2Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/7-Problem-Challenge-1/1.3Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/7-Problem-Challenge-1/1.4Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/8-Solution-Review-Problem-Challenge-1/1.1Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/8-Solution-Review-Problem-Challenge-1/1.2Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/8-Solution-Review-Problem-Challenge-1/1.3Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/8-Solution-Review-Problem-Challenge-1/1.4Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/9-Problem-Challenge-2/1.1Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/9-Problem-Challenge-2/1.2Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/9-Problem-Challenge-2/1.3Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/17-pattern-toplogical-sort/9-Problem-Challenge-2/1.4Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/18-miscellaneous/1-Kth-Smallest-Number-hard/1.1Kth-Smallest-Number-hard-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/18-miscellaneous/1-Kth-Smallest-Number-hard/1.2Kth-Smallest-Number-hard-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/18-miscellaneous/1-Kth-Smallest-Number-hard/1.3Kth-Smallest-Number-hard.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/18-miscellaneous/1-Kth-Smallest-Number-hard/1.4Kth-Smallest-Number-hard-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/18-miscellaneous/1-Kth-Smallest-Number-hard/1.5Kth-Smallest-Number-hard-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/19-conclusions/Where-to-Go-from-Here-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/2-patttern-sliding-window/1-Introduction/1.1-Introduction-Grokking-the-Coding-Interview-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/2-patttern-sliding-window/10-Solution-Review-Problem-Challenge-1/1.1-Solution-Review-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/2-patttern-sliding-window/11-Problem-Challenge-2/1.1%20Problem%20Challenge%202%20-%20Grokking%20the%20Coding%20Interview_%20Patterns%20for%20Coding%20Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/2-patttern-sliding-window/12-Solution-Review-Problem-Challenge-2/1.1%20Solution%20Review_%20Problem%20Challenge%202%20-.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/2-patttern-sliding-window/13-Problem-Challenge-3/1.1%20Problem%20Challenge%203%20-%20Grokking%20the%20Coding%20Interview_%20Patterns%20for%20Coding%20Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/2-patttern-sliding-window/14-Solution-Review-Problem-Challenge-3/1.1%20Solution%20Review_%20Problem%20Challenge%203%20-.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/2-patttern-sliding-window/15-Problem-Challenge-4/1.1%20Problem%20Challenge%204%20-%20Grokking%20the%20Coding%20Interview_%20Patterns%20for%20Coding%20Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/2-patttern-sliding-window/16-Solution-Review-Problem-Challenge-4/1.1%20Solution%20Review_%20Problem%20Challenge%204%20-.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/2-patttern-sliding-window/2-Maximum-Sum-Subarray-of-Size-K-easy/1.1-Maximum-Sum-Subarray-of-Size-K-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/2-patttern-sliding-window/3-Smallest-Subarray-with-a-given-sum-easy/1.1-Smallest-Subarray-with-a-given-sum-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/2-patttern-sliding-window/4-Longest-Substring-with-K-Distinct-Characters-medium/1.1-Longest-Substring-with-K-Distinct-Characters-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/2-patttern-sliding-window/5-Fruits-into-Baskets-medium/1.1-Fruits-into-Baskets-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/2-patttern-sliding-window/6-No-repeat-Substring-hard/1.1-No-repeat-Substring-hard.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/2-patttern-sliding-window/7-Longest-Substring-with-Same-Letters-after-Replacement-hard/1.1-Longest-Substring-with-Letters-after-Replacement-hard.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/2-patttern-sliding-window/8-Longest-Subarray-with-Ones-after-Replacement-hard/1.1-Longest-Subarray-with-Ones-after-Replacement-hard.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/2-patttern-sliding-window/9-Problem-Challenge-1/1.1-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/3-pattern-two-pointer/1-Introduction/Introduction-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/3-pattern-two-pointer/10-Problem-Challenge-1/1.1-Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/3-pattern-two-pointer/11-Solution-Review-Problem-Challenge-1/1.1-Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/3-pattern-two-pointer/12-Problem-Challenge-2/1.1-Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/3-pattern-two-pointer/13-Solution-Review-Problem-Challenge-2/1.1-Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/3-pattern-two-pointer/14-Problem-Challenge-3/1.1-Problem-Challenge-3-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/3-pattern-two-pointer/15-Solution-Review-Problem-Challenge-3/1.1-Solution-Review_-Problem-Challenge-3.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/3-pattern-two-pointer/2-Pair-with-Target-Sum-easy/1.1-Pair-with-Target-Sum-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/3-pattern-two-pointer/3-Remove-Duplicates-easy/1.1-Remove-Duplicates-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/3-pattern-two-pointer/4-Squaring-a-Sorted-Array-easy/1.1-Squaring-a-Sorted-Array-(easy)-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/3-pattern-two-pointer/5-Triplet-Sum-to-Zero-medium/1.1-Triplet-Sum-to-Zero-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/3-pattern-two-pointer/6-Triplet-Sum-Close-to-Target-medium/1.4-Triplet-Sum-Close-to-Target-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/3-pattern-two-pointer/7-Triplets-with-Smaller-Sum-medium/1.1-Triplets-with-Smaller-Sum-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/3-pattern-two-pointer/9-Dutch-National-Flag-Problem-medium/1.1-Dutch-National-Flag-Problem-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/4-pattern-fast-slow-pointers/1-Introduction/Introduction-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/4-pattern-fast-slow-pointers/10-Problem-Challenge-3/1.1-Problem-Challenge-3-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/4-pattern-fast-slow-pointers/11-Solution-Review-Problem-Challenge-3/1.1Solution-Review_-Problem-Challenge-3.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/4-pattern-fast-slow-pointers/2-LinkedList-Cycle-easy/1.1-LinkedList-Cycle-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/4-pattern-fast-slow-pointers/3-Start-of-LinkedList-Cycle-medium/1.1-Start-of-LinkedList-Cycle-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/4-pattern-fast-slow-pointers/4-Happy-Number-medium/1.1-Happy-Number-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/4-pattern-fast-slow-pointers/5-Middle-of-the-LinkedList-easy/1.1-Middle-of-the-LinkedList-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/4-pattern-fast-slow-pointers/6-Problem-Challenge-1/1.1-Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/4-pattern-fast-slow-pointers/7-Solution-Review-Problem-Challenge-1/1.1-Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/4-pattern-fast-slow-pointers/8-Problem-Challenge-2/1.1-Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/4-pattern-fast-slow-pointers/9-Solution-Review-Problem-Challenge-2/1.1-Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/5.%20Pattern%20Merge%20Intervals/1.%20Introduction/Introduction%20-%20Grokking%20the%20Coding%20Interview_%20Patterns%20for%20Coding%20Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/5.%20Pattern%20Merge%20Intervals/10.%20Problem%20Challenge%203/1.1Problem%20Challenge%203%20-%20Grokking%20the%20Coding%20Interview_%20Patterns%20for%20Coding%20Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/5.%20Pattern%20Merge%20Intervals/11.%20Solution%20Review%20Problem%20Challenge%203/1.1.1Solution%20Review_%20Problem%20Challenge%203%20-.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/5.%20Pattern%20Merge%20Intervals/11.%20Solution%20Review%20Problem%20Challenge%203/1.1.2Solution%20Review_%20Problem%20Challenge%203%20-.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/5.%20Pattern%20Merge%20Intervals/2.%20Merge%20Intervals%20(medium)/1.1Merge%20Intervals%20(medium)%20-%20Grokking%20the%20Coding%20Interview_%20Patterns%20for%20Coding%20Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/5.%20Pattern%20Merge%20Intervals/4.%20Intervals%20Intersection%20(medium)/1.1Intervals%20Intersection%20(medium)%20-%20Grokking%20the%20Coding%20Interview_%20Patterns%20for%20Coding%20Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/5.%20Pattern%20Merge%20Intervals/5.%20Conflicting%20Appointments%20(medium)/1.1Conflicting%20Appointments%20(medium)%20-.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/5.%20Pattern%20Merge%20Intervals/6.%20Problem%20Challenge%201/1.1Problem%20Challenge%201%20-%20Grokking%20the%20Coding%20Interview_%20Patterns%20for%20Coding%20Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/5.%20Pattern%20Merge%20Intervals/7.%20Solution%20Review%20Problem%20Challenge%201/1.1Solution%20Review_%20Problem%20Challenge%201%20-.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/5.%20Pattern%20Merge%20Intervals/8.%20Problem%20Challenge%202/1.1Problem%20Challenge%202%20-%20Grokking%20the%20Coding%20Interview_%20Patterns%20for%20Coding%20Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/5.%20Pattern%20Merge%20Intervals/9.%20Solution%20Review%20Problem%20Challenge%202/1.1Solution%20Review_%20Problem%20Challenge%202%20-.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/1-Introduction/Introduction-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/2-Reverse-a-LinkedList-easy/1.1Reverse-a-LinkedList-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/2-Reverse-a-LinkedList-easy/1.2Reverse-a-LinkedList-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/2-Reverse-a-LinkedList-easy/1.3Reverse-a-LinkedList-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/2-Reverse-a-LinkedList-easy/1.4Reverse-a-LinkedList-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/3-Reverse-a-Sub-list-medium/1.1Reverse-a-Sub-list-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/3-Reverse-a-Sub-list-medium/1.2Reverse-a-Sub-list-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/3-Reverse-a-Sub-list-medium/1.3Reverse-a-Sub-list-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/3-Reverse-a-Sub-list-medium/1.4Reverse-a-Sub-list-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/4-Reverse-every-K-element-Sub-list-medium/1.1-Reverse-every-K-element-Sub-list-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/4-Reverse-every-K-element-Sub-list-medium/1.2-Reverse-every-K-element-Sub-list-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/4-Reverse-every-K-element-Sub-list-medium/1.3-Reverse-every-K-element-Sub-list-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/4-Reverse-every-K-element-Sub-list-medium/1.4-Reverse-every-K-element-Sub-list-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/5-Problem-Challenge-1/1.1Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/5-Problem-Challenge-1/1.2Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/5-Problem-Challenge-1/1.3Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/5-Problem-Challenge-1/1.4-Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/6-Solution-Review-Problem-Challenge-1/1.1Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/6-Solution-Review-Problem-Challenge-1/1.2Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/6-Solution-Review-Problem-Challenge-1/1.3-Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/6-Solution-Review-Problem-Challenge-1/1.4-Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/7-Problem-Challenge-2/1.1-Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/7-Problem-Challenge-2/1.2Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/7-Problem-Challenge-2/1.3Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/7-Problem-Challenge-2/1.4Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/8-Solution-Review-Problem-Challenge-2/1.1Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/8-Solution-Review-Problem-Challenge-2/1.2Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/8-Solution-Review-Problem-Challenge-2/1.3Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/7-pattern-inplace-reversal-of-a-linkedlist/8-Solution-Review-Problem-Challenge-2/1.4Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/1-Introduction/Introduction-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/10-Solution-Review-Problem-Challenge-1/1.1Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/10-Solution-Review-Problem-Challenge-1/1.2Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/10-Solution-Review-Problem-Challenge-1/1.3Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/10-Solution-Review-Problem-Challenge-1/1.4Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/11-Problem-Challenge-2/1.1Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/11-Problem-Challenge-2/1.2Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/11-Problem-Challenge-2/1.3Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/11-Problem-Challenge-2/1.4Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/12-Solution-Review-Problem-Challenge-2/1.1Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/12-Solution-Review-Problem-Challenge-2/1.2Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/12-Solution-Review-Problem-Challenge-2/1.3Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/12-Solution-Review-Problem-Challenge-2/1.4Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/2-Binary-Tree-Level-Order-Traversal-easy/1.1Binary-Tree-Level-Order-Traversal-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/2-Binary-Tree-Level-Order-Traversal-easy/1.2Binary-Tree-Level-Order-Traversal-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/2-Binary-Tree-Level-Order-Traversal-easy/1.3Binary-Tree-Level-Order-Traversal-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/2-Binary-Tree-Level-Order-Traversal-easy/1.4Binary-Tree-Level-Order-Traversal-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/3-Reverse-Level-Order-Traversal-easy/1.1Reverse-Level-Order-Traversal-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/3-Reverse-Level-Order-Traversal-easy/1.2-Reverse-Level-Order-Traversal-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/3-Reverse-Level-Order-Traversal-easy/1.3Reverse-Level-Order-Traversal-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/3-Reverse-Level-Order-Traversal-easy/1.4Reverse-Level-Order-Traversal-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/4-Zigzag-Traversal-medium/1.1Zigzag-Traversal-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/4-Zigzag-Traversal-medium/1.2Zigzag-Traversal-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/4-Zigzag-Traversal-medium/1.3Zigzag-Traversal-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/4-Zigzag-Traversal-medium/1.4Zigzag-Traversal-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/5-Level-Averages-in-a-Binary-Tree-easy/1.1Level-Averages-in-a-Binary-Tree-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/5-Level-Averages-in-a-Binary-Tree-easy/1.2Level-Averages-in-a-Binary-Tree-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/5-Level-Averages-in-a-Binary-Tree-easy/1.3Level-Averages-in-a-Binary-Tree-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/5-Level-Averages-in-a-Binary-Tree-easy/1.4Level-Averages-in-a-Binary-Tree-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/6-Minimum-Depth-of-a-Binary-Tree-easy/1.1Minimum-Depth-of-a-Binary-Tree-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/6-Minimum-Depth-of-a-Binary-Tree-easy/1.2Minimum-Depth-of-a-Binary-Tree-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/6-Minimum-Depth-of-a-Binary-Tree-easy/1.3Minimum-Depth-of-a-Binary-Tree-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/6-Minimum-Depth-of-a-Binary-Tree-easy/1.4Minimum-Depth-of-a-Binary-Tree-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/7-Level-Order-Successor-easy/1.1Level-Order-Successor-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/7-Level-Order-Successor-easy/1.2Level-Order-Successor-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/7-Level-Order-Successor-easy/1.3Level-Order-Successor-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/7-Level-Order-Successor-easy/1.4Level-Order-Successor-easy.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/8-Connect-Level-Order-Siblings-medium/1.1Connect-Level-Order-Siblings-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/8-Connect-Level-Order-Siblings-medium/1.2Connect-Level-Order-Siblings-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/8-Connect-Level-Order-Siblings-medium/1.3Connect-Level-Order-Siblings-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/8-Connect-Level-Order-Siblings-medium/1.4Connect-Level-Order-Siblings-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/9-Problem-Challenge-1/1.1Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/9-Problem-Challenge-1/1.2Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/9-Problem-Challenge-1/1.3Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/8-pattern-tree-breadth-first-search/9-Problem-Challenge-1/1.4Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/1-Introduction/Introduction-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/10-Solution-Review-Problem-Challenge-2/1.1Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/10-Solution-Review-Problem-Challenge-2/1.2Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/10-Solution-Review-Problem-Challenge-2/1.3Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/10-Solution-Review-Problem-Challenge-2/1.4Solution-Review_-Problem-Challenge-2.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/2-Binary-Tree-Path-Sum-easy/1.1Binary-Tree-Path-Sum-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/2-Binary-Tree-Path-Sum-easy/1.2Binary-Tree-Path-Sum-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/2-Binary-Tree-Path-Sum-easy/1.3Binary-Tree-Path-Sum-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/2-Binary-Tree-Path-Sum-easy/1.4Binary-Tree-Path-Sum-easy-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/3-All-Paths-for-a-Sum-medium/1.1All-Paths-for-a-Sum-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/3-All-Paths-for-a-Sum-medium/1.2All-Paths-for-a-Sum-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/3-All-Paths-for-a-Sum-medium/1.3All-Paths-for-a-Sum-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/3-All-Paths-for-a-Sum-medium/1.4All-Paths-for-a-Sum-medium-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/4-Sum-of-Path-Numbers-medium/1.1Sum-of-Path-Numbers-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/4-Sum-of-Path-Numbers-medium/1.2.1Sum-of-Path-Numbers-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/4-Sum-of-Path-Numbers-medium/1.2.2Sum-of-Path-Numbers-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/4-Sum-of-Path-Numbers-medium/1.3Sum-of-Path-Numbers-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/4-Sum-of-Path-Numbers-medium/1.4Sum-of-Path-Numbers-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/5-Path-With-Given-Sequence-medium/1.1Path-With-Given-Sequence-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/5-Path-With-Given-Sequence-medium/1.2Path-With-Given-Sequence-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/5-Path-With-Given-Sequence-medium/1.3Path-With-Given-Sequence-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/5-Path-With-Given-Sequence-medium/1.4Path-With-Given-Sequence-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/6-Count-Paths-for-a-Sum-medium/1.1Count-Paths-for-a-Sum-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/6-Count-Paths-for-a-Sum-medium/1.2Count-Paths-for-a-Sum-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/6-Count-Paths-for-a-Sum-medium/1.3Count-Paths-for-a-Sum-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/6-Count-Paths-for-a-Sum-medium/1.4Count-Paths-for-a-Sum-medium.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/7-Problem-Challenge-1/1.1Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/7-Problem-Challenge-1/1.2Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/7-Problem-Challenge-1/1.3Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/7-Problem-Challenge-1/1.4Problem-Challenge-1-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/8-Solution-Review-Problem-Challenge-1/1.1Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/8-Solution-Review-Problem-Challenge-1/1.2Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/8-Solution-Review-Problem-Challenge-1/1.3Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/8-Solution-Review-Problem-Challenge-1/1.4Solution-Review_-Problem-Challenge-1.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/9-Problem-Challenge-2/1.1Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/9-Problem-Challenge-2/1.2Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/9-Problem-Challenge-2/1.3Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-coding-interviews/9-pattern-depth-first-search/9-Problem-Challenge-2/1.4Problem-Challenge-2-Grokking-the-Coding-Interview_-Patterns-for-Coding-Questions.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/core/OO-analysis-and-design.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/core/activity-diagrams.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/core/class-diagram.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/core/object-oriented-basics.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/core/sequence-diagram.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/core/use-case-diagram.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/core/what-is-uml.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/java/airline-management-system.html</loc>
<lastmod>2022-12-07T14:56:33+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/java/amazon-online-shopping-system.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/java/atm.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/java/blackjack-and-a-deck-of-cards.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/java/car-rental-system.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/java/chess.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/java/cricinfo.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/java/facebook.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/java/hotel-management-system.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/java/library-management-system.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/java/linkedin.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/java/movie-ticket-booking-system.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/java/online-stock-brokerage-system.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/java/parking-lot.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/java/restaurant-management-system.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/java/stack-overflow.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/python/airline-management-system.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/python/amazon-online-shopping-system.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/python/atm.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/python/blackjack-and-a-deck-of-cards.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/python/car-rental-system.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/python/chess.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/python/cricinfo.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/python/facebook.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/python/hotel-management-system.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/python/library-management-system.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/python/linkedin.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/python/movie-ticket-booking-system.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/python/online-stock-brokerage-system.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/python/parking-lot.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/python/restaurant-management-system.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-ood/examples/python/stack-overflow.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-basics/caching.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-basics/cap-theorem.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-basics/consistent-hashing.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-basics/data-partitioning.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-basics/indexes.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-basics/key-charactersitics-of-distributed-systems.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-basics/load-balancing.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-basics/long-polling.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-basics/proxies.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-basics/redundancy-and-replication.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-basics/sql-vs-nosql.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-basics/system-design-basics.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-problems/additional-resources.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-problems/api-rate-limiter.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-problems/dropbox.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-problems/facebook-messenger.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-problems/facebook-newsfeed.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-problems/instagram.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-problems/pastebin.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-problems/system-design-interviews.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-problems/ticket-master.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-problems/twitter-search.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-problems/twitter.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-problems/typehead-suggestion.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-problems/uber-backend.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-problems/url-shortening-service-like-tiny-url.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-problems/web-crwaler.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-problems/yelp-ornearby-friends.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/grokking-system-design/system-design-problems/youtube-or-netflix.html</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
<url>
<loc>https://namnguyendanh.github.io/system-design/docs/</loc>
<lastmod>2022-12-07T14:56:34+00:00</lastmod>
</url>
</urlset>
