<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
<url><loc>https://www.designgurus.io/course-play/grokking-linkedin-coding-interview</loc><lastmod>2026-07-01T03:30:32.963Z</lastmod></url>
<url><loc>https://www.designgurus.io/course-play/grokking-linkedin-coding-interview/doc/who-should-take-this-course</loc><lastmod>2026-07-01T03:30:32.963Z</lastmod></url>
<url><loc>https://www.designgurus.io/course-play/grokking-linkedin-coding-interview/doc/find-pivot-index-easy</loc><lastmod>2026-07-01T03:30:32.963Z</lastmod></url>
<url><loc>https://www.designgurus.io/course-play/grokking-linkedin-coding-interview/doc/solution-find-pivot-index</loc><lastmod>2026-07-01T03:30:32.963Z</lastmod></url>
<url><loc>https://www.designgurus.io/course-play/grokking-linkedin-coding-interview/doc/isomorphic-strings-easy</loc><lastmod>2026-07-01T03:30:32.963Z</lastmod></url>
<url><loc>https://www.designgurus.io/course-play/grokking-linkedin-coding-interview/doc/solution-isomorphic-strings</loc><lastmod>2026-07-01T03:30:32.963Z</lastmod></url>
<url><loc>https://www.designgurus.io/course-play/grokking-linkedin-coding-interview/doc/second-minimum-node-in-a-binary-tree-easy</loc><lastmod>2026-07-01T03:30:32.963Z</lastmod></url>
<url><loc>https://www.designgurus.io/course-play/grokking-linkedin-coding-interview/doc/solution-second-minimum-node-in-a-binary-tree</loc><lastmod>2026-07-01T03:30:32.963Z</lastmod></url>
<url><loc>https://www.designgurus.io/course-play/grokking-linkedin-coding-interview/doc/minimum-time-to-type-word-using-special-typewriter-easy</loc><lastmod>2026-07-01T03:30:32.963Z</lastmod></url>
<url><loc>https://www.designgurus.io/course-play/grokking-linkedin-coding-interview/doc/solution-minimum-time-to-type-word-using-special-typewriter</loc><lastmod>2026-07-01T03:30:32.963Z</lastmod></url>
<url><loc>https://www.designgurus.io/course-play/grokking-linkedin-coding-interview/doc/rotate-list-medium</loc><lastmod>2026-07-01T03:30:32.963Z</lastmod></url>
<url><loc>https://www.designgurus.io/course-play/grokking-linkedin-coding-interview/doc/solution-rotate-list</loc><lastmod>2026-07-01T03:30:32.963Z</lastmod></url>
<url><loc>https://www.designgurus.io/course-play/grokking-linkedin-coding-interview/doc/find-leaves-of-binary-tree-medium</loc><lastmod>2026-07-01T03:30:32.963Z</lastmod></url>
<url><loc>https://www.designgurus.io/course-play/grokking-linkedin-coding-interview/doc/solution-find-leaves-of-binary-tree</loc><lastmod>2026-07-01T03:30:32.963Z</lastmod></url>
<url><loc>https://www.designgurus.io/course-play/grokking-linkedin-coding-interview/doc/valid-triangle-number-medium</loc><lastmod>2026-07-01T03:30:32.963Z</lastmod></url>
<url><loc>https://www.designgurus.io/course-play/grokking-linkedin-coding-interview/doc/solution-valid-triangle-number</loc><lastmod>2026-07-01T03:30:32.963Z</lastmod></url>
<url><loc>https://www.designgurus.io/course-play/grokking-linkedin-coding-interview/doc/valid-parenthesis-string-medium</loc><lastmod>2026-07-01T03:30:32.963Z</lastmod></url>
<url><loc>https://www.designgurus.io/course-play/grokking-linkedin-coding-interview/doc/solution-valid-parenthesis-string</loc><lastmod>2026-07-01T03:30:32.963Z</lastmod></url>
<url><loc>https://www.designgurus.io/course-play/grokking-linkedin-coding-interview/doc/edit-distance-medium</loc><lastmod>2026-07-01T03:30:32.963Z</lastmod></url>
<url><loc>https://www.designgurus.io/course-play/grokking-linkedin-coding-interview/doc/solution-edit-distance</loc><lastmod>2026-07-01T03:30:32.963Z</lastmod></url>
<url><loc>https://www.designgurus.io/course-play/grokking-linkedin-coding-interview/doc/max-points-on-a-line-hard</loc><lastmod>2026-07-01T03:30:32.963Z</lastmod></url>
<url><loc>https://www.designgurus.io/course-play/grokking-linkedin-coding-interview/doc/solution-max-points-on-a-line</loc><lastmod>2026-07-01T03:30:32.963Z</lastmod></url>
<url><loc>https://www.designgurus.io/course-play/grokking-linkedin-coding-interview/doc/closest-binary-search-tree-value-ii-hard</loc><lastmod>2026-07-01T03:30:32.963Z</lastmod></url>
<url><loc>https://www.designgurus.io/course-play/grokking-linkedin-coding-interview/doc/solution-closest-binary-search-tree-value-ii</loc><lastmod>2026-07-01T03:30:32.963Z</lastmod></url>
<url><loc>https://www.designgurus.io/course-play/grokking-linkedin-coding-interview/doc/word-ladder-hard</loc><lastmod>2026-07-01T03:30:32.963Z</lastmod></url>
<url><loc>https://www.designgurus.io/course-play/grokking-linkedin-coding-interview/doc/solution-word-ladder</loc><lastmod>2026-07-01T03:30:32.963Z</lastmod></url>
</urlset>