<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9" xmlns:video="http://www.google.com/schemas/sitemap-video/1.1">
<url>
<loc>https://leettube.dev</loc>
<lastmod>2026-10-04T23:34:55.000Z</lastmod>
<changefreq>weekly</changefreq>
<priority>1</priority>
</url>
<url>
<loc>https://leettube.dev/watch/two-sum</loc>
<video:video>
<video:title>Two Sum (LeetCode 1)</video:title>
<video:thumbnail_loc>https://leettube.dev/posters/two-sum.jpg</video:thumbnail_loc>
<video:description>Find the two numbers that add up to the target. Walk once, and for each number look up the partner you need in a map of what you've seen.</video:description>
<video:content_loc>https://leettube.dev/api/video/two-sum.mp4</video:content_loc>
<video:duration>64</video:duration>
<video:publication_date>2026-10-04T23:30:20.000Z</video:publication_date>
</video:video>
<lastmod>2026-10-04T23:30:20.000Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://leettube.dev/watch/best-time-to-buy-stock</loc>
<video:video>
<video:title>Best Time to Buy and Sell Stock (LeetCode 121)</video:title>
<video:thumbnail_loc>https://leettube.dev/posters/best-time-to-buy-stock.jpg</video:thumbnail_loc>
<video:description>Buy one day, sell on a later day, for the biggest profit. Walk the prices once, remembering the cheapest day so far.</video:description>
<video:content_loc>https://leettube.dev/api/video/claude_videos_leetcode_best-time-to-buy-stock.mp4</video:content_loc>
<video:duration>92</video:duration>
<video:publication_date>2026-10-04T23:13:21.000Z</video:publication_date>
</video:video>
<lastmod>2026-10-04T23:13:21.000Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://leettube.dev/watch/valid-parentheses</loc>
<video:video>
<video:title>Valid Parentheses (LeetCode 20)</video:title>
<video:thumbnail_loc>https://leettube.dev/posters/valid-parentheses.jpg</video:thumbnail_loc>
<video:description>Check that every bracket is closed by the right type, in the right order. Push each opener, and match each closer against the top of the stack.</video:description>
<video:content_loc>https://leettube.dev/api/video/claude_videos_leetcode_valid-parentheses.mp4</video:content_loc>
<video:duration>96</video:duration>
<video:publication_date>2026-10-04T22:17:51.000Z</video:publication_date>
</video:video>
<lastmod>2026-10-04T22:17:51.000Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://leettube.dev/watch/binary-search</loc>
<video:video>
<video:title>Binary Search (LeetCode 704)</video:title>
<video:thumbnail_loc>https://leettube.dev/posters/binary-search.jpg</video:thumbnail_loc>
<video:description>Find a target in a sorted list. Check the middle and throw away the half that can't hold it, so each step halves the search.</video:description>
<video:content_loc>https://leettube.dev/api/video/claude_videos_leetcode_binary-search.mp4</video:content_loc>
<video:duration>99</video:duration>
<video:publication_date>2026-10-04T22:17:50.000Z</video:publication_date>
</video:video>
<lastmod>2026-10-04T22:17:50.000Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://leettube.dev/watch/linked-list-cycle</loc>
<video:video>
<video:title>Linked List Cycle (LeetCode 141)</video:title>
<video:thumbnail_loc>https://leettube.dev/posters/linked-list-cycle.jpg</video:thumbnail_loc>
<video:description>Does the list loop back on itself? Send a tortoise and a hare down it: if there's a cycle, the faster runner must catch the slower one.</video:description>
<video:content_loc>https://leettube.dev/api/video/claude_videos_leetcode_linked-list-cycle.mp4</video:content_loc>
<video:duration>85</video:duration>
<video:publication_date>2026-10-04T22:57:00.000Z</video:publication_date>
</video:video>
<lastmod>2026-10-04T22:57:00.000Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://leettube.dev/watch/merge-intervals</loc>
<video:video>
<video:title>Merge Intervals (LeetCode 56)</video:title>
<video:thumbnail_loc>https://leettube.dev/posters/merge-intervals.jpg</video:thumbnail_loc>
<video:description>Merge every overlapping interval. Sort by start, then either extend the last merged interval or start a new one.</video:description>
<video:content_loc>https://leettube.dev/api/video/claude_videos_leetcode_merge-intervals.mp4</video:content_loc>
<video:duration>99</video:duration>
<video:publication_date>2026-10-04T22:17:51.000Z</video:publication_date>
</video:video>
<lastmod>2026-10-04T22:17:51.000Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://leettube.dev/watch/top-k-frequent</loc>
<video:video>
<video:title>Top K Frequent (LeetCode 347)</video:title>
<video:thumbnail_loc>https://leettube.dev/posters/top-k-frequent.jpg</video:thumbnail_loc>
<video:description>Find the k values that appear most often. Tally them in a map, then keep a k-spot leaderboard in a min-heap instead of sorting everything.</video:description>
<video:content_loc>https://leettube.dev/api/video/claude_videos_leetcode_top-k-frequent.mp4</video:content_loc>
<video:duration>92</video:duration>
<video:publication_date>2026-10-04T22:57:01.000Z</video:publication_date>
</video:video>
<lastmod>2026-10-04T22:57:01.000Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://leettube.dev/watch/longest-substring</loc>
<video:video>
<video:title>Longest Substring (LeetCode 3)</video:title>
<video:thumbnail_loc>https://leettube.dev/posters/longest-substring.jpg</video:thumbnail_loc>
<video:description>Find the longest run of characters with no repeats. Slide a window along the string, and when a letter repeats, jump the left edge past its last copy.</video:description>
<video:content_loc>https://leettube.dev/api/video/longest-substring.mp4</video:content_loc>
<video:duration>95</video:duration>
<video:publication_date>2026-10-04T23:34:55.000Z</video:publication_date>
</video:video>
<lastmod>2026-10-04T23:34:55.000Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://leettube.dev/watch/subarray-sum-equals-k</loc>
<video:video>
<video:title>Subarray Sum Equals K (LeetCode 560)</video:title>
<video:thumbnail_loc>https://leettube.dev/posters/subarray-sum-equals-k.jpg</video:thumbnail_loc>
<video:description>Count the stretches of numbers that add up to k, negatives included. Keep a running total and a tally of totals seen, and look up the one that's k behind.</video:description>
<video:content_loc>https://leettube.dev/api/video/subarray-sum-equals-k.mp4</video:content_loc>
<video:duration>95</video:duration>
<video:publication_date>2026-10-04T23:34:55.000Z</video:publication_date>
</video:video>
<lastmod>2026-10-04T23:34:55.000Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://leettube.dev/watch/trapping-rain-water</loc>
<video:video>
<video:title>Trapping Rain Water (LeetCode 42)</video:title>
<video:thumbnail_loc>https://leettube.dev/posters/trapping-rain-water.jpg</video:thumbnail_loc>
<video:description>How much rain pools between the bars? Walk in from both ends, always moving the side with the lower wall, whose water is already decided.</video:description>
<video:content_loc>https://leettube.dev/api/video/claude_videos_leetcode_trapping-rain-water.mp4</video:content_loc>
<video:duration>95</video:duration>
<video:publication_date>2026-10-04T22:57:02.000Z</video:publication_date>
</video:video>
<lastmod>2026-10-04T22:57:02.000Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://leettube.dev/watch/largest-rectangle</loc>
<video:video>
<video:title>Largest Rectangle in Histogram (LeetCode 84)</video:title>
<video:thumbnail_loc>https://leettube.dev/posters/largest-rectangle.jpg</video:thumbnail_loc>
<video:description>The biggest rectangle under a histogram. Keep a stack of rising bars, and when a shorter bar arrives, pop and measure each taller one.</video:description>
<video:content_loc>https://leettube.dev/api/video/claude_videos_leetcode_largest-rectangle.mp4</video:content_loc>
<video:duration>95</video:duration>
<video:publication_date>2026-10-04T23:13:26.000Z</video:publication_date>
</video:video>
<lastmod>2026-10-04T23:13:26.000Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://leettube.dev/watch/invert-binary-tree</loc>
<video:video>
<video:title>Invert Binary Tree (LeetCode 226)</video:title>
<video:thumbnail_loc>https://leettube.dev/posters/invert-binary-tree.jpg</video:thumbnail_loc>
<video:description>Mirror a binary tree. Swap a node's two children, then do the same to each child, all the way down.</video:description>
<video:content_loc>https://leettube.dev/api/video/claude_videos_leetcode_invert-binary-tree.mp4</video:content_loc>
<video:duration>88</video:duration>
<video:publication_date>2026-10-04T22:57:01.000Z</video:publication_date>
</video:video>
<lastmod>2026-10-04T22:57:01.000Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://leettube.dev/watch/implement-trie</loc>
<video:video>
<video:title>Implement Trie (LeetCode 208)</video:title>
<video:thumbnail_loc>https://leettube.dev/posters/implement-trie.jpg</video:thumbnail_loc>
<video:description>Insert words, search them and check prefixes. A tree of letters lets words that share a prefix share a path.</video:description>
<video:content_loc>https://leettube.dev/api/video/claude_videos_leetcode_implement-trie.mp4</video:content_loc>
<video:duration>93</video:duration>
<video:publication_date>2026-10-04T23:13:23.000Z</video:publication_date>
</video:video>
<lastmod>2026-10-04T23:13:23.000Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://leettube.dev/watch/subsets</loc>
<video:video>
<video:title>Subsets (LeetCode 78)</video:title>
<video:thumbnail_loc>https://leettube.dev/posters/subsets.jpg</video:thumbnail_loc>
<video:description>List every subset of a set of distinct numbers, empty one included. For each number, branch on taking it or leaving it.</video:description>
<video:content_loc>https://leettube.dev/api/video/claude_videos_leetcode_subsets.mp4</video:content_loc>
<video:duration>97</video:duration>
<video:publication_date>2026-10-04T22:17:49.000Z</video:publication_date>
</video:video>
<lastmod>2026-10-04T22:17:49.000Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://leettube.dev/watch/house-robber</loc>
<video:video>
<video:title>House Robber (LeetCode 198)</video:title>
<video:thumbnail_loc>https://leettube.dev/posters/house-robber.jpg</video:thumbnail_loc>
<video:description>Rob the most cash from a row of houses without hitting two neighbours. Carry the best haul so far, one house at a time.</video:description>
<video:content_loc>https://leettube.dev/api/video/claude_videos_leetcode_house-robber.mp4</video:content_loc>
<video:duration>85</video:duration>
<video:publication_date>2026-10-04T22:17:49.000Z</video:publication_date>
</video:video>
<lastmod>2026-10-04T22:17:49.000Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://leettube.dev/watch/coin-change</loc>
<video:video>
<video:title>Coin Change (LeetCode 322)</video:title>
<video:thumbnail_loc>https://leettube.dev/posters/coin-change.jpg</video:thumbnail_loc>
<video:description>The fewest coins that add up to an amount. Greedy fails, so build up from zero, reusing the best answer for each smaller amount.</video:description>
<video:content_loc>https://leettube.dev/api/video/claude_videos_leetcode_coin-change.mp4</video:content_loc>
<video:duration>97</video:duration>
<video:publication_date>2026-10-04T23:13:24.000Z</video:publication_date>
</video:video>
<lastmod>2026-10-04T23:13:24.000Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://leettube.dev/watch/edit-distance</loc>
<video:video>
<video:title>Edit Distance (LeetCode 72)</video:title>
<video:thumbnail_loc>https://leettube.dev/posters/edit-distance.jpg</video:thumbnail_loc>
<video:description>The fewest inserts, deletes and replaces to turn one word into another. Fill a table where each cell takes the cheapest of three neighbours.</video:description>
<video:content_loc>https://leettube.dev/api/video/claude_videos_leetcode_edit-distance.mp4</video:content_loc>
<video:duration>98</video:duration>
<video:publication_date>2026-10-04T22:57:02.000Z</video:publication_date>
</video:video>
<lastmod>2026-10-04T22:57:02.000Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://leettube.dev/watch/number-of-islands</loc>
<video:video>
<video:title>Number of Islands (LeetCode 200)</video:title>
<video:thumbnail_loc>https://leettube.dev/posters/number-of-islands.jpg</video:thumbnail_loc>
<video:description>Count the islands in a grid of land and water. Scan for land, and sink each island you find so it's only counted once.</video:description>
<video:content_loc>https://leettube.dev/api/video/claude_videos_leetcode_number-of-islands.mp4</video:content_loc>
<video:duration>99</video:duration>
<video:publication_date>2026-10-04T22:17:50.000Z</video:publication_date>
</video:video>
<lastmod>2026-10-04T22:17:50.000Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://leettube.dev/watch/course-schedule</loc>
<video:video>
<video:title>Course Schedule (LeetCode 207)</video:title>
<video:thumbnail_loc>https://leettube.dev/posters/course-schedule.jpg</video:thumbnail_loc>
<video:description>Decide whether you can finish every course given its prerequisites. Take courses with no locks left, and see if every course gets taken.</video:description>
<video:content_loc>https://leettube.dev/api/video/claude_videos_leetcode_course-schedule.mp4</video:content_loc>
<video:duration>104</video:duration>
<video:publication_date>2026-10-04T22:17:52.000Z</video:publication_date>
</video:video>
<lastmod>2026-10-04T22:17:52.000Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://leettube.dev/watch/network-delay-time</loc>
<video:video>
<video:title>Network Delay Time (LeetCode 743)</video:title>
<video:thumbnail_loc>https://leettube.dev/posters/network-delay-time.jpg</video:thumbnail_loc>
<video:description>How long until a signal reaches every tower? Dijkstra's algorithm settles the earliest arrival first, using a min-heap.</video:description>
<video:content_loc>https://leettube.dev/api/video/claude_videos_leetcode_network-delay-time.mp4</video:content_loc>
<video:duration>96</video:duration>
<video:publication_date>2026-10-04T22:57:02.000Z</video:publication_date>
</video:video>
<lastmod>2026-10-04T22:57:02.000Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://leettube.dev/watch/lru-cache</loc>
<video:video>
<video:title>LRU Cache (LeetCode 146)</video:title>
<video:thumbnail_loc>https://leettube.dev/posters/lru-cache.jpg</video:thumbnail_loc>
<video:description>A fixed-size cache with constant-time get and put that evicts the least recently used key. A hash map finds the node, and a linked list keeps the order.</video:description>
<video:content_loc>https://leettube.dev/api/video/claude_videos_leetcode_lru-cache.mp4</video:content_loc>
<video:duration>94</video:duration>
<video:publication_date>2026-10-04T23:13:22.000Z</video:publication_date>
</video:video>
<lastmod>2026-10-04T23:13:22.000Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
</urlset>
