<?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://mik-academy.vercel.app/dsa/arrays/two-sum-leetcode-1</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/TCaBnVIllrQ/hqdefault.jpg</video:thumbnail_loc><video:title>Two Sum | Leetcode 1 | Detailed Explanation | codestorywithMIK</video:title><video:description>Two Sum | Leetcode 1 | Detailed Explanation | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/TCaBnVIllrQ</video:player_loc><video:duration>744</video:duration><video:publication_date>2022-07-06T20:08:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/two-sum-ii-input-array-is-sorted-leetcode-167</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/gsSLay-wcaw/hqdefault.jpg</video:thumbnail_loc><video:title>Two Sum II - Input Array Is Sorted : Explanation ➕ Live Coding 🧑🏻‍💻 (In Hinglish)</video:title><video:description>Two Sum II - Input Array Is Sorted : Explanation ➕ Live Coding 🧑🏻‍💻 (In Hinglish). Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/gsSLay-wcaw</video:player_loc><video:duration>613</video:duration><video:publication_date>2022-07-07T13:22:17.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/3sum-leetcode-15</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/_cBWWebTVpI/hqdefault.jpg</video:thumbnail_loc><video:title>3 SUM | Detailed Explanation | Leetcode 15 | codestorywithMIK</video:title><video:description>3 SUM | Detailed Explanation | Leetcode 15 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/_cBWWebTVpI</video:player_loc><video:duration>2143</video:duration><video:publication_date>2022-07-09T03:51:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/trapping-rain-water-leetcode-42</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/f2QgmVxPiS4/hqdefault.jpg</video:thumbnail_loc><video:title>Trapping Rain Water | without stack | Made Super Easy | Leetcode 42 | codestorywithMIK</video:title><video:description>Trapping Rain Water | without stack | Made Super Easy | Leetcode 42 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/f2QgmVxPiS4</video:player_loc><video:duration>1200</video:duration><video:publication_date>2022-07-10T17:50:35.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/3sum-closest-leetcode-16</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/hGLjwiPRh0U/hqdefault.jpg</video:thumbnail_loc><video:title>3Sum Closest - (Meta, Amazon, Microsoft, Oracle)➕Live Coding 🧑🏻‍💻</video:title><video:description>3Sum Closest - (Meta, Amazon, Microsoft, Oracle)➕Live Coding 🧑🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/hGLjwiPRh0U</video:player_loc><video:duration>871</video:duration><video:publication_date>2022-07-11T23:30:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/factorial-of-large-numbers-microsoft-makemytrip-adobe-explanation-live-coding</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/O3fwYjcMV_M/hqdefault.jpg</video:thumbnail_loc><video:title>Factorial Of Large Numbers - (Microsoft, MakeMyTrip, Adobe):Explanation ➕ Live Coding 🧑🏻‍💻👩🏻‍💻</video:title><video:description>Factorial Of Large Numbers - (Microsoft, MakeMyTrip, Adobe):Explanation ➕ Live Coding 🧑🏻‍💻👩🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/O3fwYjcMV_M</video:player_loc><video:duration>1037</video:duration><video:publication_date>2022-07-15T23:30:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/next-permutation-leetcode-31</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/CboKBIpo640/hqdefault.jpg</video:thumbnail_loc><video:title>Next Permutation | Google | Microsoft | Amazon | Leetcode 31</video:title><video:description>Next Permutation | Google | Microsoft | Amazon | Leetcode 31. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/CboKBIpo640</video:player_loc><video:duration>1545</video:duration><video:publication_date>2022-07-20T00:30:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/rotate-image-leetcode-48</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/I48Z8QlQH8c/hqdefault.jpg</video:thumbnail_loc><video:title>Rotate Image | Simplest Explanation | Detailed | Leetcode 48 | codestorywithMIK</video:title><video:description>Rotate Image | Simplest Explanation | Detailed | Leetcode 48 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/I48Z8QlQH8c</video:player_loc><video:duration>571</video:duration><video:publication_date>2022-07-24T23:30:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/container-with-most-water-leetcode-11</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/KVU4JNNJkVg/hqdefault.jpg</video:thumbnail_loc><video:title>Container With Most Water | Detailed | With Dry Runs | Leetcode 11 | codestorywithMIK</video:title><video:description>Container With Most Water | Detailed | With Dry Runs | Leetcode 11 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/KVU4JNNJkVg</video:player_loc><video:duration>1118</video:duration><video:publication_date>2022-08-03T04:23:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/spiral-matrix-leetcode-54</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/73j2ipxR958/hqdefault.jpg</video:thumbnail_loc><video:title>Spiral Matrix | Leetcode-54 | Amazon, Microsoft, Paytm | Explanation ➕ Live Coding 🧑🏻‍💻👩🏻‍💻</video:title><video:description>Spiral Matrix | Leetcode-54 | Amazon, Microsoft, Paytm | Explanation ➕ Live Coding 🧑🏻‍💻👩🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/73j2ipxR958</video:player_loc><video:duration>1613</video:duration><video:publication_date>2022-08-09T23:30:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/group-anagrams-leetcode-49</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/TNe3gF4r128/hqdefault.jpg</video:thumbnail_loc><video:title>Group Anagrams | using sorting | Google | Leetcode 49</video:title><video:description>Group Anagrams | using sorting | Google | Leetcode 49. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/TNe3gF4r128</video:player_loc><video:duration>696</video:duration><video:publication_date>2022-08-24T15:34:56.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/group-anagrams-leetcode-49-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/--k5-3EOObs/hqdefault.jpg</video:thumbnail_loc><video:title>Group Anagrams | without sorting | Google | Leetcode 49</video:title><video:description>Group Anagrams | without sorting | Google | Leetcode 49. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/--k5-3EOObs</video:player_loc><video:duration>864</video:duration><video:publication_date>2022-08-25T15:23:34.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/sort-the-matrix-diagonally-leetcode-1329</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/mNWwJQ7_z4Q/hqdefault.jpg</video:thumbnail_loc><video:title>Sort the Matrix Diagonally | Leetcode 1329 | Similar to Leetcode 498 | codestorywithMIK</video:title><video:description>Sort the Matrix Diagonally | Leetcode 1329 | Similar to Leetcode 498 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/mNWwJQ7_z4Q</video:player_loc><video:duration>1442</video:duration><video:publication_date>2022-08-28T08:11:41.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/diagonal-traverse-leetcode-498</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/7HAKiGZSrWc/hqdefault.jpg</video:thumbnail_loc><video:title>Diagonal Traverse | Leetcode 498 | Similar to Leetcode 1329 | codestorywithMIK</video:title><video:description>Diagonal Traverse | Leetcode 498 | Similar to Leetcode 1329 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/7HAKiGZSrWc</video:player_loc><video:duration>784</video:duration><video:publication_date>2022-08-29T02:30:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/sort-colors-leetcode-75</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/KDiZ3jGXxO8/hqdefault.jpg</video:thumbnail_loc><video:title>Sort Colors | Easy Explanation | Amazon | codestorywithMIK</video:title><video:description>Sort Colors | Easy Explanation | Amazon | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/KDiZ3jGXxO8</video:player_loc><video:duration>848</video:duration><video:publication_date>2022-09-04T11:25:52.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/find-original-array-from-doubled-array-leetcode-2007</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ZfoOyJkD-lo/hqdefault.jpg</video:thumbnail_loc><video:title>Find Original Array From Doubled Array | Google | Easy Explanation | codestorywithMIK</video:title><video:description>Find Original Array From Doubled Array | Google | Easy Explanation | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ZfoOyJkD-lo</video:player_loc><video:duration>895</video:duration><video:publication_date>2022-09-16T01:30:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/sum-of-even-numbers-after-queries-leetcode-985</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/pA4fX-Mvkyw/hqdefault.jpg</video:thumbnail_loc><video:title>Sum of Even Numbers After Queries-(Asked in Indeed): Explanation ➕ Live Coding 🧑🏻‍💻👩🏻‍💻</video:title><video:description>Sum of Even Numbers After Queries-(Asked in Indeed): Explanation ➕ Live Coding 🧑🏻‍💻👩🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/pA4fX-Mvkyw</video:player_loc><video:duration>1207</video:duration><video:publication_date>2022-09-21T12:38:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/find-pivot-index-leetcode-724</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Q0Qat25D6JE/hqdefault.jpg</video:thumbnail_loc><video:title>Find Pivot Index | Amazon | Adobe | Leetcode 724</video:title><video:description>Find Pivot Index | Amazon | Adobe | Leetcode 724. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Q0Qat25D6JE</video:player_loc><video:duration>906</video:duration><video:publication_date>2022-10-08T16:29:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/increasing-triplet-subsequence-leetcode-334</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/-tqUs4Qt9TU/hqdefault.jpg</video:thumbnail_loc><video:title>Increasing Triplet Subsequence -(Amazon, Walmart, Facebook): Explanation ➕ Live Coding 🧑🏻‍💻</video:title><video:description>Increasing Triplet Subsequence -(Amazon, Walmart, Facebook): Explanation ➕ Live Coding 🧑🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/-tqUs4Qt9TU</video:player_loc><video:duration>1472</video:duration><video:publication_date>2022-10-11T15:09:51.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/largest-perimeter-triangle-leetcode-976</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/wukuOrHM3eg/hqdefault.jpg</video:thumbnail_loc><video:title>Largest Perimeter Triangle | Easy Explanation | Leetcode 976 | codestorywithMIK</video:title><video:description>Largest Perimeter Triangle | Easy Explanation | Leetcode 976 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/wukuOrHM3eg</video:player_loc><video:duration>666</video:duration><video:publication_date>2022-10-12T15:03:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/contains-duplicate-ii-leetcode-219</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/B5v3KZpRreQ/hqdefault.jpg</video:thumbnail_loc><video:title>Contains Duplicate II -(Airbnb, Palantir Technologies): Explanation ➕ Live Coding 🧑🏻‍💻</video:title><video:description>Contains Duplicate II -(Airbnb, Palantir Technologies): Explanation ➕ Live Coding 🧑🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/B5v3KZpRreQ</video:player_loc><video:duration>670</video:duration><video:publication_date>2022-10-21T02:55:48.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/set-mismatch-leetcode-645</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/j89Yzq3IwVY/hqdefault.jpg</video:thumbnail_loc><video:title>Set Mismatch | Better Approach | Amazon | Leetcode 645</video:title><video:description>Set Mismatch | Better Approach | Amazon | Leetcode 645. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/j89Yzq3IwVY</video:player_loc><video:duration>1156</video:duration><video:publication_date>2022-10-23T05:00:43.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/continuous-subarray-sum-leetcode-523</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/wmn3c1mP0pY/hqdefault.jpg</video:thumbnail_loc><video:title>Continuous Subarray Sum | Clear Explanation | Leetcode 523 | codestorywithMIK</video:title><video:description>Continuous Subarray Sum | Clear Explanation | Leetcode 523 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/wmn3c1mP0pY</video:player_loc><video:duration>1301</video:duration><video:publication_date>2022-10-26T05:19:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/image-overlap-leetcode-835</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/3--u8aPXzWs/hqdefault.jpg</video:thumbnail_loc><video:title>Image Overlap | Easy Explanation | Leetcode 835 | codestorywithMIK</video:title><video:description>Image Overlap | Easy Explanation | Leetcode 835 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/3--u8aPXzWs</video:player_loc><video:duration>1736</video:duration><video:publication_date>2022-10-27T10:25:18.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/shortest-path-in-a-grid-with-obstacles-elimination-leetcode-1293</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/zpOhlTndBv0/hqdefault.jpg</video:thumbnail_loc><video:title>Shortest Path in a Grid with Obstacles Elimination -(Google) : Explanation ➕ Live Coding</video:title><video:description>Shortest Path in a Grid with Obstacles Elimination -(Google) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/zpOhlTndBv0</video:player_loc><video:duration>1607</video:duration><video:publication_date>2022-10-30T07:19:34.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/toeplitz-matrix-leetcode-766</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/q-WIid5qu-I/hqdefault.jpg</video:thumbnail_loc><video:title>Toeplitz Matrix -(Google, Meta, Apple) : Explanation ➕ Live Coding</video:title><video:description>Toeplitz Matrix -(Google, Meta, Apple) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/q-WIid5qu-I</video:player_loc><video:duration>588</video:duration><video:publication_date>2022-10-31T12:24:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/where-will-the-ball-fall-leetcode-1706</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ElWwrlPe0qc/hqdefault.jpg</video:thumbnail_loc><video:title>Where Will the Ball Fall -(Amazon) : Explanation ➕ Live Coding</video:title><video:description>Where Will the Ball Fall -(Amazon) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ElWwrlPe0qc</video:player_loc><video:duration>1224</video:duration><video:publication_date>2022-11-01T14:53:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/valid-sudoku-leetcode-36</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/dGZjzA9zLW8/hqdefault.jpg</video:thumbnail_loc><video:title>Valid Sudoku | 2 Approaches | Leetcode 36 | codestorywithMIK</video:title><video:description>Valid Sudoku | 2 Approaches | Leetcode 36 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/dGZjzA9zLW8</video:player_loc><video:duration>2474</video:duration><video:publication_date>2022-11-23T13:04:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/minimum-average-difference-leetcode-2256</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/odP1T58kNQY/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Average Difference | Made Easy | Leetcode 2256 | codestorywithMIK</video:title><video:description>Minimum Average Difference | Made Easy | Leetcode 2256 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/odP1T58kNQY</video:player_loc><video:duration>1307</video:duration><video:publication_date>2022-12-04T03:59:34.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/longest-subsequence-with-limited-sum-leetcode-2389</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/rRFROtG1Y94/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Subsequence With Limited Sum  : Explanation ➕ Live Coding👩🏻‍💻🧑🏻‍💻🤯😱</video:title><video:description>Longest Subsequence With Limited Sum  : Explanation ➕ Live Coding👩🏻‍💻🧑🏻‍💻🤯😱. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/rRFROtG1Y94</video:player_loc><video:duration>1991</video:duration><video:publication_date>2022-12-25T08:47:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/minimum-number-of-arrows-to-burst-balloons-leetcode-452</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/zfcGwzfDNu0/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Number of Arrows to Burst Balloons | Leetcode 452 | Google | codestorywithMIK</video:title><video:description>Minimum Number of Arrows to Burst Balloons | Leetcode 452 | Google | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/zfcGwzfDNu0</video:player_loc><video:duration>1420</video:duration><video:publication_date>2023-01-05T07:22:53.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/insert-interval-leetcode-57</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/XXaVIDIbUn4/hqdefault.jpg</video:thumbnail_loc><video:title>Insert Interval | Brute Force | Optimal | Google | Apple | codestorywithMIK</video:title><video:description>Insert Interval | Brute Force | Optimal | Google | Apple | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/XXaVIDIbUn4</video:player_loc><video:duration>1475</video:duration><video:publication_date>2023-01-16T07:52:58.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/maximum-sum-circular-subarray-leetcode-918</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Za8V4wkZKkM/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Sum Circular Subarray | With Proof | Leetcode 918 | codestorywithMIK</video:title><video:description>Maximum Sum Circular Subarray | With Proof | Leetcode 918 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Za8V4wkZKkM</video:player_loc><video:duration>1855</video:duration><video:publication_date>2023-01-18T06:50:35.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/subarray-sums-divisible-by-k-leetcode-974</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/7Xeorb721LQ/hqdefault.jpg</video:thumbnail_loc><video:title>Subarray Sums Divisible by K | Brute Force | Optimal | Easy Explanation | codestorywithMIK</video:title><video:description>Subarray Sums Divisible by K | Brute Force | Optimal | Easy Explanation | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/7Xeorb721LQ</video:player_loc><video:duration>2153</video:duration><video:publication_date>2023-01-19T12:32:18.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/find-the-town-judge-leetcode-997</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ottPfSr3xls/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Town Judge | 2 Approaches | Leetcode 997</video:title><video:description>Find the Town Judge | 2 Approaches | Leetcode 997. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ottPfSr3xls</video:player_loc><video:duration>643</video:duration><video:publication_date>2023-01-23T03:44:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/snakes-and-ladders-leetcode-909</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/26IT3FYm5h8/hqdefault.jpg</video:thumbnail_loc><video:title>Snakes and Ladders | Detailed Reason | Leetcode 909 | codestorywithMIK</video:title><video:description>Snakes and Ladders | Detailed Reason | Leetcode 909 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/26IT3FYm5h8</video:player_loc><video:duration>2664</video:duration><video:publication_date>2023-01-24T13:51:25.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/data-stream-as-disjoint-intervals-leetcode-352</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Lh0PXb3Hqik/hqdefault.jpg</video:thumbnail_loc><video:title>Data Stream as Disjoint Intervals - (AMAZON) : Explanation ➕ Live Coding</video:title><video:description>Data Stream as Disjoint Intervals - (AMAZON) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Lh0PXb3Hqik</video:player_loc><video:duration>2299</video:duration><video:publication_date>2023-01-28T05:05:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/jump-game-iv-leetcode-1345</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/tr1WHelOhJU/hqdefault.jpg</video:thumbnail_loc><video:title>Jump Game IV | Leetcode 1345 | Detailed | Intuition | codestorywithMIK</video:title><video:description>Jump Game IV | Leetcode 1345 | Detailed | Intuition | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/tr1WHelOhJU</video:player_loc><video:duration>1264</video:duration><video:publication_date>2023-03-05T06:47:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/can-place-flowers-leetcode-605</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/dNBXGp8BgoI/hqdefault.jpg</video:thumbnail_loc><video:title>Can Place Flowers - (Leetcode - 605) - (GOOGLE) : Explanation ➕ Live Coding</video:title><video:description>Can Place Flowers - (Leetcode - 605) - (GOOGLE) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/dNBXGp8BgoI</video:player_loc><video:duration>511</video:duration><video:publication_date>2023-03-20T18:01:41.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/number-of-zero-filled-subarrays-leetcode-2348</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5sC5MUcF-Qc/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Zero-Filled Subarrays | 2 Approaches | Leetcode 2348 | Meta | codestorywithMIK</video:title><video:description>Number of Zero-Filled Subarrays | 2 Approaches | Leetcode 2348 | Meta | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5sC5MUcF-Qc</video:player_loc><video:duration>1000</video:duration><video:publication_date>2023-03-21T12:49:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/number-of-closed-islands-leetcode-1254</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/dMn6NPk9nPw/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Closed Islands | Story to code | Google | Leetcode 1254 | codestorywithMIK</video:title><video:description>Number of Closed Islands | Story to code | Google | Leetcode 1254 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/dMn6NPk9nPw</video:player_loc><video:duration>1136</video:duration><video:publication_date>2023-04-06T15:33:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/number-of-enclaves-leetcode-1020</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/dYOm367BdbM/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Enclaves - (Leetcode - 1020) - (AMAZON) : Explanation ➕ Live Coding 🧑🏻‍💻👩🏻‍💻</video:title><video:description>Number of Enclaves - (Leetcode - 1020) - (AMAZON) : Explanation ➕ Live Coding 🧑🏻‍💻👩🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/dYOm367BdbM</video:player_loc><video:duration>935</video:duration><video:publication_date>2023-04-07T05:15:43.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/kids-with-the-greatest-number-of-candies-leetcode-1431</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ZUEKt3TAYLc/hqdefault.jpg</video:thumbnail_loc><video:title>Kids With the Greatest Number of Candies - (Leetcode - 1431) - : Explanation ➕ Live Coding</video:title><video:description>Kids With the Greatest Number of Candies - (Leetcode - 1431) - : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ZUEKt3TAYLc</video:player_loc><video:duration>348</video:duration><video:publication_date>2023-04-17T03:31:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/spiral-matrix-ii-leetcode-59</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/HXdCemhtrNA/hqdefault.jpg</video:thumbnail_loc><video:title>Spiral Matrix II | Leetcode-59 | Amazon, Microsoft, Paytm | Explanation ➕ Live Coding</video:title><video:description>Spiral Matrix II | Leetcode-59 | Amazon, Microsoft, Paytm | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/HXdCemhtrNA</video:player_loc><video:duration>1081</video:duration><video:publication_date>2023-05-10T15:11:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/shortest-bridge-leetcode-934</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/GSE0-dReL6Y/hqdefault.jpg</video:thumbnail_loc><video:title>Shortest Bridge | Leetcode-934 | DFS + BFS | MICROSOFT | Explanation ➕ Live Coding</video:title><video:description>Shortest Bridge | Leetcode-934 | DFS + BFS | MICROSOFT | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/GSE0-dReL6Y</video:player_loc><video:duration>1609</video:duration><video:publication_date>2023-05-21T08:01:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/count-negative-numbers-in-a-sorted-matrix-leetcode-1351</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/z2OLKbbNYQE/hqdefault.jpg</video:thumbnail_loc><video:title>Count Negative Numbers in a Sorted Matrix | Leetcode 1351 | 3 Approaches | codestorywithMIK</video:title><video:description>Count Negative Numbers in a Sorted Matrix | Leetcode 1351 | 3 Approaches | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/z2OLKbbNYQE</video:player_loc><video:duration>1854</video:duration><video:publication_date>2023-06-08T13:08:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/summary-ranges-leetcode-228</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/PyYZCJRAMmY/hqdefault.jpg</video:thumbnail_loc><video:title>Summary Ranges | Leetcode-228 | GOOGLE | Explanation ➕ Live Coding</video:title><video:description>Summary Ranges | Leetcode-228 | GOOGLE | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/PyYZCJRAMmY</video:player_loc><video:duration>784</video:duration><video:publication_date>2023-06-12T02:59:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/k-radius-subarray-averages-leetcode-2090</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/RSE_GB0eBZY/hqdefault.jpg</video:thumbnail_loc><video:title>K Radius Subarray Averages | Leetcode-2090 | AMAZON | Explanation ➕ Live Coding</video:title><video:description>K Radius Subarray Averages | Leetcode-2090 | AMAZON | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/RSE_GB0eBZY</video:player_loc><video:duration>1485</video:duration><video:publication_date>2023-06-20T08:30:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/shortest-path-to-get-all-keys-leetcode-864</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/yt6bi_g4C0I/hqdefault.jpg</video:thumbnail_loc><video:title>Shortest Path to Get All Keys | Full Detail | Leetcode-864 | GOOGLE | Explanation ➕ Live Coding</video:title><video:description>Shortest Path to Get All Keys | Full Detail | Leetcode-864 | GOOGLE | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/yt6bi_g4C0I</video:player_loc><video:duration>1892</video:duration><video:publication_date>2023-06-29T12:07:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/array-partition-leetcode-2551</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/L-KWU8W3OqE/hqdefault.jpg</video:thumbnail_loc><video:title>Put Marbles in Bags | Full Intuition | Dry Run | Leetcode 2551 | AMAZON | codestorywithMIK</video:title><video:description>Put Marbles in Bags | Full Intuition | Dry Run | Leetcode 2551 | AMAZON | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/L-KWU8W3OqE</video:player_loc><video:duration>1596</video:duration><video:publication_date>2023-07-08T08:57:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/meeting-rooms-leetcode-435</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/0TYKyTwGOAs/hqdefault.jpg</video:thumbnail_loc><video:title>Non-overlapping Intervals | 2 Approaches | Intuition | Dry Run | Leetcode-435 | GOOGLE | Explanation</video:title><video:description>Non-overlapping Intervals | 2 Approaches | Intuition | Dry Run | Leetcode-435 | GOOGLE | Explanation. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/0TYKyTwGOAs</video:player_loc><video:duration>2223</video:duration><video:publication_date>2023-07-19T03:31:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/kth-largest-element-in-an-array-leetcode-215</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QFoNfrP7knk/hqdefault.jpg</video:thumbnail_loc><video:title>Kth Largest Element in an Array | Quick Select | Time Complexity | MICROSOFT | Leetcode-215</video:title><video:description>Kth Largest Element in an Array | Quick Select | Time Complexity | MICROSOFT | Leetcode-215. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QFoNfrP7knk</video:player_loc><video:duration>1778</video:duration><video:publication_date>2023-08-14T15:18:56.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/01-matrix-leetcode-542</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/gu2MD0mpy9w/hqdefault.jpg</video:thumbnail_loc><video:title>01 Matrix | Detailed Dry Run | Why BFS from 0s | GOOGLE | Leetcode - 542</video:title><video:description>01 Matrix | Detailed Dry Run | Why BFS from 0s | GOOGLE | Leetcode - 542. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/gu2MD0mpy9w</video:player_loc><video:duration>1139</video:duration><video:publication_date>2023-08-17T03:57:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/minimum-penalty-for-a-shop-leetcode-2483</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/XHgelA78SGs/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Penalty for a Shop | MULTIPLE APPROACHES | Dry Run | Leetcode 2483 | codestorywithMIK</video:title><video:description>Minimum Penalty for a Shop | MULTIPLE APPROACHES | Dry Run | Leetcode 2483 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/XHgelA78SGs</video:player_loc><video:duration>3328</video:duration><video:publication_date>2023-08-29T09:34:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/pascals-triangle-leetcode-118</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/jC0wWjBrKss/hqdefault.jpg</video:thumbnail_loc><video:title>Pascal&apos;s Triangle | Simplest Approach | Application | DRY RUN | Adobe | Amazon | Leetcode - 118</video:title><video:description>Pascal&apos;s Triangle | Simplest Approach | Application | DRY RUN | Adobe | Amazon | Leetcode - 118. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/jC0wWjBrKss</video:player_loc><video:duration>886</video:duration><video:publication_date>2023-09-08T03:14:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/group-the-people-given-the-group-size-they-belong-to-leetcode-1282</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QFjOkJt5hrI/hqdefault.jpg</video:thumbnail_loc><video:title>Group the People Given the Group Size They Belong To | Dry Run | LYFT | Leetcode - 1282</video:title><video:description>Group the People Given the Group Size They Belong To | Dry Run | LYFT | Leetcode - 1282. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QFjOkJt5hrI</video:player_loc><video:duration>886</video:duration><video:publication_date>2023-09-11T03:20:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/the-k-weakest-rows-in-a-matrix-leetcode-1337</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/X1ZG-CXkmEM/hqdefault.jpg</video:thumbnail_loc><video:title>The K Weakest Rows in a Matrix | 2 Approaches | Binary Search | Heap | Sorting | Leetcode - 1337</video:title><video:description>The K Weakest Rows in a Matrix | 2 Approaches | Binary Search | Heap | Sorting | Leetcode - 1337. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/X1ZG-CXkmEM</video:player_loc><video:duration>1748</video:duration><video:publication_date>2023-09-18T04:21:38.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/find-the-duplicate-number-leetcode-287</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/49HrEGt6D2s/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Duplicate Number | With Proof | Follow Up Qns | Hare And Tortoise | Leetcode - 287</video:title><video:description>Find the Duplicate Number | With Proof | Follow Up Qns | Hare And Tortoise | Leetcode - 287. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/49HrEGt6D2s</video:player_loc><video:duration>1607</video:duration><video:publication_date>2023-09-19T03:19:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/minimum-operations-to-reduce-x-to-zero-leetcode-1658</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/w7u9sMlx7zc/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Operations to Reduce X to Zero | 2 Approaches | Recursion | Hashmap | Leetcode - 1658</video:title><video:description>Minimum Operations to Reduce X to Zero | 2 Approaches | Recursion | Hashmap | Leetcode - 1658. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/w7u9sMlx7zc</video:player_loc><video:duration>1919</video:duration><video:publication_date>2023-09-20T04:28:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/median-of-two-sorted-arrays-leetcode-4</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/6D9T2ZY8h5c/hqdefault.jpg</video:thumbnail_loc><video:title>Median of Two Sorted Arrays | PART-1 | Brute Force | Better Approach | Google | Apple | Leetcode - 4</video:title><video:description>Median of Two Sorted Arrays | PART-1 | Brute Force | Better Approach | Google | Apple | Leetcode - 4. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/6D9T2ZY8h5c</video:player_loc><video:duration>1930</video:duration><video:publication_date>2023-09-21T09:03:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/sort-array-by-parity-leetcode-905</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/fMzddofgQOk/hqdefault.jpg</video:thumbnail_loc><video:title>Sort Array By Parity | 3 Approaches | Custom Comparator | META | Leetcode - 905</video:title><video:description>Sort Array By Parity | 3 Approaches | Custom Comparator | META | Leetcode - 905. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/fMzddofgQOk</video:player_loc><video:duration>794</video:duration><video:publication_date>2023-09-28T03:10:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/monotonic-array-leetcode-896</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/LfYSyPP6YOA/hqdefault.jpg</video:thumbnail_loc><video:title>Monotonic Array | Simple | Clean | META | Leetcode - 896 | Live Coding | Explanation</video:title><video:description>Monotonic Array | Simple | Clean | META | Leetcode - 896 | Live Coding | Explanation. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/LfYSyPP6YOA</video:player_loc><video:duration>433</video:duration><video:publication_date>2023-09-29T05:54:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/majority-element-leetcode-229</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Q6L5SoS-fTo/hqdefault.jpg</video:thumbnail_loc><video:title>Majority Element I | Majority Element II  | Boyer-Moore | Made Simple | Leetcode 229 | Leetcode 169</video:title><video:description>Majority Element I | Majority Element II  | Boyer-Moore | Made Simple | Leetcode 229 | Leetcode 169. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Q6L5SoS-fTo</video:player_loc><video:duration>1910</video:duration><video:publication_date>2023-10-05T10:35:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/minimum-number-of-operations-to-make-array-continuous-leetcode-2009</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/LqtcUyPBWrY/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Number of Operations to Make Array Continuous | Brute Force | Optimal | Leetcode - 2009</video:title><video:description>Minimum Number of Operations to Make Array Continuous | Brute Force | Optimal | Leetcode - 2009. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/LqtcUyPBWrY</video:player_loc><video:duration>2118</video:duration><video:publication_date>2023-10-10T12:28:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/pascals-triangle-ii-leetcode-119</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ocGDVKYJKVo/hqdefault.jpg</video:thumbnail_loc><video:title>Pascal&apos;s Triangle II | Using Same Code of Pascal&apos;s Triangle I | AMAZON | Leetcode - 119</video:title><video:description>Pascal&apos;s Triangle II | Using Same Code of Pascal&apos;s Triangle I | AMAZON | Leetcode - 119. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ocGDVKYJKVo</video:player_loc><video:duration>942</video:duration><video:publication_date>2023-10-16T09:41:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/last-moment-before-all-ants-fall-out-of-a-plank-leetcode-1503</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/JaJkEI-0zdI/hqdefault.jpg</video:thumbnail_loc><video:title>Last Moment Before All Ants Fall Out of a Plank | Easy Explanation | GOOGLE | Leetcode - 1503</video:title><video:description>Last Moment Before All Ants Fall Out of a Plank | Easy Explanation | GOOGLE | Leetcode - 1503. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/JaJkEI-0zdI</video:player_loc><video:duration>1430</video:duration><video:publication_date>2023-11-04T05:53:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/find-the-winner-of-an-array-game-leetcode-1535</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/0pnrbej1_xM/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Winner of an Array Game | Simulation | Easy Explanation | GOOGLE | Leetcode - 1535</video:title><video:description>Find the Winner of an Array Game | Simulation | Easy Explanation | GOOGLE | Leetcode - 1535. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/0pnrbej1_xM</video:player_loc><video:duration>1528</video:duration><video:publication_date>2023-11-05T03:09:58.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/reduction-operations-to-make-the-array-elements-equal-leetcode-1887</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/XzjcPpSph0s/hqdefault.jpg</video:thumbnail_loc><video:title>Reduction Operations to Make the Array Elements Equal | Intuition | Leetcode-1887</video:title><video:description>Reduction Operations to Make the Array Elements Equal | Intuition | Leetcode-1887. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/XzjcPpSph0s</video:player_loc><video:duration>834</video:duration><video:publication_date>2023-11-19T03:03:49.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/minimum-amount-of-time-to-collect-garbage-leetcode-2391</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/SGJMTu9SZHs/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Amount of Time to Collect Garbage | Simple Clean | Leetcode-2391</video:title><video:description>Minimum Amount of Time to Collect Garbage | Simple Clean | Leetcode-2391. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/SGJMTu9SZHs</video:player_loc><video:duration>1199</video:duration><video:publication_date>2023-11-20T02:57:18.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/diagonal-traverse-ii-leetcode-1424</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5FWc--uZRwo/hqdefault.jpg</video:thumbnail_loc><video:title>Diagonal Traverse II | 2 Approaches | Map | BFS | GOOGLE | Leetcode-1424</video:title><video:description>Diagonal Traverse II | 2 Approaches | Map | BFS | GOOGLE | Leetcode-1424. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5FWc--uZRwo</video:player_loc><video:duration>1906</video:duration><video:publication_date>2023-11-22T06:04:13.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/arithmetic-subarrays-leetcode-1630</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ErHay1GfIqw/hqdefault.jpg</video:thumbnail_loc><video:title>Arithmetic Subarrays | 2 Approaches | Sorting | Without Sorting | Leetcode-1630</video:title><video:description>Arithmetic Subarrays | 2 Approaches | Sorting | Without Sorting | Leetcode-1630. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ErHay1GfIqw</video:player_loc><video:duration>1305</video:duration><video:publication_date>2023-11-23T04:19:25.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/sum-of-absolute-differences-in-a-sorted-array-leetcode-1685</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/2ENYvJL-Leo/hqdefault.jpg</video:thumbnail_loc><video:title>Sum of Absolute Differences in a Sorted Array | Build Intuition | 2 Approaches | Leetcode - 1685</video:title><video:description>Sum of Absolute Differences in a Sorted Array | Build Intuition | 2 Approaches | Leetcode - 1685. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/2ENYvJL-Leo</video:player_loc><video:duration>1872</video:duration><video:publication_date>2023-11-25T05:46:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/largest-submatrix-with-rearrangements-leetcode-1727</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Cs-xXLHG1BY/hqdefault.jpg</video:thumbnail_loc><video:title>Largest Submatrix With Rearrangements | Build Intuition | 3 Approaches | Leetcode 1727 | MIK</video:title><video:description>Largest Submatrix With Rearrangements | Build Intuition | 3 Approaches | Leetcode 1727 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Cs-xXLHG1BY</video:player_loc><video:duration>3155</video:duration><video:publication_date>2023-11-26T08:17:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/element-appearing-more-than-25-in-sorted-array-leetcode-1287</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/6BoymP9R9MM/hqdefault.jpg</video:thumbnail_loc><video:title>Element Appearing More Than 25% In Sorted Array | 3 Approaches | Leetcode-1287</video:title><video:description>Element Appearing More Than 25% In Sorted Array | 3 Approaches | Leetcode-1287. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/6BoymP9R9MM</video:player_loc><video:duration>1535</video:duration><video:publication_date>2023-12-11T06:16:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/difference-between-ones-and-zeros-in-row-and-column-leetcode-2482</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/lcFhMgpRPlc/hqdefault.jpg</video:thumbnail_loc><video:title>Difference Between Ones and Zeros in Row and Column | Intuition | Leetcode-2482</video:title><video:description>Difference Between Ones and Zeros in Row and Column | Intuition | Leetcode-2482. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/lcFhMgpRPlc</video:player_loc><video:duration>766</video:duration><video:publication_date>2023-12-14T01:54:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/image-smoother-leetcode-661</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QXnw71MA_pU/hqdefault.jpg</video:thumbnail_loc><video:title>Image Smoother | 2 Simple Approaches | AMAZON | Leetcode-661</video:title><video:description>Image Smoother | 2 Simple Approaches | AMAZON | Leetcode-661. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QXnw71MA_pU</video:player_loc><video:duration>2300</video:duration><video:publication_date>2023-12-19T05:15:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/widest-vertical-area-between-two-points-containing-no-points-leetcode-1637</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QZuxYdVNoIU/hqdefault.jpg</video:thumbnail_loc><video:title>Widest Vertical Area Between Two Points Containing No Points | Leetcode 1637</video:title><video:description>Widest Vertical Area Between Two Points Containing No Points | Leetcode 1637. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QZuxYdVNoIU</video:player_loc><video:duration>542</video:duration><video:publication_date>2023-12-21T05:20:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/anti-diagonal-traversal-of-matrix</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/05FQV0T6YlI/hqdefault.jpg</video:thumbnail_loc><video:title>Anti Diagonal Traversal of Matrix | Simplest Approach | GfG POTD</video:title><video:description>Anti Diagonal Traversal of Matrix | Simplest Approach | GfG POTD. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/05FQV0T6YlI</video:player_loc><video:duration>772</video:duration><video:publication_date>2023-12-27T03:19:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/convert-an-array-into-a-2d-array-with-conditions-leetcode-2610</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/BR--_W8odmw/hqdefault.jpg</video:thumbnail_loc><video:title>Convert an Array Into a 2D Array With Conditions | With Dry Run | Leetcode 2610</video:title><video:description>Convert an Array Into a 2D Array With Conditions | With Dry Run | Leetcode 2610. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/BR--_W8odmw</video:player_loc><video:duration>945</video:duration><video:publication_date>2024-01-02T04:36:45.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/subarray-sum-equals-k-leetcode-1074</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/-SWrz90jCUM/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Submatrices That Sum to Target | Subarray Sum Equals K | Leetcode 1074 | Leetcode 560</video:title><video:description>Number of Submatrices That Sum to Target | Subarray Sum Equals K | Leetcode 1074 | Leetcode 560. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/-SWrz90jCUM</video:player_loc><video:duration>3413</video:duration><video:publication_date>2024-01-28T08:35:39.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/sequential-digits-leetcode-1291</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/E5XFO3-6xe4/hqdefault.jpg</video:thumbnail_loc><video:title>Sequential Digits | 2 Approaches | Leetcode 1291 | codestorywithMIK</video:title><video:description>Sequential Digits | 2 Approaches | Leetcode 1291 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/E5XFO3-6xe4</video:player_loc><video:duration>1281</video:duration><video:publication_date>2024-02-02T07:28:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/rearrange-array-elements-by-sign-leetcode-2149</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/cSG2bzAuLGU/hqdefault.jpg</video:thumbnail_loc><video:title>Rearrange Array Elements by Sign | 2 Approaches | Why Order Preserve | Leetcode 2149</video:title><video:description>Rearrange Array Elements by Sign | 2 Approaches | Why Order Preserve | Leetcode 2149. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/cSG2bzAuLGU</video:player_loc><video:duration>1071</video:duration><video:publication_date>2024-02-14T03:56:59.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/number-of-subarrays-that-match-a-pattern-i-leetcode-3034</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/OEmdc4a1G4Q/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Subarrays That Match a Pattern | Brute Force | Optimal | KMP |  Leetcode 3034 | 3036</video:title><video:description>Number of Subarrays That Match a Pattern | Brute Force | Optimal | KMP |  Leetcode 3034 | 3036. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/OEmdc4a1G4Q</video:player_loc><video:duration>2258</video:duration><video:publication_date>2024-02-14T17:03:17.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/meeting-rooms-iii-leetcode-2402</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8JTr7Hk0p2o/hqdefault.jpg</video:thumbnail_loc><video:title>Meeting Rooms III | Detailed Intuition | Brute Force | Optimal | Leetcode 2402 | codestorywithMIK</video:title><video:description>Meeting Rooms III | Detailed Intuition | Brute Force | Optimal | Leetcode 2402 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8JTr7Hk0p2o</video:player_loc><video:duration>3603</video:duration><video:publication_date>2024-02-18T09:00:55.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/product-of-array-except-self-leetcode-238</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ku4oITayEmk/hqdefault.jpg</video:thumbnail_loc><video:title>Product of Array Except Self | 4 Approaches | Detailed Explanation | Leetcode 238 | codestorywithMIK</video:title><video:description>Product of Array Except Self | 4 Approaches | Detailed Explanation | Leetcode 238 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ku4oITayEmk</video:player_loc><video:duration>2030</video:duration><video:publication_date>2024-03-15T03:53:47.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/contiguous-array-leetcode-525</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/AcSWGXBu-Xo/hqdefault.jpg</video:thumbnail_loc><video:title>Contiguous Array | Using same Pattern Approach | Similar Problems | Leetcode 525</video:title><video:description>Contiguous Array | Using same Pattern Approach | Similar Problems | Leetcode 525. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/AcSWGXBu-Xo</video:player_loc><video:duration>1279</video:duration><video:publication_date>2024-03-16T04:48:51.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/find-all-duplicates-in-an-array-leetcode-442</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/NqadCpaZnkk/hqdefault.jpg</video:thumbnail_loc><video:title>Find All Duplicates in an Array | Clean | Easy | Leetcode 442 | codestorywithMIK</video:title><video:description>Find All Duplicates in an Array | Clean | Easy | Leetcode 442 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/NqadCpaZnkk</video:player_loc><video:duration>731</video:duration><video:publication_date>2024-03-25T01:13:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/first-missing-positive-leetcode-41</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/lyjOwaUEWWQ/hqdefault.jpg</video:thumbnail_loc><video:title>First Missing Positive | In Depth Intuition | Clean Code | Leetcode 41 | codestorywithMIK</video:title><video:description>First Missing Positive | In Depth Intuition | Clean Code | Leetcode 41 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/lyjOwaUEWWQ</video:player_loc><video:duration>1997</video:duration><video:publication_date>2024-03-26T02:35:55.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/count-alternating-subarrays-leetcode-3031</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/6BmOf92anPc/hqdefault.jpg</video:thumbnail_loc><video:title>Count Alternating Subarrays | Super Easy | Leetcode 3031 | Weekly Contest 391 | codestorywithMIK</video:title><video:description>Count Alternating Subarrays | Super Easy | Leetcode 3031 | Weekly Contest 391 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/6BmOf92anPc</video:player_loc><video:duration>1291</video:duration><video:publication_date>2024-03-31T04:46:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/island-perimeter-leetcode-463</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/O34v6f6s3lQ/hqdefault.jpg</video:thumbnail_loc><video:title>Island Perimeter | 3 Approaches | Google | Leetcode 463 | codestorywithMIK</video:title><video:description>Island Perimeter | 3 Approaches | Google | Leetcode 463 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/O34v6f6s3lQ</video:player_loc><video:duration>2734</video:duration><video:publication_date>2024-04-18T02:54:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/number-of-islands-leetcode-200</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/yYKGNW6Y7BA/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Islands | DFS | BFS |  Same as Island Perimeter | Leetcode 200 | codestorywithMIK</video:title><video:description>Number of Islands | DFS | BFS |  Same as Island Perimeter | Leetcode 200 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/yYKGNW6Y7BA</video:player_loc><video:duration>1069</video:duration><video:publication_date>2024-04-19T02:17:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/find-all-groups-of-farmland-leetcode-1992</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/3ZaQTCH83fY/hqdefault.jpg</video:thumbnail_loc><video:title>Find All Groups of Farmland | DFS | BFS | Brute Force | Leetcode 1992 | codestorywithMIK</video:title><video:description>Find All Groups of Farmland | DFS | BFS | Brute Force | Leetcode 1992 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/3ZaQTCH83fY</video:player_loc><video:duration>1959</video:duration><video:publication_date>2024-04-20T11:59:48.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/count-number-of-nice-subarrays-leetcode-1248</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/JpXlsCAD1kg/hqdefault.jpg</video:thumbnail_loc><video:title>Count Number of Nice Subarrays | 2 Approaches | Similar Concept | Leetcode 1248 | codestorywithMIK</video:title><video:description>Count Number of Nice Subarrays | 2 Approaches | Similar Concept | Leetcode 1248 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/JpXlsCAD1kg</video:player_loc><video:duration>1969</video:duration><video:publication_date>2024-06-22T07:32:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/minimum-number-of-k-consecutive-bit-flips-leetcode-995</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/NtCLzpLmxNU/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Number of K Consecutive Bit Flips | 3 Approaches | Leetcode 995 | 3191 | codestorywithMIK</video:title><video:description>Minimum Number of K Consecutive Bit Flips | 3 Approaches | Leetcode 995 | 3191 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/NtCLzpLmxNU</video:player_loc><video:duration>3804</video:duration><video:publication_date>2024-06-24T07:26:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/minimum-difference-between-largest-and-smallest-value-in-leetcode-1509</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/CHxya52oxCM/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Difference Between Largest and Smallest Value in Three Moves | 2 Approaches | Leetcode 1509</video:title><video:description>Minimum Difference Between Largest and Smallest Value in Three Moves | 2 Approaches | Leetcode 1509. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/CHxya52oxCM</video:player_loc><video:duration>1896</video:duration><video:publication_date>2024-07-03T11:10:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/average-waiting-time-leetcode-1701</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/g7P8Zkq8P9Q/hqdefault.jpg</video:thumbnail_loc><video:title>Average Waiting Time | Simple Simulation | Leetcode 1701 | codestorywithMIK</video:title><video:description>Average Waiting Time | Simple Simulation | Leetcode 1701 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/g7P8Zkq8P9Q</video:player_loc><video:duration>1023</video:duration><video:publication_date>2024-07-09T01:52:41.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/find-valid-matrix-given-row-and-column-sums-leetcode-1605</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9dKdLNlmxco/hqdefault.jpg</video:thumbnail_loc><video:title>Find Valid Matrix Given Row and Column Sums | Simple Approach | Leetcode 1605 | codestorywithMIK</video:title><video:description>Find Valid Matrix Given Row and Column Sums | Simple Approach | Leetcode 1605 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9dKdLNlmxco</video:player_loc><video:duration>1158</video:duration><video:publication_date>2024-07-20T03:11:34.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/minimum-operations-to-make-array-equal-to-target-leetcode-3229</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/yX6NHGF_YQ4/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Operations to Make Array Equal to Target | Minimum Number of Increments|Leetcode 3229 &amp; 1526</video:title><video:description>Minimum Operations to Make Array Equal to Target | Minimum Number of Increments|Leetcode 3229 &amp; 1526. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/yX6NHGF_YQ4</video:player_loc><video:duration>2723</video:duration><video:publication_date>2024-07-21T10:10:21.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/count-number-of-teams-leetcode-1395</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/UZupIKXnzq8/hqdefault.jpg</video:thumbnail_loc><video:title>Count Number of Teams | Simple thought process | Intuition | Leetcode 1395</video:title><video:description>Count Number of Teams | Simple thought process | Intuition | Leetcode 1395. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/UZupIKXnzq8</video:player_loc><video:duration>1453</video:duration><video:publication_date>2024-07-29T03:33:25.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/spiral-matrix-iii-leetcode-885</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/dt0UzAz7SPg/hqdefault.jpg</video:thumbnail_loc><video:title>Spiral Matrix III | Simple Simulation | Made Easy | Leetcode 885 | codestorywithMIK</video:title><video:description>Spiral Matrix III | Simple Simulation | Made Easy | Leetcode 885 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/dt0UzAz7SPg</video:player_loc><video:duration>1857</video:duration><video:publication_date>2024-08-08T02:49:25.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/magic-squares-in-grid-leetcode-840</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/KgiW_AtaBPo/hqdefault.jpg</video:thumbnail_loc><video:title>Magic Squares In Grid | Simple Approach | Clean Code | Leetcode 840 | codestorywithMIK</video:title><video:description>Magic Squares In Grid | Simple Approach | Clean Code | Leetcode 840 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/KgiW_AtaBPo</video:player_loc><video:duration>1569</video:duration><video:publication_date>2024-08-09T09:04:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/regions-cut-by-slashes-leetcode-959</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/zMqgIbLLsc4/hqdefault.jpg</video:thumbnail_loc><video:title>Regions Cut By Slashes | Already Studied Concept | Easy Code | Leetcode 959 | codestorywithMIK</video:title><video:description>Regions Cut By Slashes | Already Studied Concept | Easy Code | Leetcode 959 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/zMqgIbLLsc4</video:player_loc><video:duration>2576</video:duration><video:publication_date>2024-08-10T10:16:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/minimum-number-of-days-to-disconnect-island-leetcode-1568</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/HCHpyAk1Ekw/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Number of Days to Disconnect Island | Studied Concept | Leetcode 1568 | codestorywithMIK</video:title><video:description>Minimum Number of Days to Disconnect Island | Studied Concept | Leetcode 1568 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/HCHpyAk1Ekw</video:player_loc><video:duration>1460</video:duration><video:publication_date>2024-08-11T04:57:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/count-sub-islands-leetcode-1905</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/OeaEOoM-g98/hqdefault.jpg</video:thumbnail_loc><video:title>Count Sub Islands | Easiest Thought Process | Leetcode 1905 | codestorywithMIK</video:title><video:description>Count Sub Islands | Easiest Thought Process | Leetcode 1905 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/OeaEOoM-g98</video:player_loc><video:duration>1755</video:duration><video:publication_date>2024-08-28T02:50:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/find-the-student-that-will-replace-the-chalk-leetcode-1894</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/RG-vw6IzVuU/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Student that Will Replace the Chalk | 2 Ways | Leetcode 1894 | codestorywithMIK</video:title><video:description>Find the Student that Will Replace the Chalk | 2 Ways | Leetcode 1894 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/RG-vw6IzVuU</video:player_loc><video:duration>1154</video:duration><video:publication_date>2024-09-02T04:07:25.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/walking-robot-simulation-leetcode-874</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/K8lMDgaAn4w/hqdefault.jpg</video:thumbnail_loc><video:title>Walking Robot Simulation | Detailed Simulation | Leetcode 874 | codestorywithMIK</video:title><video:description>Walking Robot Simulation | Detailed Simulation | Leetcode 874 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/K8lMDgaAn4w</video:player_loc><video:duration>1856</video:duration><video:publication_date>2024-09-04T09:29:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/spiral-matrix-iv-leetcode-2326</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/h-3aM0bEUZ8/hqdefault.jpg</video:thumbnail_loc><video:title>Spiral Matrix IV | Same Concept Copy Paste | Dry Run | Leetcode 2326 | codestorywithMIK</video:title><video:description>Spiral Matrix IV | Same Concept Copy Paste | Dry Run | Leetcode 2326 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/h-3aM0bEUZ8</video:player_loc><video:duration>1457</video:duration><video:publication_date>2024-09-09T03:53:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/longest-subarray-with-maximum-bitwise-and-leetcode-2419</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/xhKpOhtqAnM/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Subarray With Maximum Bitwise AND | Simple Observation | Leetcode 2419 | codestorywithMIK</video:title><video:description>Longest Subarray With Maximum Bitwise AND | Simple Observation | Leetcode 2419 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/xhKpOhtqAnM</video:player_loc><video:duration>871</video:duration><video:publication_date>2024-09-14T03:06:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/minimum-time-difference-leetcode-539</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ftCheG0m85k/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Time Difference | Easy Approach | Detailed | Leetcode 539 | codestorywithMIK</video:title><video:description>Minimum Time Difference | Easy Approach | Detailed | Leetcode 539 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ftCheG0m85k</video:player_loc><video:duration>1441</video:duration><video:publication_date>2024-09-16T04:16:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/my-calendar-i-leetcode-729</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/45hKBSytI2E/hqdefault.jpg</video:thumbnail_loc><video:title>My Calendar I | Detailed Approach | Leetcode 729 | codestorywithMIK</video:title><video:description>My Calendar I | Detailed Approach | Leetcode 729 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/45hKBSytI2E</video:player_loc><video:duration>2253</video:duration><video:publication_date>2024-09-26T03:59:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/my-calendar-ii-leetcode-731</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/vySZ_KfjiRU/hqdefault.jpg</video:thumbnail_loc><video:title>My Calendar II | Simplest Explanation | Full Dry Run | Leetcode 731 | codestorywithMIK</video:title><video:description>My Calendar II | Simplest Explanation | Full Dry Run | Leetcode 731 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/vySZ_KfjiRU</video:player_loc><video:duration>1961</video:duration><video:publication_date>2024-09-27T04:53:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/make-sum-divisible-by-p-leetcode-1590</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5jpCEfRI1sM/hqdefault.jpg</video:thumbnail_loc><video:title>Make Sum Divisible by P | Simplest Explanation | Full Dry Run | Leetcode 1590 | codestorywithMIK</video:title><video:description>Make Sum Divisible by P | Simplest Explanation | Full Dry Run | Leetcode 1590 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5jpCEfRI1sM</video:player_loc><video:duration>1646</video:duration><video:publication_date>2024-10-03T08:45:21.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/divide-players-into-teams-of-equal-skill-leetcode-2491</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/DtXt4DTrvOw/hqdefault.jpg</video:thumbnail_loc><video:title>Divide Players Into Teams of Equal Skill | With Proof | Dry Run | Leetcode 2491 | codestorywithMIK</video:title><video:description>Divide Players Into Teams of Equal Skill | With Proof | Dry Run | Leetcode 2491 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/DtXt4DTrvOw</video:player_loc><video:duration>1609</video:duration><video:publication_date>2024-10-04T02:59:53.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/the-number-of-the-smallest-unoccupied-chair-leetcode-1942</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/NePJRPCuOwg/hqdefault.jpg</video:thumbnail_loc><video:title>The Number of the Smallest Unoccupied Chair | Brute Force | Optimal |Leetcode 1942 |codestorywithMIK</video:title><video:description>The Number of the Smallest Unoccupied Chair | Brute Force | Optimal |Leetcode 1942 |codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/NePJRPCuOwg</video:player_loc><video:duration>1943</video:duration><video:publication_date>2024-10-11T06:48:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/divide-intervals-into-minimum-number-of-groups-leetcode-2406</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/aelafJoNaD0/hqdefault.jpg</video:thumbnail_loc><video:title>Divide Intervals Into Minimum Number of Groups | Simple Intuition | Leetcode 2406 | codestorywithMIK</video:title><video:description>Divide Intervals Into Minimum Number of Groups | Simple Intuition | Leetcode 2406 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/aelafJoNaD0</video:player_loc><video:duration>1258</video:duration><video:publication_date>2024-10-12T05:18:18.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/count-number-of-maximum-bitwise-or-subsets-leetcode-2044</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/DQOgVNI6BcE/hqdefault.jpg</video:thumbnail_loc><video:title>Count Number of Maximum Bitwise-OR Subsets | Simplest Approach | Leetcode 2044 | codestorywithMIK</video:title><video:description>Count Number of Maximum Bitwise-OR Subsets | Simplest Approach | Leetcode 2044 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/DQOgVNI6BcE</video:player_loc><video:duration>1267</video:duration><video:publication_date>2024-10-18T03:35:35.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/longest-square-streak-in-an-array-leetcode-2501</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Xpj6GQgP7og/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Square Streak in an Array | Detailed Approaches | Dry Run | Leetcode 2501 | codestorywithMIK</video:title><video:description>Longest Square Streak in an Array | Detailed Approaches | Dry Run | Leetcode 2501 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Xpj6GQgP7og</video:player_loc><video:duration>1487</video:duration><video:publication_date>2024-10-28T03:52:17.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/maximum-number-of-moves-in-a-grid-leetcode-2684</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/lie63i_QIIs/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Number of Moves in a Grid | Simplest Approach | Leetcode 2684 | codestorywithMIK</video:title><video:description>Maximum Number of Moves in a Grid | Simplest Approach | Leetcode 2684 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/lie63i_QIIs</video:player_loc><video:duration>953</video:duration><video:publication_date>2024-10-29T09:59:25.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/minimum-number-of-removals-to-make-mountain-array-leetcode-1671</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/LFjC2AW0wf4/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Number of Removals to Make Mountain Array | Thought Process | Leetcode 1671|codestorywithMIK</video:title><video:description>Minimum Number of Removals to Make Mountain Array | Thought Process | Leetcode 1671|codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/LFjC2AW0wf4</video:player_loc><video:duration>1863</video:duration><video:publication_date>2024-10-30T05:59:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/find-if-array-can-be-sorted-leetcode-3011</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/TYOnpelfejY/hqdefault.jpg</video:thumbnail_loc><video:title>Find if Array Can Be Sorted | Detailed Approaches | Dry Runs | Leetcode 3011 | codestorywithMIK</video:title><video:description>Find if Array Can Be Sorted | Detailed Approaches | Dry Runs | Leetcode 3011 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/TYOnpelfejY</video:player_loc><video:duration>1807</video:duration><video:publication_date>2024-11-06T02:37:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/prime-subtraction-operation-leetcode-2601</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/jsk0Ajqhu1Y/hqdefault.jpg</video:thumbnail_loc><video:title>Prime Subtraction Operation | Straight Forward Approach | Leetcode 2601 | codestorywithMIK</video:title><video:description>Prime Subtraction Operation | Straight Forward Approach | Leetcode 2601 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/jsk0Ajqhu1Y</video:player_loc><video:duration>1447</video:duration><video:publication_date>2024-11-11T04:18:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/shortest-subarray-to-be-removed-to-make-array-sorted-leetcode-1574</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/yOZSUfL-DxQ/hqdefault.jpg</video:thumbnail_loc><video:title>Shortest Subarray to be Removed to Make Array Sorted | Detailed | Leetcode 1574 | codestorywithMIK</video:title><video:description>Shortest Subarray to be Removed to Make Array Sorted | Detailed | Leetcode 1574 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/yOZSUfL-DxQ</video:player_loc><video:duration>2057</video:duration><video:publication_date>2024-11-15T04:49:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/count-unguarded-cells-in-the-grid-leetcode-2257</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/lzAOWVGkmfs/hqdefault.jpg</video:thumbnail_loc><video:title>Count Unguarded Cells in the Grid | Simple Explanation | Leetcode 2257 | codestorywithMIK</video:title><video:description>Count Unguarded Cells in the Grid | Simple Explanation | Leetcode 2257 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/lzAOWVGkmfs</video:player_loc><video:duration>898</video:duration><video:publication_date>2024-11-21T02:33:47.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/flip-columns-for-maximum-number-of-equal-rows-leetcode-1072</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/SOI-ZzYemoc/hqdefault.jpg</video:thumbnail_loc><video:title>Flip Columns For Maximum Number of Equal Rows | 2 Approaches | Leetcode 1072 | codestorywithMIK</video:title><video:description>Flip Columns For Maximum Number of Equal Rows | 2 Approaches | Leetcode 1072 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/SOI-ZzYemoc</video:player_loc><video:duration>1805</video:duration><video:publication_date>2024-11-22T05:06:35.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/rotating-the-box-leetcode-1861</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/6zDLIE0-9AU/hqdefault.jpg</video:thumbnail_loc><video:title>Rotating the Box | Brute Force | Optimal | Leetcode 1861 | codestorywithMIK</video:title><video:description>Rotating the Box | Brute Force | Optimal | Leetcode 1861 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/6zDLIE0-9AU</video:player_loc><video:duration>2056</video:duration><video:publication_date>2024-11-23T05:26:59.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/maximum-matrix-sum-leetcode-1975</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ca9ND5_EQxk/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Matrix Sum | Simple Thought Process | Leetcode 1975 | codestorywithMIK</video:title><video:description>Maximum Matrix Sum | Simple Thought Process | Leetcode 1975 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ca9ND5_EQxk</video:player_loc><video:duration>1113</video:duration><video:publication_date>2024-11-24T02:22:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/sliding-puzzle-leetcode-773</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/d_DIBUophu8/hqdefault.jpg</video:thumbnail_loc><video:title>Sliding Puzzle | Detailed for Beginners | Leetcode 773 | codestorywithMIK</video:title><video:description>Sliding Puzzle | Detailed for Beginners | Leetcode 773 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/d_DIBUophu8</video:player_loc><video:duration>2064</video:duration><video:publication_date>2024-11-25T04:02:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/two-best-non-overlapping-events-leetcode-2054</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/XXWPM1DdnYk/hqdefault.jpg</video:thumbnail_loc><video:title>Two Best Non-Overlapping Events | Brute Force | Better | Leetcode 2054 | codestorywithMIK</video:title><video:description>Two Best Non-Overlapping Events | Brute Force | Better | Leetcode 2054 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/XXWPM1DdnYk</video:player_loc><video:duration>1673</video:duration><video:publication_date>2024-12-08T05:57:18.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/special-array-ii-leetcode-3152</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/powGdCI0afg/hqdefault.jpg</video:thumbnail_loc><video:title>Special Array II | 3 Detailed Approaches | Beginners Alert | Leetcode 3152 | codestorywithMIK</video:title><video:description>Special Array II | 3 Detailed Approaches | Beginners Alert | Leetcode 3152 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/powGdCI0afg</video:player_loc><video:duration>4038</video:duration><video:publication_date>2024-12-09T06:16:38.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/maximum-beauty-of-an-array-after-applying-operation-leetcode-2779</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/VrFolxiw_yQ/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Beauty of an Array After Applying Operation | 3 Approaches | Leetcode 2779 |codestorywithMIK</video:title><video:description>Maximum Beauty of an Array After Applying Operation | 3 Approaches | Leetcode 2779 |codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/VrFolxiw_yQ</video:player_loc><video:duration>3516</video:duration><video:publication_date>2024-12-11T05:23:51.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/max-chunks-to-make-sorted-leetcode-769</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/OwEggxOnszA/hqdefault.jpg</video:thumbnail_loc><video:title>Max Chunks To Make Sorted | 3 Detailed Approaches | Leetcode 769 | codestorywithMIK</video:title><video:description>Max Chunks To Make Sorted | 3 Detailed Approaches | Leetcode 769 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/OwEggxOnszA</video:player_loc><video:duration>2164</video:duration><video:publication_date>2024-12-19T11:33:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/best-sightseeing-pair-leetcode-1014</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/eQ1TdlglnY0/hqdefault.jpg</video:thumbnail_loc><video:title>Best Sightseeing Pair | 3 Approaches | Detailed For Beginners | Leetcode 1014 | codestorywithMIK</video:title><video:description>Best Sightseeing Pair | 3 Approaches | Detailed For Beginners | Leetcode 1014 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/eQ1TdlglnY0</video:player_loc><video:duration>1596</video:duration><video:publication_date>2024-12-27T05:14:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/count-vowel-strings-in-ranges-leetcode-2559</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/fIIRx-Hfwvc/hqdefault.jpg</video:thumbnail_loc><video:title>Count Vowel Strings in Ranges | Simple Thought Process | Leetcode 2559 | codestorywithMIK</video:title><video:description>Count Vowel Strings in Ranges | Simple Thought Process | Leetcode 2559 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/fIIRx-Hfwvc</video:player_loc><video:duration>957</video:duration><video:publication_date>2025-01-02T01:48:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/number-of-ways-to-split-array-leetcode-2270</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/BcW6MZCHLdA/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Ways to Split Array | Simple Thought Process | Leetcode 2270 | codestorywithMIK</video:title><video:description>Number of Ways to Split Array | Simple Thought Process | Leetcode 2270 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/BcW6MZCHLdA</video:player_loc><video:duration>770</video:duration><video:publication_date>2025-01-03T02:04:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/find-the-prefix-common-array-of-two-arrays-leetcode-2657</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/hVda-pNPiuA/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Prefix Common Array of Two Arrays | 3 Detailed Approach | Leetcode 2657 | codestorywithMIK</video:title><video:description>Find the Prefix Common Array of Two Arrays | 3 Detailed Approach | Leetcode 2657 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/hVda-pNPiuA</video:player_loc><video:duration>2352</video:duration><video:publication_date>2025-01-14T03:36:38.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/first-completely-painted-row-or-column-leetcode-2661</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/nqmR3aDwjwU/hqdefault.jpg</video:thumbnail_loc><video:title>First Completely Painted Row or Column | 3 Approaches | Detailed | Leetcode 2661 | codestorywithMIK</video:title><video:description>First Completely Painted Row or Column | 3 Approaches | Detailed | Leetcode 2661 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/nqmR3aDwjwU</video:player_loc><video:duration>2387</video:duration><video:publication_date>2025-01-20T03:25:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/grid-game-leetcode-2017</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Y8VC_OnkazE/hqdefault.jpg</video:thumbnail_loc><video:title>Grid Game | Detailed Explanation | Complete Ry Run | Leetcode 2017 | codestorywithMIK</video:title><video:description>Grid Game | Detailed Explanation | Complete Ry Run | Leetcode 2017 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Y8VC_OnkazE</video:player_loc><video:duration>2132</video:duration><video:publication_date>2025-01-21T02:32:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/make-lexicographically-smallest-array-by-swapping-elements-leetcode-2948</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/_rQ4lJlI6nI/hqdefault.jpg</video:thumbnail_loc><video:title>Make Lexicographically Smallest Array by Swapping Elements | Brute Force | Optimal | Leetcode 2948</video:title><video:description>Make Lexicographically Smallest Array by Swapping Elements | Brute Force | Optimal | Leetcode 2948. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/_rQ4lJlI6nI</video:player_loc><video:duration>3547</video:duration><video:publication_date>2025-01-25T03:52:35.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/count-servers-that-communicate-leetcode-1267</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/GTahroSaPe0/hqdefault.jpg</video:thumbnail_loc><video:title>Count Servers that Communicate | 3 Detailed Approaches | Dry Runs | Leetcode 1267 | codestorywithMIK</video:title><video:description>Count Servers that Communicate | 3 Detailed Approaches | Dry Runs | Leetcode 1267 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/GTahroSaPe0</video:player_loc><video:duration>2660</video:duration><video:publication_date>2025-01-23T04:05:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/tuple-with-same-product-leetcode-1726</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/aC7q-YCFV2o/hqdefault.jpg</video:thumbnail_loc><video:title>Tuple with Same Product | 4 Detailed Approaches | Dry Runs | Leetcode 1726 | codestorywithMIK</video:title><video:description>Tuple with Same Product | 4 Detailed Approaches | Dry Runs | Leetcode 1726 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/aC7q-YCFV2o</video:player_loc><video:duration>3449</video:duration><video:publication_date>2025-02-06T05:40:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/max-sum-of-a-pair-with-equal-sum-of-digits-leetcode-2342</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/jL-vAR0J5wU/hqdefault.jpg</video:thumbnail_loc><video:title>Max Sum of a Pair With Equal Sum of Digits | 4 Approaches | Leetcode 2342 | codestorywithMIK</video:title><video:description>Max Sum of a Pair With Equal Sum of Digits | 4 Approaches | Leetcode 2342 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/jL-vAR0J5wU</video:player_loc><video:duration>1531</video:duration><video:publication_date>2025-02-12T02:09:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/product-of-the-last-k-numbers-leetcode-1352</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Jvu3hd8A2rg/hqdefault.jpg</video:thumbnail_loc><video:title>Product of the Last K Numbers | Brute Force | Follow Up Optimal | Leetcode 1352 | codestorywithMIK</video:title><video:description>Product of the Last K Numbers | Brute Force | Follow Up Optimal | Leetcode 1352 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Jvu3hd8A2rg</video:player_loc><video:duration>1692</video:duration><video:publication_date>2025-02-14T03:11:38.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/number-of-sub-arrays-with-odd-sum-leetcode-1524</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/_tAArozuTwA/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Sub-arrays With Odd Sum | Brute Force | Better | Optimal | Leetcode 1524 |codestorywithMIK</video:title><video:description>Number of Sub-arrays With Odd Sum | Brute Force | Better | Optimal | Leetcode 1524 |codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/_tAArozuTwA</video:player_loc><video:duration>1906</video:duration><video:publication_date>2025-02-25T04:21:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/maximum-absolute-sum-of-any-subarray-leetcode-1749</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/hLx5BpqPbRw/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Absolute Sum of Any Subarray | Kadane&apos;s Algorithm | Leetcode 1749 | codestorywithMIK</video:title><video:description>Maximum Absolute Sum of Any Subarray | Kadane&apos;s Algorithm | Leetcode 1749 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/hLx5BpqPbRw</video:player_loc><video:duration>1850</video:duration><video:publication_date>2025-02-26T04:14:47.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/partition-array-according-to-given-pivot-leetcode-2161</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/yHJpnqW5ZSU/hqdefault.jpg</video:thumbnail_loc><video:title>Partition Array According to Given Pivot | Multiple Approaches | Leetcode 2161 | codestorywithMIK</video:title><video:description>Partition Array According to Given Pivot | Multiple Approaches | Leetcode 2161 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/yHJpnqW5ZSU</video:player_loc><video:duration>1792</video:duration><video:publication_date>2025-03-03T02:52:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/count-days-without-meetings-leetcode-3169</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/6-GbDuhOOdc/hqdefault.jpg</video:thumbnail_loc><video:title>Count Days Without Meetings | Simplest Explanation | Leetcode 3169 | codestorywithMIK</video:title><video:description>Count Days Without Meetings | Simplest Explanation | Leetcode 3169 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/6-GbDuhOOdc</video:player_loc><video:duration>1089</video:duration><video:publication_date>2025-03-24T02:38:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/check-if-grid-can-be-cut-into-sections-leetcode-3394</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9rCmrMed8h8/hqdefault.jpg</video:thumbnail_loc><video:title>Check if Grid can be Cut into Sections | Merge Intervals | Leetcode 3394 | Leetcode 56 | Detailed</video:title><video:description>Check if Grid can be Cut into Sections | Merge Intervals | Leetcode 3394 | Leetcode 56 | Detailed. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9rCmrMed8h8</video:player_loc><video:duration>2598</video:duration><video:publication_date>2025-03-25T02:43:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/maximum-number-of-points-from-grid-queries-leetcode-2503</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/XBd9vO4N0Js/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Number of Points From Grid Queries | DFS | BFS | Optimal | Leetcode 2503 | codestorywithMIK</video:title><video:description>Maximum Number of Points From Grid Queries | DFS | BFS | Optimal | Leetcode 2503 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/XBd9vO4N0Js</video:player_loc><video:duration>2869</video:duration><video:publication_date>2025-03-28T06:13:55.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/count-of-interesting-subarrays-leetcode-2845</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/MTQWe8qHcz0/hqdefault.jpg</video:thumbnail_loc><video:title>Count of Interesting Subarrays | Using Studied Concept | Dry Run | Leetcode 2845 | codestorywithMIK</video:title><video:description>Count of Interesting Subarrays | Using Studied Concept | Dry Run | Leetcode 2845 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/MTQWe8qHcz0</video:player_loc><video:duration>2310</video:duration><video:publication_date>2025-04-25T13:17:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/set-matrix-zeroes-leetcode-73</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/A0_hEzQFP9U/hqdefault.jpg</video:thumbnail_loc><video:title>Set Matrix Zeroes | Multiple Approaches | Leetcode 73 | codestorywithMIK</video:title><video:description>Set Matrix Zeroes | Multiple Approaches | Leetcode 73 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/A0_hEzQFP9U</video:player_loc><video:duration>2204</video:duration><video:publication_date>2025-05-21T08:06:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/find-the-maximum-length-of-valid-subsequence-i-leetcode-3201</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/u-NffNeqNqk/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Maximum Length of Valid Subsequence I | Detailed Intuition | Leetcode 3201 | MIK</video:title><video:description>Find the Maximum Length of Valid Subsequence I | Detailed Intuition | Leetcode 3201 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/u-NffNeqNqk</video:player_loc><video:duration>1494</video:duration><video:publication_date>2025-07-16T01:35:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/range-product-queries-of-powers-leetcode-2438</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Scr9qJ5ioq4/hqdefault.jpg</video:thumbnail_loc><video:title>Range Product Queries of Powers | Simple Explanation | Leetcode 2438 | codestorywithMIK</video:title><video:description>Range Product Queries of Powers | Simple Explanation | Leetcode 2438 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Scr9qJ5ioq4</video:player_loc><video:duration>1157</video:duration><video:publication_date>2025-08-11T01:36:45.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/count-submatrices-with-all-ones-leetcode-1504</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/dYsJpsgCPzw/hqdefault.jpg</video:thumbnail_loc><video:title>Count Submatrices With All Ones | Detailed Explanation | Leetcode 1504 | codestorywithMIK</video:title><video:description>Count Submatrices With All Ones | Detailed Explanation | Leetcode 1504 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/dYsJpsgCPzw</video:player_loc><video:duration>1771</video:duration><video:publication_date>2025-08-21T07:23:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/find-the-minimum-area-to-cover-all-ones-i-leetcode-3195</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/fE0x8ZlyG_w/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Minimum Area to Cover All Ones I | Simple Explanation | Leetcode 3195 | codestorywithMIK</video:title><video:description>Find the Minimum Area to Cover All Ones I | Simple Explanation | Leetcode 3195 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/fE0x8ZlyG_w</video:player_loc><video:duration>731</video:duration><video:publication_date>2025-08-22T02:54:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/find-the-minimum-area-to-cover-all-ones-ii-leetcode-3197</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/DCGX28SMch4/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Minimum Area to Cover All Ones II | Detailed Explanation | Leetcode 3197 | codestorywithMIK</video:title><video:description>Find the Minimum Area to Cover All Ones II | Detailed Explanation | Leetcode 3197 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/DCGX28SMch4</video:player_loc><video:duration>3386</video:duration><video:publication_date>2025-08-23T07:24:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/sort-matrix-by-diagonals-leetcode-3446</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Up445vSkzHQ/hqdefault.jpg</video:thumbnail_loc><video:title>Sort Matrix by Diagonals | 2 Approaches | Without Map | Leetcode 3446 | codestorywithMIK</video:title><video:description>Sort Matrix by Diagonals | 2 Approaches | Without Map | Leetcode 3446 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Up445vSkzHQ</video:player_loc><video:duration>2297</video:duration><video:publication_date>2025-08-28T04:19:55.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/find-the-number-of-ways-to-place-people-i-leetcode-3025</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/f7iKx5lpqJ8/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Number of Ways to Place People I | 2 Detailed Approaches | Leetcode 3025 | codestorywithMIK</video:title><video:description>Find the Number of Ways to Place People I | 2 Detailed Approaches | Leetcode 3025 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/f7iKx5lpqJ8</video:player_loc><video:duration>2562</video:duration><video:publication_date>2025-09-02T13:02:34.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/find-the-number-of-ways-to-place-people-ii-leetcode-3027</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/BFAdJlloIOQ/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Number of Ways to Place People II | Same as Part I | Leetcode 3027 | codestorywithMIK</video:title><video:description>Find the Number of Ways to Place People II | Same as Part I | Leetcode 3027 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/BFAdJlloIOQ</video:player_loc><video:duration>429</video:duration><video:publication_date>2025-09-03T01:09:52.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/minimum-operations-to-make-array-elements-zero-leetcode-3495</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/VYDl3p9bkkw/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Operations to Make Array Elements Zero | Detailed Deep Dive | Leetcode 3495 | MIK</video:title><video:description>Minimum Operations to Make Array Elements Zero | Detailed Deep Dive | Leetcode 3495 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/VYDl3p9bkkw</video:player_loc><video:duration>2629</video:duration><video:publication_date>2025-09-06T06:40:51.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/valid-triangle-number-leetcode-611</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/lblGlKlXUBM/hqdefault.jpg</video:thumbnail_loc><video:title>Valid Triangle Number | 3 Approaches | Detailed | Leetcode 611 | codestorywithMIK</video:title><video:description>Valid Triangle Number | 3 Approaches | Detailed | Leetcode 611 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/lblGlKlXUBM</video:player_loc><video:duration>1772</video:duration><video:publication_date>2025-09-26T06:58:52.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/find-triangular-sum-of-an-array-leetcode-2221</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5qlXato2VkE/hqdefault.jpg</video:thumbnail_loc><video:title>Find Triangular Sum of an Array | 2 Approaches | Constant Space | Leetcode 2221 | codestorywithMIK</video:title><video:description>Find Triangular Sum of an Array | 2 Approaches | Constant Space | Leetcode 2221 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5qlXato2VkE</video:player_loc><video:duration>841</video:duration><video:publication_date>2025-09-30T06:36:52.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/water-bottles-ii-leetcode-3100</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/RxFLUxwdXa4/hqdefault.jpg</video:thumbnail_loc><video:title>Water Bottles II | 2 Approaches | Sridharacharya formula | Leetcode 3100 | codestorywithMIK</video:title><video:description>Water Bottles II | 2 Approaches | Sridharacharya formula | Leetcode 3100 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/RxFLUxwdXa4</video:player_loc><video:duration>1299</video:duration><video:publication_date>2025-10-02T20:33:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/pacific-atlantic-water-flow-leetcode-417</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/t0C4MzNf-1o/hqdefault.jpg</video:thumbnail_loc><video:title>Pacific Atlantic Water Flow | Detailed | Brute Force | Optimal | Leetcode 417 | codestorywithMIK</video:title><video:description>Pacific Atlantic Water Flow | Detailed | Brute Force | Optimal | Leetcode 417 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/t0C4MzNf-1o</video:player_loc><video:duration>2241</video:duration><video:publication_date>2025-10-05T19:12:35.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/find-the-minimum-amount-of-time-to-brew-potions-leetcode-3494</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/nCutrlJaRBo/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Minimum Amount of Time to Brew Potions | Deep Dive | Leetcode 3494 | codestorywithMIK</video:title><video:description>Find the Minimum Amount of Time to Brew Potions | Deep Dive | Leetcode 3494 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/nCutrlJaRBo</video:player_loc><video:duration>2801</video:duration><video:publication_date>2025-10-09T08:52:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/find-the-minimum-amount-of-time-to-brew-potions-leetcode-3350</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Xjp4cLpphM0/hqdefault.jpg</video:thumbnail_loc><video:title>Adjacent Increasing Subarrays Detection II | Same as Part I | Leetcode 3350 | codestorywithMIK</video:title><video:description>Adjacent Increasing Subarrays Detection II | Same as Part I | Leetcode 3350 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Xjp4cLpphM0</video:player_loc><video:duration>951</video:duration><video:publication_date>2025-10-15T01:47:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/maximum-frequency-of-an-element-after-performing-operations-leetcode-3346</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/CKha8fqTwBA/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Frequency of an Element After Performing Operations I | Made Easy | Leetcode 3346</video:title><video:description>Maximum Frequency of an Element After Performing Operations I | Made Easy | Leetcode 3346. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/CKha8fqTwBA</video:player_loc><video:duration>2268</video:duration><video:publication_date>2025-10-21T12:05:35.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/maximum-subarray-sum-with-length-divisible-by-k-leetcode-3381</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/pPxqRNyUbIs/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Subarray Sum With Length Divisible by K | Simplified Kadane&apos;s Algo | Leetcode 3381 | MIK</video:title><video:description>Maximum Subarray Sum With Length Divisible by K | Simplified Kadane&apos;s Algo | Leetcode 3381 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/pPxqRNyUbIs</video:player_loc><video:duration>1895</video:duration><video:publication_date>2025-11-27T11:26:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/number-of-smooth-descent-periods-of-a-stock-leetcode-2110</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Sy5E_a8wrT4/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Smooth Descent Periods of a Stock | Simple Approach | Leetcode 2110 | codestorywithMIK</video:title><video:description>Number of Smooth Descent Periods of a Stock | Simple Approach | Leetcode 2110 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Sy5E_a8wrT4</video:player_loc><video:duration>621</video:duration><video:publication_date>2025-12-15T03:39:53.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/maximize-area-of-square-hole-in-grid-leetcode-2943</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/BfOeTE_-3l4/hqdefault.jpg</video:thumbnail_loc><video:title>Maximize Area of Square Hole in Grid | Detailed Intuition | Leetcode 2943 | codestorywithMIK</video:title><video:description>Maximize Area of Square Hole in Grid | Detailed Intuition | Leetcode 2943 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/BfOeTE_-3l4</video:player_loc><video:duration>1674</video:duration><video:publication_date>2026-01-15T04:54:51.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/largest-magic-square-leetcode-1895</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/oM4dI1wn21I/hqdefault.jpg</video:thumbnail_loc><video:title>Largest Magic Square | Simplified Explanation | Leetcode 1895 | codestorywithMIK</video:title><video:description>Largest Magic Square | Simplified Explanation | Leetcode 1895 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/oM4dI1wn21I</video:player_loc><video:duration>2917</video:duration><video:publication_date>2026-01-18T00:25:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/maximum-side-length-of-a-square-with-sum-less-than-or-equal-leetcode-1292</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/olDXKOSydpg/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Side Length of a Square with Sum Less than or Equal to Threshold | 2 Ways | Leetcode 1292</video:title><video:description>Maximum Side Length of a Square with Sum Less than or Equal to Threshold | 2 Ways | Leetcode 1292. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/olDXKOSydpg</video:player_loc><video:duration>3680</video:duration><video:publication_date>2026-01-19T01:15:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/minimum-swaps-to-arrange-a-binary-grid-leetcode-1536</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/FxOl81Rwdrk/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Swaps to Arrange a Binary Grid | Intuition | Dry Run | Leetcode 1536 | codestorywithMIK</video:title><video:description>Minimum Swaps to Arrange a Binary Grid | Intuition | Dry Run | Leetcode 1536 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/FxOl81Rwdrk</video:player_loc><video:duration>1382</video:duration><video:publication_date>2026-03-02T02:26:59.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/get-biggest-three-rhombus-sums-in-a-grid-leetcode-1878</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/37IXS3SiI8c/hqdefault.jpg</video:thumbnail_loc><video:title>Get Biggest Three Rhombus Sums in a Grid | Brute Force | Optimal | Leetcode 1878 | codestorywithMIK</video:title><video:description>Get Biggest Three Rhombus Sums in a Grid | Brute Force | Optimal | Leetcode 1878 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/37IXS3SiI8c</video:player_loc><video:duration>3764</video:duration><video:publication_date>2026-03-16T03:35:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/count-submatrices-with-equal-frequency-of-x-and-y-leetcode-3070</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/sWNfDG1kyrA/hqdefault.jpg</video:thumbnail_loc><video:title>Count Submatrices with Top-Left Element and Sum Less Than k | Brute Force | Optimal | Leetcode 3070</video:title><video:description>Count Submatrices with Top-Left Element and Sum Less Than k | Brute Force | Optimal | Leetcode 3070. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/sWNfDG1kyrA</video:player_loc><video:duration>1646</video:duration><video:publication_date>2026-03-18T01:42:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/count-submatrices-with-equal-frequency-of-x-and-y-leetcode-3212</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YEF2r0XEpTo/hqdefault.jpg</video:thumbnail_loc><video:title>Count Submatrices With Equal Frequency of X and Y | Using Same Pattern Concept | Leetcode 3212 | MIK</video:title><video:description>Count Submatrices With Equal Frequency of X and Y | Using Same Pattern Concept | Leetcode 3212 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YEF2r0XEpTo</video:player_loc><video:duration>1008</video:duration><video:publication_date>2026-03-19T02:23:48.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/minimum-absolute-difference-in-sliding-submatrix-leetcode-3567</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/-IksRuiJXW0/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Absolute Difference in Sliding Submatrix | Straight Forward | Leetcode 3567 | MIK</video:title><video:description>Minimum Absolute Difference in Sliding Submatrix | Straight Forward | Leetcode 3567 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/-IksRuiJXW0</video:player_loc><video:duration>1009</video:duration><video:publication_date>2026-03-20T01:36:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/construct-product-matrix-leetcode-2906</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/i2NjTTgYg3s/hqdefault.jpg</video:thumbnail_loc><video:title>Construct Product Matrix | Simplified Approach | Dry Run | Leetcode 2906 | codestorywithMIK</video:title><video:description>Construct Product Matrix | Simplified Approach | Dry Run | Leetcode 2906 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/i2NjTTgYg3s</video:player_loc><video:duration>1077</video:duration><video:publication_date>2026-03-24T00:23:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/equal-sum-grid-partition-i-leetcode-3546</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/rO4Bm_GxvGk/hqdefault.jpg</video:thumbnail_loc><video:title>Equal Sum Grid Partition I | Simplified Approach | Dry Run | Leetcode 3546 | codestorywithMIK</video:title><video:description>Equal Sum Grid Partition I | Simplified Approach | Dry Run | Leetcode 3546 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/rO4Bm_GxvGk</video:player_loc><video:duration>1188</video:duration><video:publication_date>2026-03-25T01:34:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/equal-sum-grid-partition-ii-leetcode-3548</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Q2kDj7gy9_8/hqdefault.jpg</video:thumbnail_loc><video:title>Equal Sum Grid Partition II | Detailed | Simplified Approach | Leetcode 3548 | codestorywithMIK</video:title><video:description>Equal Sum Grid Partition II | Detailed | Simplified Approach | Leetcode 3548 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Q2kDj7gy9_8</video:player_loc><video:duration>3443</video:duration><video:publication_date>2026-03-26T03:50:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/sum-of-distances-leetcode-2615</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/qCE3U8MkOhA/hqdefault.jpg</video:thumbnail_loc><video:title>Sum of Distances | Detailed | From Brute Force | Dry Runs | Leetcode 2615 | codestorywithMIK</video:title><video:description>Sum of Distances | Detailed | From Brute Force | Dry Runs | Leetcode 2615 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/qCE3U8MkOhA</video:player_loc><video:duration>1940</video:duration><video:publication_date>2026-04-23T04:12:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/rotate-function-leetcode-396</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/SzXjBk1-s1c/hqdefault.jpg</video:thumbnail_loc><video:title>Rotate Function | Detailed with Proof | Leetcode 396 | codestorywithMIK</video:title><video:description>Rotate Function | Detailed with Proof | Leetcode 396 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/SzXjBk1-s1c</video:player_loc><video:duration>1554</video:duration><video:publication_date>2026-05-01T10:44:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/jump-game-ix-leetcode-3660</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/P5OmDG_3UPs/hqdefault.jpg</video:thumbnail_loc><video:title>Jump Game IX | Detailed Minute Points | Dry Run | Leetcode 3660 | codestorywithMIK</video:title><video:description>Jump Game IX | Detailed Minute Points | Dry Run | Leetcode 3660 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/P5OmDG_3UPs</video:player_loc><video:duration>2006</video:duration><video:publication_date>2026-05-07T13:19:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/cyclically-rotating-a-grid-leetcode-1914</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/eg8zMZKz8qk/hqdefault.jpg</video:thumbnail_loc><video:title>Cyclically Rotating a Grid | Simplified and Easy | Dry Run | Leetcode 1914 | codestorywithMIK</video:title><video:description>Cyclically Rotating a Grid | Simplified and Easy | Dry Run | Leetcode 1914 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/eg8zMZKz8qk</video:player_loc><video:duration>1256</video:duration><video:publication_date>2026-05-09T06:52:48.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/jump-game-iii-leetcode-1306</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YpNWwrDaDOc/hqdefault.jpg</video:thumbnail_loc><video:title>Jump Game III | Simple and Easy | Leetcode 1306 | codestorywithMIK</video:title><video:description>Jump Game III | Simple and Easy | Leetcode 1306 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YpNWwrDaDOc</video:player_loc><video:duration>612</video:duration><video:publication_date>2026-05-17T02:14:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/earliest-finish-time-for-land-and-water-rides-i-leetcode-3633</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/R94VBJJoqTU/hqdefault.jpg</video:thumbnail_loc><video:title>Earliest Finish Time for Land and Water Rides I and II | Story To Code | Leetcode 3633 &amp; 3635 | MIK</video:title><video:description>Earliest Finish Time for Land and Water Rides I and II | Story To Code | Leetcode 3633 &amp; 3635 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/R94VBJJoqTU</video:player_loc><video:duration>2008</video:duration><video:publication_date>2026-06-03T05:14:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/count-subarrays-with-majority-element-i-leetcode-3737</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/d8gBjEG6Ouc/hqdefault.jpg</video:thumbnail_loc><video:title>Count Subarrays With Majority Element I and II | 5 Approaches | Leetcode 3737 and 3739 | MIK</video:title><video:description>Count Subarrays With Majority Element I and II | 5 Approaches | Leetcode 3737 and 3739 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/d8gBjEG6Ouc</video:player_loc><video:duration>3605</video:duration><video:publication_date>2026-06-25T13:34:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/concatenate-non-zero-digits-and-multiply-by-sum-ii-leetcode-3756</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/zmc_FoPw_WQ/hqdefault.jpg</video:thumbnail_loc><video:title>Concatenate Non-Zero Digits and Multiply by Sum II | Detailed | Simplified | Leetcode 3756 | MIK</video:title><video:description>Concatenate Non-Zero Digits and Multiply by Sum II | Detailed | Simplified | Leetcode 3756 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/zmc_FoPw_WQ</video:player_loc><video:duration>3034</video:duration><video:publication_date>2026-07-08T05:25:35.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/rotate-array-leetcode-189</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/JcoYAYFEX-w/hqdefault.jpg</video:thumbnail_loc><video:title>Rotate Array | Shift 2D Grid | Smart Approach | Leetcode 189 | Leetcode 1260 | codestorywithMIK</video:title><video:description>Rotate Array | Shift 2D Grid | Smart Approach | Leetcode 189 | Leetcode 1260 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/JcoYAYFEX-w</video:player_loc><video:duration>1218</video:duration><video:publication_date>2026-07-20T10:42:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/maximum-sum-of-two-non-overlapping-subarrays-leetcode-1031</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/aazI9CgH2aU/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Sum of Two Non-Overlapping Subarrays | Online Assessment | Sprinkler | Leetcode 1031 | MIK</video:title><video:description>Maximum Sum of Two Non-Overlapping Subarrays | Online Assessment | Sprinkler | Leetcode 1031 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/aazI9CgH2aU</video:player_loc><video:duration>2794</video:duration><video:publication_date>2026-07-28T13:10:39.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/minimum-cost-homecoming-of-a-robot-in-a-grid-leetcode-2087</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/JIUAXtxY1mg/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Cost Homecoming of a Robot in a Grid | Juspay Online Assessment | Leetcode 2087 | MIK</video:title><video:description>Minimum Cost Homecoming of a Robot in a Grid | Juspay Online Assessment | Leetcode 2087 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/JIUAXtxY1mg</video:player_loc><video:duration>1527</video:duration><video:publication_date>2026-07-29T13:49:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/removing-minimum-and-maximum-from-array-leetcode-2091</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/rslpUxSz9BI/hqdefault.jpg</video:thumbnail_loc><video:title>Removing Minimum and Maximum From Array | Simple Observation | Leetcode 2091 | codestorywithMIK</video:title><video:description>Removing Minimum and Maximum From Array | Simple Observation | Leetcode 2091 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/rslpUxSz9BI</video:player_loc><video:duration>779</video:duration><video:publication_date>2026-08-30T03:10:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/minimum-moves-to-clean-the-classroom-leetcode-3568</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/PijSFigM9is/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Moves to Clean the Classroom | Deep Dive | Intuition | Leetcode 3568 | codestorywithMIK</video:title><video:description>Minimum Moves to Clean the Classroom | Deep Dive | Intuition | Leetcode 3568 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/PijSFigM9is</video:player_loc><video:duration>4002</video:duration><video:publication_date>2026-09-01T13:00:38.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/minimum-operations-to-sort-a-permutation-leetcode-3942</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/n70tTJWKiiw/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Operations to Sort a Permutation | Deep Dive | Clear Intuition | Proof | Leetcode 3942 | MIK</video:title><video:description>Minimum Operations to Sort a Permutation | Deep Dive | Clear Intuition | Proof | Leetcode 3942 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/n70tTJWKiiw</video:player_loc><video:duration>2844</video:duration><video:publication_date>2026-10-22T09:20:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/count-islands-with-total-value-divisible-by-k-leetcode-3619</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/xAMQP-em79w/hqdefault.jpg</video:thumbnail_loc><video:title>Count Islands With Total Value Divisible by K | Clean | Simple Approach | Leetcode 3619 | MIK</video:title><video:description>Count Islands With Total Value Divisible by K | Clean | Simple Approach | Leetcode 3619 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/xAMQP-em79w</video:player_loc><video:duration>1146</video:duration><video:publication_date>2026-10-26T02:51:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/transpose-matrix-leetcode-867</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ThwBsSxiPvk/hqdefault.jpg</video:thumbnail_loc><video:title>Transpose Matrix | Leetcode-867</video:title><video:description>Transpose Matrix | Leetcode-867. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ThwBsSxiPvk</video:player_loc><video:duration>611</video:duration><video:publication_date>2023-12-10T02:41:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/maximum-product-of-two-elements-in-an-array-leetcode-1464</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YtmAMnBjUkg/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Product of Two Elements in an Array | 2 Approaches | Leetcode-1464</video:title><video:description>Maximum Product of Two Elements in an Array | 2 Approaches | Leetcode-1464. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YtmAMnBjUkg</video:player_loc><video:duration>508</video:duration><video:publication_date>2023-12-12T04:15:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/special-positions-in-a-binary-matrix-leetcode-1582</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/evSUv26z4Wk/hqdefault.jpg</video:thumbnail_loc><video:title>Special Positions in a Binary Matrix | 2 Approaches | Leetcode 1582 | codesrorywithMIK</video:title><video:description>Special Positions in a Binary Matrix | 2 Approaches | Leetcode 1582 | codesrorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/evSUv26z4Wk</video:player_loc><video:duration>970</video:duration><video:publication_date>2023-12-13T04:41:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/maximum-product-difference-between-two-pairs-leetcode-1913</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/J-pw9rcKY3Y/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Product Difference Between Two Pairs | 2 Simple Approaches | Leetcode-1913</video:title><video:description>Maximum Product Difference Between Two Pairs | 2 Simple Approaches | Leetcode-1913. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/J-pw9rcKY3Y</video:player_loc><video:duration>586</video:duration><video:publication_date>2023-12-18T01:53:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/buy-two-chocolates-leetcode-2706</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/MihxAUNFac0/hqdefault.jpg</video:thumbnail_loc><video:title>Buy Two Chocolates | Leetcode 2706</video:title><video:description>Buy Two Chocolates | Leetcode 2706. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/MihxAUNFac0</video:player_loc><video:duration>411</video:duration><video:publication_date>2023-12-20T05:08:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/assign-cookies-leetcode-455</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/oyzF9AsOUQ8/hqdefault.jpg</video:thumbnail_loc><video:title>Assign Cookies | Google | C++ | JAVA | Leetcode 455</video:title><video:description>Assign Cookies | Google | C++ | JAVA | Leetcode 455. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/oyzF9AsOUQ8</video:player_loc><video:duration>889</video:duration><video:publication_date>2024-01-01T03:27:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/divide-array-into-arrays-with-max-difference-leetcode-2966</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/lmLHdY7nd2M/hqdefault.jpg</video:thumbnail_loc><video:title>Divide Array Into Arrays With Max Difference| Why Sorting | Google | Leetcode 2966</video:title><video:description>Divide Array Into Arrays With Max Difference| Why Sorting | Google | Leetcode 2966. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/lmLHdY7nd2M</video:player_loc><video:duration>962</video:duration><video:publication_date>2024-02-01T03:28:17.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/squares-of-a-sorted-array-leetcode-977</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/MakXVqKUcug/hqdefault.jpg</video:thumbnail_loc><video:title>Squares of a Sorted Array | 2 Approaches | Follow Up | Leetcode 977</video:title><video:description>Squares of a Sorted Array | 2 Approaches | Follow Up | Leetcode 977. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/MakXVqKUcug</video:player_loc><video:duration>385</video:duration><video:publication_date>2024-03-02T04:22:49.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/count-elements-with-maximum-frequency-leetcode-3005</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/zQUiPN0grwA/hqdefault.jpg</video:thumbnail_loc><video:title>Count Elements With Maximum Frequency | One Pass | Two Pass | Leetcode 3005</video:title><video:description>Count Elements With Maximum Frequency | One Pass | Two Pass | Leetcode 3005. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/zQUiPN0grwA</video:player_loc><video:duration>770</video:duration><video:publication_date>2024-03-08T05:57:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/minimum-common-value-leetcode-2540</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/S2u88Gzby0U/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Common Value | 3 Approaches | Leetcode 2540</video:title><video:description>Minimum Common Value | 3 Approaches | Leetcode 2540. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/S2u88Gzby0U</video:player_loc><video:duration>688</video:duration><video:publication_date>2024-03-09T05:07:45.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/intersection-of-two-arrays-leetcode-349</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/rqPu9ZvLdi0/hqdefault.jpg</video:thumbnail_loc><video:title>Intersection of Two Arrays | 4 Approaches | Leetcode 349</video:title><video:description>Intersection of Two Arrays | 4 Approaches | Leetcode 349. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/rqPu9ZvLdi0</video:player_loc><video:duration>1268</video:duration><video:publication_date>2024-03-10T04:41:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/number-of-students-unable-to-eat-lunch-leetcode-1700</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/M0lhTkhUlp4/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Students Unable to Eat Lunch | 2 Approaches | Leetcode 1700 | codestorywithMIK</video:title><video:description>Number of Students Unable to Eat Lunch | 2 Approaches | Leetcode 1700 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/M0lhTkhUlp4</video:player_loc><video:duration>1141</video:duration><video:publication_date>2024-04-08T02:21:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/time-needed-to-buy-tickets-leetcode-2073</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/r2LPa779amQ/hqdefault.jpg</video:thumbnail_loc><video:title>Time Needed to Buy Tickets | 3 Approaches | Leetcode 2073 | codestorywithMIK</video:title><video:description>Time Needed to Buy Tickets | 3 Approaches | Leetcode 2073 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/r2LPa779amQ</video:player_loc><video:duration>2249</video:duration><video:publication_date>2024-04-09T14:20:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/largest-positive-integer-that-exists-with-its-negative-leetcode-2441</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9MLiRUIbzvs/hqdefault.jpg</video:thumbnail_loc><video:title>Largest Positive Integer That Exists With Its Negative |4 Approaches|Leetcode 2441 |codestorywithMIK</video:title><video:description>Largest Positive Integer That Exists With Its Negative |4 Approaches|Leetcode 2441 |codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9MLiRUIbzvs</video:player_loc><video:duration>1685</video:duration><video:publication_date>2024-05-02T04:06:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/relative-ranks-leetcode-506</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/0UFVdlS2nwI/hqdefault.jpg</video:thumbnail_loc><video:title>Relative Ranks | 3 Approaches | Leetcode 506 | codestorywithMIK</video:title><video:description>Relative Ranks | 3 Approaches | Leetcode 506 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/0UFVdlS2nwI</video:player_loc><video:duration>1839</video:duration><video:publication_date>2024-05-08T02:53:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/largest-local-values-in-a-matrix-leetcode-2373</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/dulcB6sdIFU/hqdefault.jpg</video:thumbnail_loc><video:title>Largest Local Values in a Matrix | Easy | Leetcode 2373 | codestorywithMIK</video:title><video:description>Largest Local Values in a Matrix | Easy | Leetcode 2373 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/dulcB6sdIFU</video:player_loc><video:duration>780</video:duration><video:publication_date>2024-05-12T01:34:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/find-common-characters-leetcode-1002</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/0sMVPGsY84w/hqdefault.jpg</video:thumbnail_loc><video:title>Find Common Characters | Simple Dry Run | Leetcode 1002 | codestorywithMIK</video:title><video:description>Find Common Characters | Simple Dry Run | Leetcode 1002 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/0sMVPGsY84w</video:player_loc><video:duration>792</video:duration><video:publication_date>2024-06-05T01:28:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/relative-sort-array-leetcode-1122</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Yz202siZDHA/hqdefault.jpg</video:thumbnail_loc><video:title>Relative Sort Array | Counting Sort | Using Lambda | Leetcode 1122 | codestorywithMIK</video:title><video:description>Relative Sort Array | Counting Sort | Using Lambda | Leetcode 1122 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Yz202siZDHA</video:player_loc><video:duration>1215</video:duration><video:publication_date>2024-06-11T02:35:47.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/minimum-number-of-moves-to-seat-everyone-leetcode-2037</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/sU-yjrJTnYs/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Number of Moves to Seat Everyone | Counting Sort | Sort | Leetcode 2037 | codestorywithMIK</video:title><video:description>Minimum Number of Moves to Seat Everyone | Counting Sort | Sort | Leetcode 2037 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/sU-yjrJTnYs</video:player_loc><video:duration>1299</video:duration><video:publication_date>2024-06-13T07:41:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/intersection-of-two-arrays-ii-leetcode-350</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/gRpn4pyXf8I/hqdefault.jpg</video:thumbnail_loc><video:title>Intersection of Two Arrays II | 2 Approaches | Easy Explanations | Leetcode 350 | codestorywithMIK</video:title><video:description>Intersection of Two Arrays II | 2 Approaches | Easy Explanations | Leetcode 350 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/gRpn4pyXf8I</video:player_loc><video:duration>850</video:duration><video:publication_date>2024-07-02T01:39:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/lucky-numbers-in-a-matrix-leetcode-1380</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/iUM2dOAOA9s/hqdefault.jpg</video:thumbnail_loc><video:title>Lucky Numbers in a Matrix | 2 Approaches | Dry Run | Leetcode 1380 | codestorywithMIK</video:title><video:description>Lucky Numbers in a Matrix | 2 Approaches | Dry Run | Leetcode 1380 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/iUM2dOAOA9s</video:player_loc><video:duration>1435</video:duration><video:publication_date>2024-07-19T03:31:56.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/make-two-arrays-equal-by-reversing-subarrays-leetcode-1460</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/va0iQjn8rXU/hqdefault.jpg</video:thumbnail_loc><video:title>Make Two Arrays Equal by Reversing Subarrays | Easy | Leetcode 1460 | codestorywithMIK</video:title><video:description>Make Two Arrays Equal by Reversing Subarrays | Easy | Leetcode 1460 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/va0iQjn8rXU</video:player_loc><video:duration>723</video:duration><video:publication_date>2024-08-03T03:38:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/lemonade-change-leetcode-860</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/sYHJEPs9sSE/hqdefault.jpg</video:thumbnail_loc><video:title>Lemonade Change | Leetcode 860 | codestorywithMIK</video:title><video:description>Lemonade Change | Leetcode 860 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/sYHJEPs9sSE</video:player_loc><video:duration>653</video:duration><video:publication_date>2024-08-15T03:59:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/convert-1d-array-into-2d-array-leetcode-2022</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/4jQErv8WK6o/hqdefault.jpg</video:thumbnail_loc><video:title>Convert 1D Array Into 2D Array | 2 Approaches | Leetcode 2022 | codestorywithMIK</video:title><video:description>Convert 1D Array Into 2D Array | 2 Approaches | Leetcode 2022 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/4jQErv8WK6o</video:player_loc><video:duration>795</video:duration><video:publication_date>2024-09-01T05:48:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/check-if-n-and-its-double-exist-leetcode-1346</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/zslzulWjOV4/hqdefault.jpg</video:thumbnail_loc><video:title>Check If N and Its Double Exist | Special Motivation | Leetcode 1346 | codestorywithMIK</video:title><video:description>Check If N and Its Double Exist | Special Motivation | Leetcode 1346 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/zslzulWjOV4</video:player_loc><video:duration>897</video:duration><video:publication_date>2024-12-01T04:36:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/special-array-i-leetcode-3151</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5tp8ddCyXbs/hqdefault.jpg</video:thumbnail_loc><video:title>Special Array I | 2 Approaches | Leetcode 3151 | codestorywithMIK</video:title><video:description>Special Array I | 2 Approaches | Leetcode 3151 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5tp8ddCyXbs</video:player_loc><video:duration>476</video:duration><video:publication_date>2025-02-01T04:35:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/check-if-array-is-sorted-and-rotated-leetcode-1752</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/-o4vCUI7jmk/hqdefault.jpg</video:thumbnail_loc><video:title>Check if Array Is Sorted and Rotated | 3 Approaches | Leetcode 1752 | codestorywithMIK</video:title><video:description>Check if Array Is Sorted and Rotated | 3 Approaches | Leetcode 1752 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/-o4vCUI7jmk</video:player_loc><video:duration>2026</video:duration><video:publication_date>2025-02-02T02:59:17.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/longest-strictly-increasing-or-strictly-decreasing-subarray-leetcode-3105</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/4Hi4v5OaOEA/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Strictly Increasing or Strictly Decreasing Subarray | Leetcode 3105 | codestorywithMIK</video:title><video:description>Longest Strictly Increasing or Strictly Decreasing Subarray | Leetcode 3105 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/4Hi4v5OaOEA</video:player_loc><video:duration>931</video:duration><video:publication_date>2025-02-03T12:26:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/maximum-ascending-subarray-sum-leetcode-1800</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/gj_lvZxY7GA/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Ascending Subarray Sum | Brute Force | Optimal | Leetcode 1800 | codestorywithMIK</video:title><video:description>Maximum Ascending Subarray Sum | Brute Force | Optimal | Leetcode 1800 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/gj_lvZxY7GA</video:player_loc><video:duration>840</video:duration><video:publication_date>2025-02-04T02:08:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/apply-operations-to-an-array-leetcode-2460</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/K0FuadqyBHs/hqdefault.jpg</video:thumbnail_loc><video:title>Apply Operations to an Array | 2 Pass | 1 Pass | Leetcode 2460 | codestorywithMIK</video:title><video:description>Apply Operations to an Array | 2 Pass | 1 Pass | Leetcode 2460 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/K0FuadqyBHs</video:player_loc><video:duration>1130</video:duration><video:publication_date>2025-03-01T03:44:48.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/merge-two-2d-arrays-by-summing-values-leetcode-2570</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/G2XFLIjoIHA/hqdefault.jpg</video:thumbnail_loc><video:title>Merge Two 2D Arrays by Summing Values | Multiple Approaches | Leetcode 2570 | codestorywithMIK</video:title><video:description>Merge Two 2D Arrays by Summing Values | Multiple Approaches | Leetcode 2570 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/G2XFLIjoIHA</video:player_loc><video:duration>1252</video:duration><video:publication_date>2025-03-02T01:46:34.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/divide-array-into-equal-pairs-leetcode-2206</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9aI7FO6ZEoA/hqdefault.jpg</video:thumbnail_loc><video:title>Divide Array Into Equal Pairs | 5 Approaches | Leetcode 2206 | codestorywithMIK</video:title><video:description>Divide Array Into Equal Pairs | 5 Approaches | Leetcode 2206 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9aI7FO6ZEoA</video:player_loc><video:duration>1151</video:duration><video:publication_date>2025-03-17T04:11:48.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/count-good-triplets-leetcode-1534</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/wKrBZd2GAZM/hqdefault.jpg</video:thumbnail_loc><video:title>Count Good Triplets | Simple Approach | Slight Improvements | Leetcode 1534 | codestorywithMIK</video:title><video:description>Count Good Triplets | Simple Approach | Slight Improvements | Leetcode 1534 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/wKrBZd2GAZM</video:player_loc><video:duration>620</video:duration><video:publication_date>2025-04-14T01:13:59.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/count-equal-and-divisible-pairs-in-an-array-leetcode-2176</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/6iODXcqICGQ/hqdefault.jpg</video:thumbnail_loc><video:title>Count Equal and Divisible Pairs in an Array | Brute Force | Optimal | Detailed Maths | Leetcode 2176</video:title><video:description>Count Equal and Divisible Pairs in an Array | Brute Force | Optimal | Detailed Maths | Leetcode 2176. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/6iODXcqICGQ</video:player_loc><video:duration>1804</video:duration><video:publication_date>2025-04-17T07:27:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/count-largest-group-leetcode-1399</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/OKlmJNduTYU/hqdefault.jpg</video:thumbnail_loc><video:title>Count Largest Group | Simple Simulation | Dry Run | Leetcode 1399 | codestorywithMIK</video:title><video:description>Count Largest Group | Simple Simulation | Dry Run | Leetcode 1399 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/OKlmJNduTYU</video:player_loc><video:duration>725</video:duration><video:publication_date>2025-04-23T00:55:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/count-subarrays-of-length-three-with-a-condition-leetcode-3392</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/EM97x6t8BM4/hqdefault.jpg</video:thumbnail_loc><video:title>Count Subarrays of Length Three With a Condition | Easy | Leetcode 3392 | codestorywithMIK</video:title><video:description>Count Subarrays of Length Three With a Condition | Easy | Leetcode 3392 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/EM97x6t8BM4</video:player_loc><video:duration>415</video:duration><video:publication_date>2025-04-27T02:23:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/find-numbers-with-even-number-of-digits-leetcode-1295</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Zhzgik_hAdk/hqdefault.jpg</video:thumbnail_loc><video:title>Find Numbers With Even Number Of Digits | Multiple Ways | Leetcode 1295 | codestorywithMIK</video:title><video:description>Find Numbers With Even Number Of Digits | Multiple Ways | Leetcode 1295 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Zhzgik_hAdk</video:player_loc><video:duration>672</video:duration><video:publication_date>2025-04-30T01:22:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/three-consecutive-odds-leetcode-1550</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/p6T-osneg9g/hqdefault.jpg</video:thumbnail_loc><video:title>Three Consecutive Odds | Important Motivation | 2 Approaches | Leetcode 1550 | codestorywithMIK</video:title><video:description>Three Consecutive Odds | Important Motivation | 2 Approaches | Leetcode 1550 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/p6T-osneg9g</video:player_loc><video:duration>598</video:duration><video:publication_date>2025-05-11T05:06:39.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/longest-unequal-adjacent-groups-subsequence-i-leetcode-2900</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/6zb5qH4oNSY/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Unequal Adjacent Groups Subsequence I | Simple Intuition | Leetcode 2900 | codestorywithMIK</video:title><video:description>Longest Unequal Adjacent Groups Subsequence I | Simple Intuition | Leetcode 2900 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/6zb5qH4oNSY</video:player_loc><video:duration>909</video:duration><video:publication_date>2025-05-15T04:36:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/type-of-triangle-leetcode-3024</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/X9uqA9KhID8/hqdefault.jpg</video:thumbnail_loc><video:title>Type of Triangle | Simple Explanation | Leetcode 3024 | codestorywithMIK</video:title><video:description>Type of Triangle | Simple Explanation | Leetcode 3024 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/X9uqA9KhID8</video:player_loc><video:duration>576</video:duration><video:publication_date>2025-05-19T01:35:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/maximum-difference-between-even-and-odd-frequency-i-leetcode-3442</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/cpoRrOk03ME/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Difference Between Even and Odd Frequency I | Easy | Leetcode 3442 | codestorywithMIK</video:title><video:description>Maximum Difference Between Even and Odd Frequency I | Easy | Leetcode 3442 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/cpoRrOk03ME</video:player_loc><video:duration>390</video:duration><video:publication_date>2025-06-10T03:40:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/maximum-difference-between-adjacent-elements-in-a-circular-leetcode-3423</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/51i9Tr3Yl2Y/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Difference Between Adjacent Elements in a Circular Array | Leetcode 3423 | codestorywithMIK</video:title><video:description>Maximum Difference Between Adjacent Elements in a Circular Array | Leetcode 3423 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/51i9Tr3Yl2Y</video:player_loc><video:duration>239</video:duration><video:publication_date>2025-06-12T00:15:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/maximum-difference-between-increasing-elements-leetcode-2016</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/2WdXwYYDNNg/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Difference Between Increasing Elements | Easy | Leetcode 2016 | codestorywithMIK</video:title><video:description>Maximum Difference Between Increasing Elements | Easy | Leetcode 2016 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/2WdXwYYDNNg</video:player_loc><video:duration>640</video:duration><video:publication_date>2025-06-16T00:35:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/find-all-k-distant-indices-in-an-array-leetcode-2200</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/C7CcbVxeREQ/hqdefault.jpg</video:thumbnail_loc><video:title>Find All K-Distant Indices in an Array | Easy | Leetcode 2200 | codestorywithMIK</video:title><video:description>Find All K-Distant Indices in an Array | Easy | Leetcode 2200 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/C7CcbVxeREQ</video:player_loc><video:duration>1244</video:duration><video:publication_date>2025-06-24T04:54:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/longest-harmonious-subsequence-leetcode-594</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/M-MMjMe0P0U/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Harmonious Subsequence | Test your IQ | Leetcode 594 | codestorywithMIK</video:title><video:description>Longest Harmonious Subsequence | Test your IQ | Leetcode 594 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/M-MMjMe0P0U</video:player_loc><video:duration>1355</video:duration><video:publication_date>2025-06-30T01:09:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/count-hills-and-valleys-in-an-array-leetcode-2210</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/NK83TS3xi0c/hqdefault.jpg</video:thumbnail_loc><video:title>Count Hills and Valleys in an Array | Simple Explanation | Leetcode 2210 | codestorywithMIK</video:title><video:description>Count Hills and Valleys in an Array | Simple Explanation | Leetcode 2210 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/NK83TS3xi0c</video:player_loc><video:duration>660</video:duration><video:publication_date>2025-07-27T05:37:13.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/find-n-unique-integers-sum-up-to-zero-leetcode-1304</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Pt_kSV_0HDU/hqdefault.jpg</video:thumbnail_loc><video:title>Find N Unique Integers Sum up to Zero | 2 Easy Ways | Leetcode 1304 | codestorywithMIK</video:title><video:description>Find N Unique Integers Sum up to Zero | 2 Easy Ways | Leetcode 1304 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Pt_kSV_0HDU</video:player_loc><video:duration>570</video:duration><video:publication_date>2025-09-07T07:49:23.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/convert-integer-to-the-sum-of-two-no-zero-integers-leetcode-1317</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ig4llTdg6_E/hqdefault.jpg</video:thumbnail_loc><video:title>Convert Integer to the Sum of Two No-Zero Integers | Brute Force | Optimal | Leetcode 1317 | MIK</video:title><video:description>Convert Integer to the Sum of Two No-Zero Integers | Brute Force | Optimal | Leetcode 1317 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ig4llTdg6_E</video:player_loc><video:duration>1542</video:duration><video:publication_date>2025-09-08T07:52:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/adjacent-increasing-subarrays-detection-i-leetcode-3349</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/DB0llpjZOhs/hqdefault.jpg</video:thumbnail_loc><video:title>Adjacent Increasing Subarrays Detection I | Simple and Intuitive | Leetcode 3349 | codestorywithMIK</video:title><video:description>Adjacent Increasing Subarrays Detection I | Simple and Intuitive | Leetcode 3349 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/DB0llpjZOhs</video:player_loc><video:duration>1611</video:duration><video:publication_date>2025-10-14T11:59:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/make-array-elements-equal-to-zero-leetcode-3354</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/1uMoX4soG38/hqdefault.jpg</video:thumbnail_loc><video:title>Make Array Elements Equal to Zero | Brute Force | Optimal | Detailed Dry Runs | Leetcode 3354 | MIK</video:title><video:description>Make Array Elements Equal to Zero | Brute Force | Optimal | Detailed Dry Runs | Leetcode 3354 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/1uMoX4soG38</video:player_loc><video:duration>1816</video:duration><video:publication_date>2025-10-28T13:32:51.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/check-if-all-1s-are-at-least-length-k-places-away-leetcode-1437</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/tEi_ZUkC7wk/hqdefault.jpg</video:thumbnail_loc><video:title>Check If All 1&apos;s Are at Least Length K Places Away | Easy | Leetcode 1437 | codestorywithMIK</video:title><video:description>Check If All 1&apos;s Are at Least Length K Places Away | Easy | Leetcode 1437 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/tEi_ZUkC7wk</video:player_loc><video:duration>452</video:duration><video:publication_date>2025-11-17T03:48:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/1-bit-and-2-bit-characters-leetcode-717</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/sHRlVNgUjwA/hqdefault.jpg</video:thumbnail_loc><video:title>1-bit and 2-bit Characters | 2 Ways | Easy | Leetcode 717 | codestorywithMIK</video:title><video:description>1-bit and 2-bit Characters | 2 Ways | Easy | Leetcode 717 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/sHRlVNgUjwA</video:player_loc><video:duration>1019</video:duration><video:publication_date>2025-11-18T05:22:25.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/count-partitions-with-even-sum-difference-leetcode-3432</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/6FMrZXz2kMA/hqdefault.jpg</video:thumbnail_loc><video:title>Count Partitions with Even Sum Difference | Multiple Approaches | Leetcode 3432 | codestorywithMIK</video:title><video:description>Count Partitions with Even Sum Difference | Multiple Approaches | Leetcode 3432 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/6FMrZXz2kMA</video:player_loc><video:duration>1195</video:duration><video:publication_date>2025-12-05T05:06:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/apple-redistribution-into-boxes-leetcode-3074</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/e7ZHyvP_3Sk/hqdefault.jpg</video:thumbnail_loc><video:title>Apple Redistribution into Boxes | Simple Explanation | Homework Inside | Leetcode 3074 | MIK</video:title><video:description>Apple Redistribution into Boxes | Simple Explanation | Homework Inside | Leetcode 3074 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/e7ZHyvP_3Sk</video:player_loc><video:duration>593</video:duration><video:publication_date>2025-12-24T04:15:45.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/plus-one-leetcode-66</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/mStAXMDK6xU/hqdefault.jpg</video:thumbnail_loc><video:title>Plus One | Constraint Analysis | Detailed For Beginners | Leetcode 66 | codestorywithMIK</video:title><video:description>Plus One | Constraint Analysis | Detailed For Beginners | Leetcode 66 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/mStAXMDK6xU</video:player_loc><video:duration>1049</video:duration><video:publication_date>2026-01-01T04:56:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/minimum-pair-removal-to-sort-array-i-leetcode-3507</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/kwrBFKA0Huo/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Pair Removal to Sort Array I | Simple Explanation | Leetcode 3507 | codestorywithMIK</video:title><video:description>Minimum Pair Removal to Sort Array I | Simple Explanation | Leetcode 3507 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/kwrBFKA0Huo</video:player_loc><video:duration>696</video:duration><video:publication_date>2026-01-22T03:28:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/minimum-difference-between-highest-and-lowest-of-k-scores-leetcode-1984</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/k-ZtDvayDys/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Difference Between Highest and Lowest of K Scores | Easy | Leetcode 1984 | codestorywithMIK</video:title><video:description>Minimum Difference Between Highest and Lowest of K Scores | Easy | Leetcode 1984 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/k-ZtDvayDys</video:player_loc><video:duration>697</video:duration><video:publication_date>2026-01-25T02:18:39.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/minimum-difference-between-highest-and-lowest-of-k-scores-leetcode-1200</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9flIHrF2tuA/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Absolute Difference | Simple Explanation | Leetcode 1200 | codestorywithMIK</video:title><video:description>Minimum Absolute Difference | Simple Explanation | Leetcode 1200 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9flIHrF2tuA</video:player_loc><video:duration>529</video:duration><video:publication_date>2026-01-26T01:30:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/divide-an-array-into-subarrays-with-minimum-cost-i-leetcode-3010</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/zuBKtLVXAgY/hqdefault.jpg</video:thumbnail_loc><video:title>Divide an Array Into Subarrays With Minimum Cost I | Simple Intuition | Leetcode 3010 | MIK</video:title><video:description>Divide an Array Into Subarrays With Minimum Cost I | Simple Intuition | Leetcode 3010 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/zuBKtLVXAgY</video:player_loc><video:duration>560</video:duration><video:publication_date>2026-02-01T02:07:56.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/trionic-array-i-leetcode-3637</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/xl0QjGnOU7I/hqdefault.jpg</video:thumbnail_loc><video:title>Trionic Array I | Simple Intuition | Dry Run | Leetcode 3637 | codestorywithMIK</video:title><video:description>Trionic Array I | Simple Intuition | Dry Run | Leetcode 3637 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/xl0QjGnOU7I</video:player_loc><video:duration>667</video:duration><video:publication_date>2026-02-03T00:20:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/transformed-array-leetcode-3379</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QYdqUMhdxpU/hqdefault.jpg</video:thumbnail_loc><video:title>Transformed Array | Cleanest Implementation | Leetcode 3379 | codestorywithMIK</video:title><video:description>Transformed Array | Cleanest Implementation | Leetcode 3379 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QYdqUMhdxpU</video:player_loc><video:duration>1031</video:duration><video:publication_date>2026-02-05T00:26:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/flip-square-submatrix-vertically-leetcode-3643</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/0OKMEALVx6w/hqdefault.jpg</video:thumbnail_loc><video:title>Flip Square Submatrix Vertically | Clean Simple Code | Leetcode 3643 | codestorywithMIK</video:title><video:description>Flip Square Submatrix Vertically | Clean Simple Code | Leetcode 3643 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/0OKMEALVx6w</video:player_loc><video:duration>429</video:duration><video:publication_date>2026-03-21T04:52:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/determine-whether-matrix-can-be-obtained-by-rotation-leetcode-1886</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/N4KEX5-Pi34/hqdefault.jpg</video:thumbnail_loc><video:title>Determine Whether Matrix Can Be Obtained By Rotation | Simple Detailed | Leetcode 1886 | MIK</video:title><video:description>Determine Whether Matrix Can Be Obtained By Rotation | Simple Detailed | Leetcode 1886 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/N4KEX5-Pi34</video:player_loc><video:duration>1215</video:duration><video:publication_date>2026-03-22T00:25:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/matrix-similarity-after-cyclic-shift-leetcode-2946</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/RIRi89awC-s/hqdefault.jpg</video:thumbnail_loc><video:title>Matrix Similarity After Cyclic Shifts | 2 Simple Approaches | Leetcode 2946 | codestorywithMIK</video:title><video:description>Matrix Similarity After Cyclic Shifts | 2 Simple Approaches | Leetcode 2946 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/RIRi89awC-s</video:player_loc><video:duration>1469</video:duration><video:publication_date>2026-03-27T03:31:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/xor-after-range-multiplication-queries-i-leetcode-3653</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/do3fgZMPiGs/hqdefault.jpg</video:thumbnail_loc><video:title>XOR After Range Multiplication Queries I | Simple Explanation | Leetcode 3653 | codestorywithMIK</video:title><video:description>XOR After Range Multiplication Queries I | Simple Explanation | Leetcode 3653 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/do3fgZMPiGs</video:player_loc><video:duration>507</video:duration><video:publication_date>2026-04-08T01:01:39.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/minimum-distance-to-the-target-element-leetcode-1848</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/_b_QfxC56EA/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Distance to the Target Element | Simple Explanation | Early Break | Leetcode 1848 | MIK</video:title><video:description>Minimum Distance to the Target Element | Simple Explanation | Early Break | Leetcode 1848 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/_b_QfxC56EA</video:player_loc><video:duration>409</video:duration><video:publication_date>2026-04-13T03:36:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/shortest-distance-to-target-string-in-a-circular-array-leetcode-2515</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/3zm-QWciVeI/hqdefault.jpg</video:thumbnail_loc><video:title>Shortest Distance to Target String in a Circular Array | Circular Trick | Leetcode 2515 | MIK</video:title><video:description>Shortest Distance to Target String in a Circular Array | Circular Trick | Leetcode 2515 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/3zm-QWciVeI</video:player_loc><video:duration>713</video:duration><video:publication_date>2026-04-15T00:22:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/two-furthest-houses-with-different-colors-leetcode-2078</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/TGaKkfMe_00/hqdefault.jpg</video:thumbnail_loc><video:title>Two Furthest Houses With Different Colors | 4 Ways | Simple Explanation | Leetcode 2078 | MIK</video:title><video:description>Two Furthest Houses With Different Colors | 4 Ways | Simple Explanation | Leetcode 2078 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/TGaKkfMe_00</video:player_loc><video:duration>1122</video:duration><video:publication_date>2026-04-20T00:20:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/check-if-array-is-good-leetcode-2784</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/68cEmBbqZRE/hqdefault.jpg</video:thumbnail_loc><video:title>Check if Array is Good | 3 Approaches | Dry Runs | Leetcode 2784 | codestorywithMIK</video:title><video:description>Check if Array is Good | 3 Approaches | Dry Runs | Leetcode 2784 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/68cEmBbqZRE</video:player_loc><video:duration>1842</video:duration><video:publication_date>2026-05-14T14:48:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/minimum-cost-of-buying-candies-with-discount-leetcode-2144</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/zbnOyj11Eao/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Cost of Buying Candies With Discount | Simple Intuition | Leetcode 2144 | codestorywithMIK</video:title><video:description>Minimum Cost of Buying Candies With Discount | Simple Intuition | Leetcode 2144 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/zbnOyj11Eao</video:player_loc><video:duration>801</video:duration><video:publication_date>2026-06-01T01:40:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/smallest-stable-index-i-leetcode-3903</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/KBc7A_3tBBs/hqdefault.jpg</video:thumbnail_loc><video:title>Smallest Stable Index I &amp; II | Simple Intuition | Leetcode 3903 &amp; 3904 | codestorywithMIK</video:title><video:description>Smallest Stable Index I &amp; II | Simple Intuition | Leetcode 3903 &amp; 3904 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/KBc7A_3tBBs</video:player_loc><video:duration>1018</video:duration><video:publication_date>2026-09-04T00:23:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/find-target-indices-after-sorting-array-leetcode-2089</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/uSGYRtZx4Yc/hqdefault.jpg</video:thumbnail_loc><video:title>Find Target Indices After Sorting Array | 3 Simple Approaches | Leetcode 2089 | codestorywithMIK</video:title><video:description>Find Target Indices After Sorting Array | 3 Simple Approaches | Leetcode 2089 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/uSGYRtZx4Yc</video:player_loc><video:duration>980</video:duration><video:publication_date>2026-10-19T04:31:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/count-days-spent-together-leetcode-2409</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/RK9v3tuy8X4/hqdefault.jpg</video:thumbnail_loc><video:title>Count Days Spent Together | Clean | Simple Approach | Leetcode 2409 | codestorywithMIK</video:title><video:description>Count Days Spent Together | Clean | Simple Approach | Leetcode 2409 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/RK9v3tuy8X4</video:player_loc><video:duration>1122</video:duration><video:publication_date>2026-10-24T08:48:35.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/find-smallest-letter-greater-than-target-leetcode-744</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/MCllDgxFY_k/hqdefault.jpg</video:thumbnail_loc><video:title>Find Smallest Letter Greater Than Target | 3 Approaches | Easy | Leetcode 744 | codestorywithMIK</video:title><video:description>Find Smallest Letter Greater Than Target | 3 Approaches | Easy | Leetcode 744 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/MCllDgxFY_k</video:player_loc><video:duration>894</video:duration><video:publication_date>2023-06-09T03:34:51.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/largest-number-leetcode-179</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/oJyl4fbfpM0/hqdefault.jpg</video:thumbnail_loc><video:title>Largest Number formed from an Array | Largest Number | Comparators Application | Leetcode 179</video:title><video:description>Largest Number formed from an Array | Largest Number | Comparators Application | Leetcode 179. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/oJyl4fbfpM0</video:player_loc><video:duration>1230</video:duration><video:publication_date>2024-03-04T12:03:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/maximum-count-of-positive-integer-and-negative-integer-leetcode-2529</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/UzMHKxngSy0/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Count of Positive Integer and Negative Integer | Leetcode 2529 | codestorywithMIK</video:title><video:description>Maximum Count of Positive Integer and Negative Integer | Leetcode 2529 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/UzMHKxngSy0</video:player_loc><video:duration>2019</video:duration><video:publication_date>2025-03-12T03:39:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/arrays/find-words-containing-character-leetcode-2942</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ULWeRPZHphw/hqdefault.jpg</video:thumbnail_loc><video:title>What is Lambda Capture | C++ | Java | Leetcode 2942 | codestorywithMIK</video:title><video:description>What is Lambda Capture | C++ | Java | Leetcode 2942 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ULWeRPZHphw</video:player_loc><video:duration>918</video:duration><video:publication_date>2025-05-24T06:34:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/knuth-morris-pratt-kmp-string-matching-algorithm</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/qases-9gOpk/hqdefault.jpg</video:thumbnail_loc><video:title>Knuth-Morris-Pratt KMP String Matching Algorithm | Search Pattern | GFG POTD</video:title><video:description>Knuth-Morris-Pratt KMP String Matching Algorithm | Search Pattern | GFG POTD. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/qases-9gOpk</video:player_loc><video:duration>3936</video:duration><video:publication_date>2024-01-09T15:47:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/words-within-two-edits-of-dictionary-leetcode-2452</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/b1nU-JFcn98/hqdefault.jpg</video:thumbnail_loc><video:title>Words Within Two Edits of Dictionary | Simple Approach | Overkill Approach | Leetcode 2452 | MIK</video:title><video:description>Words Within Two Edits of Dictionary | Simple Approach | Overkill Approach | Leetcode 2452 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/b1nU-JFcn98</video:player_loc><video:duration>878</video:duration><video:publication_date>2026-04-22T03:35:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/string-compression-leetcode-443</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/I7drewKcN1Y/hqdefault.jpg</video:thumbnail_loc><video:title>String Compression | Amazon | Snapchat | Microsoft |  Leetcode 443</video:title><video:description>String Compression | Amazon | Snapchat | Microsoft |  Leetcode 443. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/I7drewKcN1Y</video:player_loc><video:duration>1174</video:duration><video:publication_date>2022-10-15T07:04:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/check-if-the-sentence-is-pangram-leetcode-1832</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/rMM8Brb-lko/hqdefault.jpg</video:thumbnail_loc><video:title>Check if the Sentence Is Pangram | 2 Approaches | Snapdeal | Leetcode 1832</video:title><video:description>Check if the Sentence Is Pangram | 2 Approaches | Snapdeal | Leetcode 1832. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/rMM8Brb-lko</video:player_loc><video:duration>709</video:duration><video:publication_date>2022-10-17T02:02:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/count-and-say-leetcode-38</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5uJitfSM3vk/hqdefault.jpg</video:thumbnail_loc><video:title>Count and Say | Made Super Easy | Simple Explanation | Leetcode 38 | codestorywithMIK</video:title><video:description>Count and Say | Made Super Easy | Simple Explanation | Leetcode 38 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5uJitfSM3vk</video:player_loc><video:duration>988</video:duration><video:publication_date>2022-10-18T03:21:51.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/integer-to-roman-leetcode-12</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/2FPvU8XmsKU/hqdefault.jpg</video:thumbnail_loc><video:title>Integer to Roman -(Amazon, Facebook, Microsoft, Twitter, Apple, Google..): Explanation ➕ Live Coding</video:title><video:description>Integer to Roman -(Amazon, Facebook, Microsoft, Twitter, Apple, Google..): Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/2FPvU8XmsKU</video:player_loc><video:duration>1041</video:duration><video:publication_date>2022-10-20T04:32:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/check-if-two-string-arrays-are-equivalent-leetcode-1662</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/B7_jRUZPUCU/hqdefault.jpg</video:thumbnail_loc><video:title>Check If Two String Arrays are Equivalent | Goldman Sachs | Explanation | Live Coding</video:title><video:description>Check If Two String Arrays are Equivalent | Goldman Sachs | Explanation | Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/B7_jRUZPUCU</video:player_loc><video:duration>879</video:duration><video:publication_date>2022-10-25T04:08:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/orderly-queue-leetcode-899</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5TNRCLbU7H4/hqdefault.jpg</video:thumbnail_loc><video:title>Orderly Queue -(Amazon): Explanation ➕ Live Coding</video:title><video:description>Orderly Queue -(Amazon): Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5TNRCLbU7H4</video:player_loc><video:duration>1217</video:duration><video:publication_date>2022-11-06T10:10:47.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/make-the-string-great-leetcode-1544</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/J43ZIltH3AY/hqdefault.jpg</video:thumbnail_loc><video:title>Make The String Great | Google | Easy | Leetcode 1544</video:title><video:description>Make The String Great | Google | Easy | Leetcode 1544. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/J43ZIltH3AY</video:player_loc><video:duration>743</video:duration><video:publication_date>2022-11-08T05:41:45.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/determine-if-string-halves-are-alike-leetcode-1704</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/oSSMo0PCQts/hqdefault.jpg</video:thumbnail_loc><video:title>Determine if String Halves Are Alike | Screening Problem | Leetcode 1704</video:title><video:description>Determine if String Halves Are Alike | Screening Problem | Leetcode 1704. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/oSSMo0PCQts</video:player_loc><video:duration>534</video:duration><video:publication_date>2022-12-01T04:08:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/determine-if-two-strings-are-close-leetcode-1657</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/KbdCp4nUDiQ/hqdefault.jpg</video:thumbnail_loc><video:title>Determine if Two Strings Are Close | Intuition |  Google | Leetcode 1657</video:title><video:description>Determine if Two Strings Are Close | Intuition |  Google | Leetcode 1657. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/KbdCp4nUDiQ</video:player_loc><video:duration>1463</video:duration><video:publication_date>2022-12-02T05:39:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/detect-capital-leetcode-520</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/DrVLI_NXaic/hqdefault.jpg</video:thumbnail_loc><video:title>Detect Capital -(GOOGLE) : Explanation ➕ Live Coding 🧑🏻‍💻👩🏻‍💻</video:title><video:description>Detect Capital -(GOOGLE) : Explanation ➕ Live Coding 🧑🏻‍💻👩🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/DrVLI_NXaic</video:player_loc><video:duration>584</video:duration><video:publication_date>2023-01-02T08:00:53.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/delete-columns-to-make-sorted-leetcode-944</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/tFQWBeljuaU/hqdefault.jpg</video:thumbnail_loc><video:title>Delete Columns to Make Sorted | MICROSOFT | Leetcode 944 | codestorywithMIK</video:title><video:description>Delete Columns to Make Sorted | MICROSOFT | Leetcode 944 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/tFQWBeljuaU</video:player_loc><video:duration>416</video:duration><video:publication_date>2023-01-03T04:15:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/restore-ip-addresses-leetcode-93</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/A0E8YGCAfEE/hqdefault.jpg</video:thumbnail_loc><video:title>Restore IP Addresses | Recursive Tree | Diagram | META | Leetcode 93</video:title><video:description>Restore IP Addresses | Recursive Tree | Diagram | META | Leetcode 93. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/A0E8YGCAfEE</video:player_loc><video:duration>2281</video:duration><video:publication_date>2023-01-21T10:52:38.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/concatenated-words-leetcode-472</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/zZsnMAgM6Q0/hqdefault.jpg</video:thumbnail_loc><video:title>Concatenated Words | Simple Story | META | Leetcode 472</video:title><video:description>Concatenated Words | Simple Story | META | Leetcode 472. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/zZsnMAgM6Q0</video:player_loc><video:duration>1397</video:duration><video:publication_date>2023-01-27T11:01:57.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/find-the-index-of-the-first-occurrence-in-a-string-leetcode-28</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/7UBEku3y2Ig/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Index of the First Occurrence in a String | Google, Microsoft |  Leetcode 28</video:title><video:description>Find the Index of the First Occurrence in a String | Google, Microsoft |  Leetcode 28. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/7UBEku3y2Ig</video:player_loc><video:duration>932</video:duration><video:publication_date>2023-03-03T11:01:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/buddy-strings-leetcode-859</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/LTrZCwuCoiE/hqdefault.jpg</video:thumbnail_loc><video:title>Buddy Strings | GOOGLE | META | Leetcode-859 | Explanation ➕ Live Coding</video:title><video:description>Buddy Strings | GOOGLE | META | Leetcode-859 | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/LTrZCwuCoiE</video:player_loc><video:duration>942</video:duration><video:publication_date>2023-07-03T02:34:13.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/substring-with-largest-variance-leetcode-2272</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/M428--94ny0/hqdefault.jpg</video:thumbnail_loc><video:title>Substring With Largest Variance | Full Dry Run | Leetcode-2272 | AMAZON | GOOGLE | Explanation</video:title><video:description>Substring With Largest Variance | Full Dry Run | Leetcode-2272 | AMAZON | GOOGLE | Explanation. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/M428--94ny0</video:player_loc><video:duration>2429</video:duration><video:publication_date>2023-07-09T10:34:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/repeated-substring-pattern-leetcode-459</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/7J8x0XudV0Y/hqdefault.jpg</video:thumbnail_loc><video:title>Repeated Substring Pattern | Full Intuition | Time Complexity | GOOGLE | AMAZON | Leetcode-459</video:title><video:description>Repeated Substring Pattern | Full Intuition | Time Complexity | GOOGLE | AMAZON | Leetcode-459. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/7J8x0XudV0Y</video:player_loc><video:duration>1295</video:duration><video:publication_date>2023-08-21T03:53:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/text-justification-leetcode-68</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/jpU2LVaDa4g/hqdefault.jpg</video:thumbnail_loc><video:title>Text Justification | Broken into Pieces | GOOGLE | Leetcode-68 | Explanation + Live Coding</video:title><video:description>Text Justification | Broken into Pieces | GOOGLE | Leetcode-68 | Explanation + Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/jpU2LVaDa4g</video:player_loc><video:duration>2117</video:duration><video:publication_date>2023-08-24T06:59:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/number-of-matching-subsequences-leetcode-392</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/r51_ZifUdvU/hqdefault.jpg</video:thumbnail_loc><video:title>Is Subsequence | With Follow Up Solved | 2 Approaches | AMAZON | Leetcode - 392</video:title><video:description>Is Subsequence | With Follow Up Solved | 2 Approaches | AMAZON | Leetcode - 392. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/r51_ZifUdvU</video:player_loc><video:duration>1140</video:duration><video:publication_date>2023-09-22T04:04:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/smallest-subsequence-of-distinct-characters-leetcode-316</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/rU5p0MRm5zU/hqdefault.jpg</video:thumbnail_loc><video:title>Remove Duplicate Letters | Why Monotonic Stack | Intuition | Leetcode - 316 | Same as Leetcode 1081</video:title><video:description>Remove Duplicate Letters | Why Monotonic Stack | Intuition | Leetcode - 316 | Same as Leetcode 1081. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/rU5p0MRm5zU</video:player_loc><video:duration>1384</video:duration><video:publication_date>2023-09-26T03:31:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/decoded-string-at-index-leetcode-880</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/xK95Wlng_RA/hqdefault.jpg</video:thumbnail_loc><video:title>Decoded String at Index | Clean Code | TCS | GOOGLE | ORACLE | Leetcode - 880</video:title><video:description>Decoded String at Index | Clean Code | TCS | GOOGLE | ORACLE | Leetcode - 880. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/xK95Wlng_RA</video:player_loc><video:duration>1330</video:duration><video:publication_date>2023-09-27T04:49:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/reverse-words-in-a-string-iii-leetcode-557</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/c-cT9b2YyXk/hqdefault.jpg</video:thumbnail_loc><video:title>Reverse Words in a String III | 2 Approaches | Zappos | MentorGraphics  | Leetcode - 557 | Live Code</video:title><video:description>Reverse Words in a String III | 2 Approaches | Zappos | MentorGraphics  | Leetcode - 557 | Live Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/c-cT9b2YyXk</video:player_loc><video:duration>866</video:duration><video:publication_date>2023-10-01T09:38:38.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/backspace-string-compare-leetcode-844</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/u6K3j3n3vbA/hqdefault.jpg</video:thumbnail_loc><video:title>Backspace String Compare | 2 Approaches | GOOGLE | Leetcode - 844 | Live Code | Explanation</video:title><video:description>Backspace String Compare | 2 Approaches | GOOGLE | Leetcode - 844 | Live Code | Explanation. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/u6K3j3n3vbA</video:player_loc><video:duration>1086</video:duration><video:publication_date>2023-10-19T10:32:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/count-number-of-homogenous-substrings-leetcode-1759</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/qEJR7ox0mNI/hqdefault.jpg</video:thumbnail_loc><video:title>Count Number of Homogenous Substrings | Intuition | Math | Leetcode - 1759</video:title><video:description>Count Number of Homogenous Substrings | Intuition | Math | Leetcode - 1759. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/qEJR7ox0mNI</video:player_loc><video:duration>766</video:duration><video:publication_date>2023-11-09T03:20:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/sort-vowels-in-a-string-leetcode-2785</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/nEDXPkGsjXo/hqdefault.jpg</video:thumbnail_loc><video:title>Sort Vowels in a String | 2 Approaches | Intuition | MICROSOFT | Leetcode-2785</video:title><video:description>Sort Vowels in a String | 2 Approaches | Intuition | MICROSOFT | Leetcode-2785. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/nEDXPkGsjXo</video:player_loc><video:duration>1319</video:duration><video:publication_date>2023-11-13T05:38:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/unique-length-3-palindromic-subsequences-leetcode-1930</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/EdEvy2_o5OE/hqdefault.jpg</video:thumbnail_loc><video:title>Unique Length-3 Palindromic Subsequences | 2 Ways | Intuition | Leetcode 1930 | codestorywithMIK</video:title><video:description>Unique Length-3 Palindromic Subsequences | 2 Ways | Intuition | Leetcode 1930 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/EdEvy2_o5OE</video:player_loc><video:duration>1709</video:duration><video:publication_date>2023-11-14T03:29:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/find-unique-binary-string-leetcode-1980</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8Cay8q3BOx4/hqdefault.jpg</video:thumbnail_loc><video:title>Find Unique Binary String | Multiple Approaches | Intuition | Leetcode 1980 | codestorywithMIK</video:title><video:description>Find Unique Binary String | Multiple Approaches | Intuition | Leetcode 1980 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8Cay8q3BOx4</video:player_loc><video:duration>1484</video:duration><video:publication_date>2023-11-16T03:37:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/count-beautiful-substrings-i-leetcode-2947</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ipobT-2_DkQ/hqdefault.jpg</video:thumbnail_loc><video:title>Count Beautiful Substrings I | Simple Approach | Leetcode - 2947 | Weekly Contest 373</video:title><video:description>Count Beautiful Substrings I | Simple Approach | Leetcode - 2947 | Weekly Contest 373. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ipobT-2_DkQ</video:player_loc><video:duration>913</video:duration><video:publication_date>2023-11-27T04:25:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/count-beautiful-substrings-ii-leetcode-2949</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Th4jtNqzyEc/hqdefault.jpg</video:thumbnail_loc><video:title>Count Beautiful Substrings II | Detailed Approach | Intuition | Leetcode - 2949 | Weekly Contest 373</video:title><video:description>Count Beautiful Substrings II | Detailed Approach | Intuition | Leetcode - 2949 | Weekly Contest 373. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Th4jtNqzyEc</video:player_loc><video:duration>3160</video:duration><video:publication_date>2023-11-27T23:30:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/number-of-ways-to-divide-a-long-corridor-leetcode-2147</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ixzhJ8OoA6Q/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Ways to Divide a Long Corridor | Clear Intuition | Dry Run | Leetcode 2147 | MIK</video:title><video:description>Number of Ways to Divide a Long Corridor | Clear Intuition | Dry Run | Leetcode 2147 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ixzhJ8OoA6Q</video:player_loc><video:duration>1438</video:duration><video:publication_date>2023-11-28T04:19:13.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/number-of-laser-beams-in-a-bank-leetcode-2125</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/3-c1Gc-5QnE/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Laser Beams in a Bank | Clear Explanation | Dry Run | Amazon | Leetcode 2125</video:title><video:description>Number of Laser Beams in a Bank | Clear Explanation | Dry Run | Amazon | Leetcode 2125. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/3-c1Gc-5QnE</video:player_loc><video:duration>834</video:duration><video:publication_date>2024-01-03T02:52:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/minimum-number-of-steps-to-make-two-strings-anagram-leetcode-1347</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/dDQTlfWvzqE/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Number of Steps to Make Two Strings Anagram | Simple | Intuitive | Google | Leetcode 1347</video:title><video:description>Minimum Number of Steps to Make Two Strings Anagram | Simple | Intuitive | Google | Leetcode 1347. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/dDQTlfWvzqE</video:player_loc><video:duration>1164</video:duration><video:publication_date>2024-01-13T06:47:57.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/find-beautiful-indices-in-the-given-array-i-leetcode-3006</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/7Sm0o5lMmfY/hqdefault.jpg</video:thumbnail_loc><video:title>Find Beautiful Indices in the Given Array | Part I | Part II | Same Code | KMP | Weekly Contest 380</video:title><video:description>Find Beautiful Indices in the Given Array | Part I | Part II | Same Code | KMP | Weekly Contest 380. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/7Sm0o5lMmfY</video:player_loc><video:duration>1688</video:duration><video:publication_date>2024-01-14T07:21:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/minimum-time-to-revert-word-to-initial-state-i-leetcode-3029</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/4lrczVkMYko/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Time to Revert Word to Initial State | Part I | Part II | KMP | Leetcode 3029 | 3031</video:title><video:description>Minimum Time to Revert Word to Initial State | Part I | Part II | KMP | Leetcode 3029 | 3031. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/4lrczVkMYko</video:player_loc><video:duration>4042</video:duration><video:publication_date>2024-02-07T13:39:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/custom-sort-string-leetcode-791</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/oGPfmp71Zm4/hqdefault.jpg</video:thumbnail_loc><video:title>Custom Sort String | 2 Approaches | Intuition | Meta | Leetcode 791</video:title><video:description>Custom Sort String | 2 Approaches | Intuition | Meta | Leetcode 791. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/oGPfmp71Zm4</video:player_loc><video:duration>1713</video:duration><video:publication_date>2024-03-11T04:12:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/shortest-uncommon-substring-in-an-array-leetcode-3076</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/wHXZ5_JmLa8/hqdefault.jpg</video:thumbnail_loc><video:title>Shortest Uncommon Substring in an Array | Detailed Intuition | Dry Run | Leetcode 3076 | Contest 388</video:title><video:description>Shortest Uncommon Substring in an Array | Detailed Intuition | Dry Run | Leetcode 3076 | Contest 388. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/wHXZ5_JmLa8</video:player_loc><video:duration>2409</video:duration><video:publication_date>2024-03-11T10:58:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/count-substrings-starting-and-ending-with-given-character-leetcode-3084</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/hnyEFhFmlo4/hqdefault.jpg</video:thumbnail_loc><video:title>Count Substrings Starting and Ending with Given Character | Leetcode 3084 | codestorywithMIK</video:title><video:description>Count Substrings Starting and Ending with Given Character | Leetcode 3084 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/hnyEFhFmlo4</video:player_loc><video:duration>699</video:duration><video:publication_date>2024-03-17T04:47:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/compare-version-numbers-leetcode-165</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Mmy9hdPXwRc/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode 165: Compare Version Numbers with stringstream | StringTokenizer | codestorywithMIK</video:title><video:description>Leetcode 165: Compare Version Numbers with stringstream | StringTokenizer | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Mmy9hdPXwRc</video:player_loc><video:duration>1400</video:duration><video:publication_date>2024-05-03T04:32:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/append-characters-to-string-to-make-subsequence-leetcode-2486</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/WVDQWJuzLmw/hqdefault.jpg</video:thumbnail_loc><video:title>Append Characters to String to Make Subsequence | Simple Approach | Leetcode 2486 | codestorywithMIK</video:title><video:description>Append Characters to String to Make Subsequence | Simple Approach | Leetcode 2486 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/WVDQWJuzLmw</video:player_loc><video:duration>417</video:duration><video:publication_date>2024-06-03T01:42:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/sort-the-jumbled-numbers-leetcode-2191</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/BXHWgX4UX04/hqdefault.jpg</video:thumbnail_loc><video:title>Sort the Jumbled Numbers | 2 Approaches | Leetcode 2191 | codestorywithMIK</video:title><video:description>Sort the Jumbled Numbers | 2 Approaches | Leetcode 2191 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/BXHWgX4UX04</video:player_loc><video:duration>1625</video:duration><video:publication_date>2024-07-24T04:14:45.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/fraction-addition-and-subtraction-leetcode-592</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Uh-KE4D2MOM/hqdefault.jpg</video:thumbnail_loc><video:title>Fraction Addition and Subtraction | Simple Simulation | Leetcode 592 | codestorywithMIK</video:title><video:description>Fraction Addition and Subtraction | Simple Simulation | Leetcode 592 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Uh-KE4D2MOM</video:player_loc><video:duration>1346</video:duration><video:publication_date>2024-08-23T01:41:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/find-the-closest-palindrome-leetcode-564</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/TOqxzXrSAPY/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Closest Palindrome | Simple Observations | Leetcode 564 | codestorywithMIK</video:title><video:description>Find the Closest Palindrome | Simple Observations | Leetcode 564 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/TOqxzXrSAPY</video:player_loc><video:duration>2349</video:duration><video:publication_date>2024-08-24T14:22:48.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/shortest-palindrome-leetcode-214</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5DACQK9kud0/hqdefault.jpg</video:thumbnail_loc><video:title>Shortest Palindrome | Multiple Ways | KMP Zindabaad | Leetcode 214 | codestorywithMIK</video:title><video:description>Shortest Palindrome | Multiple Ways | KMP Zindabaad | Leetcode 214 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5DACQK9kud0</video:player_loc><video:duration>2199</video:duration><video:publication_date>2024-09-20T11:05:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/sentence-similarity-iii-leetcode-1813</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/J9KwcuukMZE/hqdefault.jpg</video:thumbnail_loc><video:title>Sentence Similarity III | 2 Simple Approaches | Dry Run | Leetcode 1813 | codestorywithMIK</video:title><video:description>Sentence Similarity III | 2 Simple Approaches | Dry Run | Leetcode 1813 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/J9KwcuukMZE</video:player_loc><video:duration>1540</video:duration><video:publication_date>2024-10-06T05:41:35.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/separate-black-and-white-balls-leetcode-2938</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/E6AKLOdt9jc/hqdefault.jpg</video:thumbnail_loc><video:title>Separate Black and White Balls | 2 Simple Ways | Leetcode 2938 | codestorywithMIK</video:title><video:description>Separate Black and White Balls | 2 Simple Ways | Leetcode 2938 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/E6AKLOdt9jc</video:player_loc><video:duration>803</video:duration><video:publication_date>2024-10-15T01:48:48.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/maximum-swap-leetcode-670</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/6tsqLTvLAf8/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Swap | 2 Simple Approaches | Leetcode 670 | codestorywithMIK</video:title><video:description>Maximum Swap | 2 Simple Approaches | Leetcode 670 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/6tsqLTvLAf8</video:player_loc><video:duration>1574</video:duration><video:publication_date>2024-10-17T06:05:23.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/remove-sub-folders-from-the-filesystem-leetcode-1233</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/KNXbtg9rtLQ/hqdefault.jpg</video:thumbnail_loc><video:title>Remove Sub-Folders from the Filesystem | 2 Simple Approaches | Leetcode 1233 | codestorywithMIK</video:title><video:description>Remove Sub-Folders from the Filesystem | 2 Simple Approaches | Leetcode 1233 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/KNXbtg9rtLQ</video:player_loc><video:duration>1819</video:duration><video:publication_date>2024-10-25T05:01:38.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/string-compression-iii-leetcode-3163</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/cbo80sOKci4/hqdefault.jpg</video:thumbnail_loc><video:title>String Compression III | Simple Simulation | Leetcode 3163 | codestorywithMIK</video:title><video:description>String Compression III | Simple Simulation | Leetcode 3163 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/cbo80sOKci4</video:player_loc><video:duration>445</video:duration><video:publication_date>2024-11-04T02:50:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/minimum-number-of-changes-to-make-binary-string-beautiful-leetcode-2914</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/jvRiCOEflXA/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Number of Changes to Make Binary String Beautiful | 2 Ways | Leetcode 2914 |codestorywithMIK</video:title><video:description>Minimum Number of Changes to Make Binary String Beautiful | 2 Ways | Leetcode 2914 |codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/jvRiCOEflXA</video:player_loc><video:duration>1419</video:duration><video:publication_date>2024-11-05T02:29:57.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/adding-spaces-to-a-string-leetcode-2109</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/a_-iGNtoDD0/hqdefault.jpg</video:thumbnail_loc><video:title>Adding Spaces to a String | Straight Forward Easy | Leetcode 2109 | codestorywithMIK</video:title><video:description>Adding Spaces to a String | Straight Forward Easy | Leetcode 2109 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/a_-iGNtoDD0</video:player_loc><video:duration>427</video:duration><video:publication_date>2024-12-03T01:46:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/make-string-a-subsequence-using-cyclic-increments-leetcode-2825</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8-6Mqs-p2I8/hqdefault.jpg</video:thumbnail_loc><video:title>Make String a Subsequence Using Cyclic Increments | Similar Problem |Leetcode 2825 |codestorywithMIK</video:title><video:description>Make String a Subsequence Using Cyclic Increments | Similar Problem |Leetcode 2825 |codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8-6Mqs-p2I8</video:player_loc><video:duration>819</video:duration><video:publication_date>2024-12-04T03:57:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/move-pieces-to-obtain-a-string-leetcode-2337</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/OlfIyTpCzvM/hqdefault.jpg</video:thumbnail_loc><video:title>Move Pieces to Obtain a String | Brute Force | Wrong | Optimal | Leetcode 2337 | codestorywithMIK</video:title><video:description>Move Pieces to Obtain a String | Brute Force | Wrong | Optimal | Leetcode 2337 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/OlfIyTpCzvM</video:player_loc><video:duration>2330</video:duration><video:publication_date>2024-12-05T04:19:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/find-longest-special-substring-that-occurs-thrice-i-leetcode-2981</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/fDUPCtPqzss/hqdefault.jpg</video:thumbnail_loc><video:title>Find Longest Special Substring That Occurs Thrice I &amp; II | Leetcode 2981 &amp; 2982 | codestorywithMIK</video:title><video:description>Find Longest Special Substring That Occurs Thrice I &amp; II | Leetcode 2981 &amp; 2982 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/fDUPCtPqzss</video:player_loc><video:duration>3532</video:duration><video:publication_date>2024-12-10T06:19:58.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/construct-string-with-repeat-limit-leetcode-2182</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Jghze8B3E7M/hqdefault.jpg</video:thumbnail_loc><video:title>Construct String With Repeat Limit | 2 Simple Approaches | Leetcode 2182 | codestorywithMIK</video:title><video:description>Construct String With Repeat Limit | 2 Simple Approaches | Leetcode 2182 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Jghze8B3E7M</video:player_loc><video:duration>1909</video:duration><video:publication_date>2024-12-17T02:32:49.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/minimum-number-of-operations-to-move-all-balls-to-each-box-leetcode-1769</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/1j_ssSAjDcI/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Number of Operations to Move All Balls to Each Box | Leetcode 1769 | 3 Approaches | MIK</video:title><video:description>Minimum Number of Operations to Move All Balls to Each Box | Leetcode 1769 | 3 Approaches | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/1j_ssSAjDcI</video:player_loc><video:duration>2767</video:duration><video:publication_date>2025-01-06T04:08:52.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/word-subsets-leetcode-916</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/EjXPzWYbviw/hqdefault.jpg</video:thumbnail_loc><video:title>Word Subsets | Simple Thought Process | C++ | Java | Leetcode 916 | codestorywithMIK</video:title><video:description>Word Subsets | Simple Thought Process | C++ | Java | Leetcode 916 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/EjXPzWYbviw</video:player_loc><video:duration>1668</video:duration><video:publication_date>2025-01-10T04:29:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/construct-k-palindrome-strings-leetcode-1400</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Hh14hvVIHJc/hqdefault.jpg</video:thumbnail_loc><video:title>Construct K Palindrome Strings | Super Detailed Intuition | Leetcode 1400 | codestorywithMIK</video:title><video:description>Construct K Palindrome Strings | Super Detailed Intuition | Leetcode 1400 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Hh14hvVIHJc</video:player_loc><video:duration>2423</video:duration><video:publication_date>2025-01-11T04:25:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/minimum-length-of-string-after-operations-leetcode-3223</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/VZ9Qiy75rZU/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Length of String After Operations | 2 Approaches |Intuition |Leetcode 3223 |codestorywithMIK</video:title><video:description>Minimum Length of String After Operations | 2 Approaches |Intuition |Leetcode 3223 |codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/VZ9Qiy75rZU</video:player_loc><video:duration>1375</video:duration><video:publication_date>2025-01-13T03:59:35.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/construct-smallest-number-from-di-string-leetcode-2375</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/rCjwDls-HPk/hqdefault.jpg</video:thumbnail_loc><video:title>Construct Smallest Number From DI String | Easy Approaches | Leetcode 2375 | codestorywithMIK</video:title><video:description>Construct Smallest Number From DI String | Easy Approaches | Leetcode 2375 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/rCjwDls-HPk</video:player_loc><video:duration>2153</video:duration><video:publication_date>2025-02-18T04:03:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/count-the-number-of-powerful-integers-leetcode-2999</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/DNbvaC-EqyQ/hqdefault.jpg</video:thumbnail_loc><video:title>Count the Number of Powerful Integers | Detailed Thought Process | Leetcode 2999 | codestorywithMIK</video:title><video:description>Count the Number of Powerful Integers | Detailed Thought Process | Leetcode 2999 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/DNbvaC-EqyQ</video:player_loc><video:duration>2721</video:duration><video:publication_date>2025-04-10T08:43:55.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/find-the-lexicographically-largest-string-from-the-box-i-leetcode-3403</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/P74WiyWY3Pk/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Lexicographically Largest String From the Box I | Thought Process | Leetcode 3403 | MIK</video:title><video:description>Find the Lexicographically Largest String From the Box I | Thought Process | Leetcode 3403 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/P74WiyWY3Pk</video:player_loc><video:duration>1635</video:duration><video:publication_date>2025-06-04T06:10:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/using-a-robot-to-print-the-lexicographically-smallest-string-leetcode-2434</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/NUMNPFel73Q/hqdefault.jpg</video:thumbnail_loc><video:title>Using a Robot to Print the Lexicographically Smallest String | Thought Process | Leetcode 2434 | MIK</video:title><video:description>Using a Robot to Print the Lexicographically Smallest String | Thought Process | Leetcode 2434 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/NUMNPFel73Q</video:player_loc><video:duration>1567</video:duration><video:publication_date>2025-06-06T07:11:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/count-the-number-of-substrings-with-dominant-ones-leetcode-3234</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/gWRnztyET8s/hqdefault.jpg</video:thumbnail_loc><video:title>Count the Number of Substrings With Dominant Ones | Brute Force | Improved | Leetcode 3234 | MIK</video:title><video:description>Count the Number of Substrings With Dominant Ones | Brute Force | Improved | Leetcode 3234 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/gWRnztyET8s</video:player_loc><video:duration>2283</video:duration><video:publication_date>2025-11-15T07:50:13.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/number-of-substrings-with-only-1s-leetcode-1513</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/JvLxk7KFKUQ/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Substrings With Only 1s | 2 Ways | Dry Runs | Leetcode 1513 | codestorywithMIK</video:title><video:description>Number of Substrings With Only 1s | 2 Ways | Dry Runs | Leetcode 1513 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/JvLxk7KFKUQ</video:player_loc><video:duration>829</video:duration><video:publication_date>2025-11-16T01:39:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/count-collisions-on-a-road-leetcode-2211</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/10ydAzzgXc8/hqdefault.jpg</video:thumbnail_loc><video:title>Count Collisions on a Road | Asked in Online Assessment | Dry Run | Leetcode 2211 | codestorywithMIK</video:title><video:description>Count Collisions on a Road | Asked in Online Assessment | Dry Run | Leetcode 2211 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/10ydAzzgXc8</video:player_loc><video:duration>1060</video:duration><video:publication_date>2025-12-04T04:27:49.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/delete-columns-to-make-sorted-ii-leetcode-955</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/tkDcJ-F7foI/hqdefault.jpg</video:thumbnail_loc><video:title>Delete Columns to Make Sorted II | Minute Details Covered | Dry Run | Leetcode 955 | MIK</video:title><video:description>Delete Columns to Make Sorted II | Minute Details Covered | Dry Run | Leetcode 955 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/tkDcJ-F7foI</video:player_loc><video:duration>1850</video:duration><video:publication_date>2025-12-21T08:04:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/decode-the-slanted-ciphertext-leetcode-2075</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/hlQGUgvkYXQ/hqdefault.jpg</video:thumbnail_loc><video:title>Decode the Slanted Ciphertext | Detailed Intuition | 2 Approaches | Leetcode 2075 | codestorywithMIK</video:title><video:description>Decode the Slanted Ciphertext | Detailed Intuition | 2 Approaches | Leetcode 2075 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/hlQGUgvkYXQ</video:player_loc><video:duration>1450</video:duration><video:publication_date>2026-04-04T03:50:57.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/process-string-with-special-operations-i-leetcode-3612</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/SDE8xan15Nw/hqdefault.jpg</video:thumbnail_loc><video:title>Process String with Special Operations I | Simple Simulation | Leetcode 3612 | codestorywithMIK</video:title><video:description>Process String with Special Operations I | Simple Simulation | Leetcode 3612 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/SDE8xan15Nw</video:player_loc><video:duration>474</video:duration><video:publication_date>2026-06-16T07:15:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/process-string-with-special-operations-ii-leetcode-3614</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/tXuWBbyj2ds/hqdefault.jpg</video:thumbnail_loc><video:title>Process String with Special Operations II | Simplified | Dry Runs | Leetcode 3614 | codestorywithMIK</video:title><video:description>Process String with Special Operations II | Simplified | Dry Runs | Leetcode 3614 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/tXuWBbyj2ds</video:player_loc><video:duration>2893</video:duration><video:publication_date>2026-06-16T23:30:39.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/maximize-active-section-with-trade-i-leetcode-3499</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/JP-N2krnCTc/hqdefault.jpg</video:thumbnail_loc><video:title>Maximize Active Section with Trade I | Simplified Approach | Dry Runs | Leetcode 3499 | MIK</video:title><video:description>Maximize Active Section with Trade I | Simplified Approach | Dry Runs | Leetcode 3499 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/JP-N2krnCTc</video:player_loc><video:duration>1050</video:duration><video:publication_date>2026-07-21T07:51:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/longest-valid-parentheses-leetcode-32</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/uLP67Zh8bxk/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Valid Parentheses | Simplest Intuition | Leetcode 32 | codestorywithMIK</video:title><video:description>Longest Valid Parentheses | Simplest Intuition | Leetcode 32 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/uLP67Zh8bxk</video:player_loc><video:duration>1537</video:duration><video:publication_date>2026-10-03T04:35:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/minimum-operations-to-sort-a-string-leetcode-3863</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/erOqoWuiErg/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Operations to Sort a String | Brute Force | Optimal | Leetcode 3863 | codestorywithMIK</video:title><video:description>Minimum Operations to Sort a String | Brute Force | Optimal | Leetcode 3863 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/erOqoWuiErg</video:player_loc><video:duration>1716</video:duration><video:publication_date>2026-10-21T07:42:43.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/find-the-difference-leetcode-389</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/eWoaue1y-Cc/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Difference | 3 Approaches | Phone Interview | AMAZON | Leetcode - 389</video:title><video:description>Find the Difference | 3 Approaches | Phone Interview | AMAZON | Leetcode - 389. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/eWoaue1y-Cc</video:player_loc><video:duration>658</video:duration><video:publication_date>2023-09-25T04:05:51.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/find-words-that-can-be-formed-by-characters-leetcode-1160</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/0RpZxrkLCyg/hqdefault.jpg</video:thumbnail_loc><video:title>Find Words That Can Be Formed by Characters | META | Leetcode 1160</video:title><video:description>Find Words That Can Be Formed by Characters | META | Leetcode 1160. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/0RpZxrkLCyg</video:player_loc><video:duration>443</video:duration><video:publication_date>2023-12-02T04:17:25.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/largest-3-same-digit-number-in-string-leetcode-2264</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/euheCzFYWDs/hqdefault.jpg</video:thumbnail_loc><video:title>Largest 3-Same-Digit Number in String | Leetcode 2264</video:title><video:description>Largest 3-Same-Digit Number in String | Leetcode 2264. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/euheCzFYWDs</video:player_loc><video:duration>491</video:duration><video:publication_date>2023-12-04T03:07:35.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/largest-odd-number-in-string-leetcode-1903</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/vkxUVdGgnhU/hqdefault.jpg</video:thumbnail_loc><video:title>Largest Odd Number in String | Amazon | Leetcode 1903</video:title><video:description>Largest Odd Number in String | Amazon | Leetcode 1903. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/vkxUVdGgnhU</video:player_loc><video:duration>550</video:duration><video:publication_date>2023-12-07T03:04:38.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/valid-anagram-leetcode-242</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/1tmEKyRAMuY/hqdefault.jpg</video:thumbnail_loc><video:title>Valid Anagram | 2 Approaches | Leetcode-242 | UBER</video:title><video:description>Valid Anagram | 2 Approaches | Leetcode-242 | UBER. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/1tmEKyRAMuY</video:player_loc><video:duration>587</video:duration><video:publication_date>2023-12-16T01:55:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/maximum-score-after-splitting-a-string-leetcode-1422</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/H618dJqxpsM/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Score After Splitting a String | 3 Approaches | Leetcode 1422</video:title><video:description>Maximum Score After Splitting a String | 3 Approaches | Leetcode 1422. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/H618dJqxpsM</video:player_loc><video:duration>1382</video:duration><video:publication_date>2023-12-22T04:36:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/minimum-changes-to-make-alternating-binary-string-leetcode-1758</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YB4oUR2Skfk/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Changes To Make Alternating Binary String | 2 Approaches | MICROSOFT  | Leetcode 1758 | MIK</video:title><video:description>Minimum Changes To Make Alternating Binary String | 2 Approaches | MICROSOFT  | Leetcode 1758 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YB4oUR2Skfk</video:player_loc><video:duration>1514</video:duration><video:publication_date>2023-12-24T05:05:41.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/largest-substring-between-two-equal-characters-leetcode-1624</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/kQLhWLVlzYo/hqdefault.jpg</video:thumbnail_loc><video:title>Largest Substring Between Two Equal Characters | 3 Ways | C++ | JAVA | Leetcode 1624</video:title><video:description>Largest Substring Between Two Equal Characters | 3 Ways | C++ | JAVA | Leetcode 1624. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/kQLhWLVlzYo</video:player_loc><video:duration>832</video:duration><video:publication_date>2023-12-31T05:23:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/first-unique-character-in-a-string-leetcode-387</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/vqLiP9cdDLA/hqdefault.jpg</video:thumbnail_loc><video:title>First Unique Character in a String | Easy | Leetcode 387</video:title><video:description>First Unique Character in a String | Easy | Leetcode 387. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/vqLiP9cdDLA</video:player_loc><video:duration>285</video:duration><video:publication_date>2024-02-05T05:43:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/reverse-prefix-of-word-leetcode-2000</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/EH3EdJobbA8/hqdefault.jpg</video:thumbnail_loc><video:title>Reverse Prefix of Word | Detail on reverse Function | Leetcode 2000 | codestorywithMIK</video:title><video:description>Reverse Prefix of Word | Detail on reverse Function | Leetcode 2000 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/EH3EdJobbA8</video:player_loc><video:duration>468</video:duration><video:publication_date>2024-05-01T02:44:56.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/longest-palindrome-leetcode-409</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/DSEng0xILV4/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Palindrome | 3 Easy Approaches | Leetcode 409 | codestorywithMIK</video:title><video:description>Longest Palindrome | 3 Easy Approaches | Leetcode 409 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/DSEng0xILV4</video:player_loc><video:duration>1156</video:duration><video:publication_date>2024-06-04T06:50:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/minimum-string-length-after-removing-substrings-leetcode-2696</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/4XLzLdAE4Lc/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum String Length After Removing Substrings | 3 Approaches | Leetcode 2696 | codestorywithMIK</video:title><video:description>Minimum String Length After Removing Substrings | 3 Approaches | Leetcode 2696 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/4XLzLdAE4Lc</video:player_loc><video:duration>973</video:duration><video:publication_date>2024-10-07T02:15:56.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/delete-characters-to-make-fancy-string-leetcode-1957</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/LEc1tjoXV-A/hqdefault.jpg</video:thumbnail_loc><video:title>Delete Characters to Make Fancy String | Simple &amp; Easy | Leetcode 1957 | codestorywithMIK</video:title><video:description>Delete Characters to Make Fancy String | Simple &amp; Easy | Leetcode 1957 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/LEc1tjoXV-A</video:player_loc><video:duration>434</video:duration><video:publication_date>2024-11-01T02:00:34.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/rotate-string-leetcode-796</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/6fFWixNh4rg/hqdefault.jpg</video:thumbnail_loc><video:title>Rotate String | Something to learn | Leetcode 796 | codestorywithMIK</video:title><video:description>Rotate String | Something to learn | Leetcode 796 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/6fFWixNh4rg</video:player_loc><video:duration>1006</video:duration><video:publication_date>2024-11-03T02:22:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/string-matching-in-an-array-leetcode-1408</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/BsR6ZVwxrvE/hqdefault.jpg</video:thumbnail_loc><video:title>String Matching in an Array | Simple Approaches | Leetcode 1408 | codestorywithMIK</video:title><video:description>String Matching in an Array | Simple Approaches | Leetcode 1408 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/BsR6ZVwxrvE</video:player_loc><video:duration>939</video:duration><video:publication_date>2025-01-07T02:58:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/check-if-one-string-swap-can-make-strings-equal-leetcode-1790</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/s9ceDF-MHV0/hqdefault.jpg</video:thumbnail_loc><video:title>Check if One String Swap Can Make Strings Equal | 2 Approaches | Leetcode 1790 | codestorywithMIK</video:title><video:description>Check if One String Swap Can Make Strings Equal | 2 Approaches | Leetcode 1790 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/s9ceDF-MHV0</video:player_loc><video:duration>1023</video:duration><video:publication_date>2025-02-05T08:54:38.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/divide-a-string-into-groups-of-size-k-leetcode-2138</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/uCtxwHoPhkY/hqdefault.jpg</video:thumbnail_loc><video:title>Divide a String Into Groups of Size k | Easy | Leetcode 2138 | codestorywithMIK</video:title><video:description>Divide a String Into Groups of Size k | Easy | Leetcode 2138 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/uCtxwHoPhkY</video:player_loc><video:duration>744</video:duration><video:publication_date>2025-06-22T00:31:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/find-the-original-typed-string-i-leetcode-3330</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/XpRSv1EFmhU/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Original Typed String I | Straight Forward | Leetcode 3330 | codestorywithMIK</video:title><video:description>Find the Original Typed String I | Straight Forward | Leetcode 3330 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/XpRSv1EFmhU</video:player_loc><video:duration>628</video:duration><video:publication_date>2025-07-01T01:22:41.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/find-the-k-th-character-in-string-game-i-leetcode-3304</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YIbkt9kDXJY/hqdefault.jpg</video:thumbnail_loc><video:title>Find the K-th Character in String Game I | Two Approaches | Leetcode 3304 | codestorywithMIK</video:title><video:description>Find the K-th Character in String Game I | Two Approaches | Leetcode 3304 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YIbkt9kDXJY</video:player_loc><video:duration>1059</video:duration><video:publication_date>2025-07-03T13:33:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/valid-word-leetcode-3136</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/uxdIomeyUDs/hqdefault.jpg</video:thumbnail_loc><video:title>Valid Word | Easy | Leetcode 3136 | codestorywithMIK</video:title><video:description>Valid Word | Easy | Leetcode 3136 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/uxdIomeyUDs</video:player_loc><video:duration>540</video:duration><video:publication_date>2025-07-15T01:24:21.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/maximum-number-of-words-you-can-type-leetcode-1935</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/4UsWxLV_6Ho/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Number of Words You Can Type | Simple Approach | Leetcode 1935 | codestorywithMIK</video:title><video:description>Maximum Number of Words You Can Type | Simple Approach | Leetcode 1935 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/4UsWxLV_6Ho</video:player_loc><video:duration>518</video:duration><video:publication_date>2025-09-15T09:16:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/find-resultant-array-after-removing-anagrams-leetcode-2273</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/HK9CnjrpqlI/hqdefault.jpg</video:thumbnail_loc><video:title>Find Resultant Array After Removing Anagrams | Multiple Approach | Leetcode 2273 | codestorywithMIK</video:title><video:description>Find Resultant Array After Removing Anagrams | Multiple Approach | Leetcode 2273 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/HK9CnjrpqlI</video:player_loc><video:duration>1062</video:duration><video:publication_date>2025-10-13T02:32:43.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/check-if-digits-are-equal-in-string-after-operations-i-leetcode-3461</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/7Fhpx_pvAMo/hqdefault.jpg</video:thumbnail_loc><video:title>Check If Digits Are Equal in String After Operations I | Better Simulation | Leetcode 3461 | MIK</video:title><video:description>Check If Digits Are Equal in String After Operations I | Better Simulation | Leetcode 3461 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/7Fhpx_pvAMo</video:player_loc><video:duration>657</video:duration><video:publication_date>2025-10-23T03:43:25.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/count-binary-substrings-leetcode-696</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9N2TwXfTYVY/hqdefault.jpg</video:thumbnail_loc><video:title>Count Binary Substrings | Simple Intuition | Dry Run | Leetcode 696 | codestorywithMIK</video:title><video:description>Count Binary Substrings | Simple Intuition | Dry Run | Leetcode 696 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9N2TwXfTYVY</video:player_loc><video:duration>759</video:duration><video:publication_date>2026-02-19T01:41:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/check-if-binary-string-has-at-most-one-segment-of-ones-leetcode-1784</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/JG2kuNPIy1s/hqdefault.jpg</video:thumbnail_loc><video:title>Check if Binary String Has at Most One Segment of Ones | Two Approaches | Leetcode 1784 | MIK</video:title><video:description>Check if Binary String Has at Most One Segment of Ones | Two Approaches | Leetcode 1784 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/JG2kuNPIy1s</video:player_loc><video:duration>448</video:duration><video:publication_date>2026-03-06T00:56:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/robot-return-to-origin-leetcode-657</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/oJiw9087awQ/hqdefault.jpg</video:thumbnail_loc><video:title>Robot Return to Origin | Simple Explanation | Leetcode 657 | codestorywithMIK</video:title><video:description>Robot Return to Origin | Simple Explanation | Leetcode 657 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/oJiw9087awQ</video:player_loc><video:duration>223</video:duration><video:publication_date>2026-04-05T02:02:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/furthest-point-from-origin-leetcode-2833</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YXxZ8RjzFsk/hqdefault.jpg</video:thumbnail_loc><video:title>Furthest Point From Origin | Simple Explanation | Dry Run | Leetcode 2833 | codestorywithMIK</video:title><video:description>Furthest Point From Origin | Simple Explanation | Dry Run | Leetcode 2833 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YXxZ8RjzFsk</video:player_loc><video:duration>753</video:duration><video:publication_date>2026-04-24T02:24:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/remove-outermost-parentheses-leetcode-1021</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/w01wUVWZjfk/hqdefault.jpg</video:thumbnail_loc><video:title>Remove Outermost Parentheses | Simple Intuition | Dry Run | Leetcode 1021 | codestorywithMIK</video:title><video:description>Remove Outermost Parentheses | Simple Intuition | Dry Run | Leetcode 1021 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/w01wUVWZjfk</video:player_loc><video:duration>661</video:duration><video:publication_date>2026-10-08T04:38:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/find-first-palindromic-string-in-the-array-leetcode-2108</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/JPB_lLGSgnc/hqdefault.jpg</video:thumbnail_loc><video:title>Find First Palindromic String in the Array | Multiple Ways | Leetcode 2108</video:title><video:description>Find First Palindromic String in the Array | Multiple Ways | Leetcode 2108. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/JPB_lLGSgnc</video:player_loc><video:duration>903</video:duration><video:publication_date>2024-02-13T03:54:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/strings/length-of-last-word-leetcode-58</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/hi0I4UiPu-M/hqdefault.jpg</video:thumbnail_loc><video:title>Length of Last Word | 2 Ways | Leetcode 58 | Amazon | codestorywithMIK</video:title><video:description>Length of Last Word | 2 Ways | Leetcode 58 | Amazon | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/hi0I4UiPu-M</video:player_loc><video:duration>826</video:duration><video:publication_date>2024-04-01T02:11:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/find-players-with-zero-or-one-losses-leetcode-2225</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/bXptmD2qWYI/hqdefault.jpg</video:thumbnail_loc><video:title>Find Players With Zero or One Losses | Google | Leetcode 2225</video:title><video:description>Find Players With Zero or One Losses | Google | Leetcode 2225. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/bXptmD2qWYI</video:player_loc><video:duration>955</video:duration><video:publication_date>2022-11-28T11:46:49.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/unique-number-of-occurrences-leetcode-1207</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/b2_rw2NZkr8/hqdefault.jpg</video:thumbnail_loc><video:title>Unique Number of Occurrences | Two Approaches | Leetcode 1207</video:title><video:description>Unique Number of Occurrences | Two Approaches | Leetcode 1207. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/b2_rw2NZkr8</video:player_loc><video:duration>739</video:duration><video:publication_date>2022-11-30T07:39:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/word-pattern-leetcode-290</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/n0cn5tJwkaE/hqdefault.jpg</video:thumbnail_loc><video:title>Word Pattern -(Amazon, MakeMyTrip, Microsoft) : Explanation ➕ Live Coding</video:title><video:description>Word Pattern -(Amazon, MakeMyTrip, Microsoft) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/n0cn5tJwkaE</video:player_loc><video:duration>1714</video:duration><video:publication_date>2023-01-01T09:18:55.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/smallest-number-in-infinite-set-leetcode-2336</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/qiSjBraBzLM/hqdefault.jpg</video:thumbnail_loc><video:title>Smallest Number in Infinite Set | 3 Approaches | (MICROSOFT) | Leetcode 2336 | Live Code 🧑🏻‍💻</video:title><video:description>Smallest Number in Infinite Set | 3 Approaches | (MICROSOFT) | Leetcode 2336 | Live Code 🧑🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/qiSjBraBzLM</video:player_loc><video:duration>1868</video:duration><video:publication_date>2023-04-25T04:53:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/equal-row-and-column-pairs-leetcode-2352</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QWhQxJYppgo/hqdefault.jpg</video:thumbnail_loc><video:title>Equal Row and Column Pairs | Leetcode-2352 | Google, Microsoft | Explanation ➕ Live Coding</video:title><video:description>Equal Row and Column Pairs | Leetcode-2352 | Google, Microsoft | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QWhQxJYppgo</video:player_loc><video:duration>1199</video:duration><video:publication_date>2023-06-13T03:24:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/number-of-good-pairs-leetcode-1512</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/RSu9uQ-OGb0/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Good Pairs | 3 Approaches | META | Leetcode - 1512</video:title><video:description>Number of Good Pairs | 3 Approaches | META | Leetcode - 1512. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/RSu9uQ-OGb0</video:player_loc><video:duration>934</video:duration><video:publication_date>2023-10-03T08:57:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/binary-trees-with-factors-leetcode-823</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/D2GnunVezNA/hqdefault.jpg</video:thumbnail_loc><video:title>Binary Trees With Factors | Easy Intuition | Dry Run | GOOGLE | Leetcode - 823</video:title><video:description>Binary Trees With Factors | Easy Intuition | Dry Run | GOOGLE | Leetcode - 823. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/D2GnunVezNA</video:player_loc><video:duration>1952</video:duration><video:publication_date>2023-10-26T05:05:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/restore-the-array-from-adjacent-pairs-leetcode-1743</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/aRsdEts7i0k/hqdefault.jpg</video:thumbnail_loc><video:title>Restore the Array From Adjacent Pairs | Easy Explanation | Dry Run | Intuition | Leetcode-1743</video:title><video:description>Restore the Array From Adjacent Pairs | Easy Explanation | Dry Run | Intuition | Leetcode-1743. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/aRsdEts7i0k</video:player_loc><video:duration>1231</video:duration><video:publication_date>2023-11-10T05:10:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/count-nice-pairs-in-an-array-leetcode-1814</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/HgYxzKsToBo/hqdefault.jpg</video:thumbnail_loc><video:title>Count Nice Pairs in an Array | Simple Clean | Important suggestion | AMAZON | Leetcode-1814</video:title><video:description>Count Nice Pairs in an Array | Simple Clean | Important suggestion | AMAZON | Leetcode-1814. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/HgYxzKsToBo</video:player_loc><video:duration>1075</video:duration><video:publication_date>2023-11-21T03:38:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/array-pair-sum-divisibility-problem</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/FUPP7bHG9Dw/hqdefault.jpg</video:thumbnail_loc><video:title>Array Pair Sum Divisibility Problem | Brute Force | Optimal | GfG POTD</video:title><video:description>Array Pair Sum Divisibility Problem | Brute Force | Optimal | GfG POTD. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/FUPP7bHG9Dw</video:player_loc><video:duration>1661</video:duration><video:publication_date>2024-01-01T14:28:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/minimum-number-of-pushes-to-type-word-i-leetcode-3014</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/fX6sHghLCow/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Number of Pushes to Type Word I and II | Leetcode 3014 | Leetcode 3016 | Weekly Contest</video:title><video:description>Minimum Number of Pushes to Type Word I and II | Leetcode 3014 | Leetcode 3016 | Weekly Contest. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/fX6sHghLCow</video:player_loc><video:duration>1888</video:duration><video:publication_date>2024-01-21T08:23:21.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/hand-of-straights-leetcode-846</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/lpVhzcdiHMs/hqdefault.jpg</video:thumbnail_loc><video:title>Hand of Straights | Simple Thought Process | Google | Leetcode 846 | codestorywithMIK</video:title><video:description>Hand of Straights | Simple Thought Process | Google | Leetcode 846 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/lpVhzcdiHMs</video:player_loc><video:duration>1112</video:duration><video:publication_date>2024-06-06T05:27:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/replace-words-leetcode-648</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/EFskdMa-eBg/hqdefault.jpg</video:thumbnail_loc><video:title>Replace Words | Using HashSet | Uber | Leetcode 648 | codestorywithMIK</video:title><video:description>Replace Words | Using HashSet | Uber | Leetcode 648 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/EFskdMa-eBg</video:player_loc><video:duration>874</video:duration><video:publication_date>2024-06-07T04:39:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/check-if-array-pairs-are-divisible-by-k-leetcode-1497</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Lye_llDcSuI/hqdefault.jpg</video:thumbnail_loc><video:title>Check If Array Pairs Are Divisible by k | Simplest Explanation | Leetcode 1497 | codestorywithMIK</video:title><video:description>Check If Array Pairs Are Divisible by k | Simplest Explanation | Leetcode 1497 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Lye_llDcSuI</video:player_loc><video:duration>1440</video:duration><video:publication_date>2024-10-01T03:12:52.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/find-the-number-of-distinct-colors-among-the-balls-leetcode-3160</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/G8YjG1MEoYg/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Number of Distinct Colors Among the Balls | 2 Approaches | Leetcode 3160 | codestorywithMIK</video:title><video:description>Find the Number of Distinct Colors Among the Balls | 2 Approaches | Leetcode 3160 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/G8YjG1MEoYg</video:player_loc><video:duration>1467</video:duration><video:publication_date>2025-02-07T02:35:43.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/count-number-of-bad-pairs-leetcode-2364</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/quUIQ2pw5EU/hqdefault.jpg</video:thumbnail_loc><video:title>Count Number of Bad Pairs | 3 Ways | Intuition | Leetcode 2364 | codestorywithMIK</video:title><video:description>Count Number of Bad Pairs | 3 Ways | Intuition | Leetcode 2364 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/quUIQ2pw5EU</video:player_loc><video:duration>1725</video:duration><video:publication_date>2025-02-09T02:57:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/minimum-index-of-a-valid-split-leetcode-2780</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/MtZHKHOHmAs/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Index of a Valid Split | 2 Approaches | Leetcode 2780 | codestorywithMIK</video:title><video:description>Minimum Index of a Valid Split | 2 Approaches | Leetcode 2780 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/MtZHKHOHmAs</video:player_loc><video:duration>2037</video:duration><video:publication_date>2025-03-27T02:54:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/rabbits-in-forest-leetcode-781</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9Foc4T5cq00/hqdefault.jpg</video:thumbnail_loc><video:title>Rabbits in Forest | Detailed Explanation | Maths Behind It | Leetcode 781 | codestorywithMIK</video:title><video:description>Rabbits in Forest | Detailed Explanation | Maths Behind It | Leetcode 781 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9Foc4T5cq00</video:player_loc><video:duration>1711</video:duration><video:publication_date>2025-04-20T06:49:47.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/total-characters-in-string-after-transformations-i-leetcode-3335</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/reX7--RYbzw/hqdefault.jpg</video:thumbnail_loc><video:title>Total Characters in String After Transformations I | Made Easy | Leetcode 3335 | codestorywithMIK</video:title><video:description>Total Characters in String After Transformations I | Made Easy | Leetcode 3335 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/reX7--RYbzw</video:player_loc><video:duration>1410</video:duration><video:publication_date>2025-05-13T01:47:38.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/longest-palindrome-by-concatenating-two-letter-words-leetcode-2131</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/rRbpECaMY9s/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Palindrome by Concatenating Two Letter Words | Simple Way | Leetcode 2131 | codestorywithMIK</video:title><video:description>Longest Palindrome by Concatenating Two Letter Words | Simple Way | Leetcode 2131 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/rRbpECaMY9s</video:player_loc><video:duration>1055</video:duration><video:publication_date>2025-05-25T04:19:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/bitwise-ors-of-subarrays-leetcode-898</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Jlj4LUJhQJY/hqdefault.jpg</video:thumbnail_loc><video:title>Bitwise ORs of Subarrays | Detailed Explanation | Why Linear Time | Leetcode 898 | codestorywithMIK</video:title><video:description>Bitwise ORs of Subarrays | Detailed Explanation | Why Linear Time | Leetcode 898 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Jlj4LUJhQJY</video:player_loc><video:duration>1559</video:duration><video:publication_date>2025-07-31T05:16:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/vowel-spellchecker-leetcode-966</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/P0JdEsDlZX8/hqdefault.jpg</video:thumbnail_loc><video:title>Vowel Spellchecker | Simple Approach | Leetcode 966 | codestorywithMIK</video:title><video:description>Vowel Spellchecker | Simple Approach | Leetcode 966 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/P0JdEsDlZX8</video:player_loc><video:duration>1702</video:duration><video:publication_date>2025-09-14T05:03:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/next-greater-numerically-balanced-number-leetcode-2048</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/MLXm_hhOTmc/hqdefault.jpg</video:thumbnail_loc><video:title>Next Greater Numerically Balanced Number | 3 Approaches | Leetcode 2048 | codestorywithMIK</video:title><video:description>Next Greater Numerically Balanced Number | 3 Approaches | Leetcode 2048 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/MLXm_hhOTmc</video:player_loc><video:duration>2143</video:duration><video:publication_date>2025-10-24T06:38:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/count-special-triplets-leetcode-3583</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/WQ05CRcTraY/hqdefault.jpg</video:thumbnail_loc><video:title>Count Special Triplets | One Pass Approach | Two Pass Approach | Leetcode 3583 | codestorywithMIK</video:title><video:description>Count Special Triplets | One Pass Approach | Two Pass Approach | Leetcode 3583 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/WQ05CRcTraY</video:player_loc><video:duration>2023</video:duration><video:publication_date>2025-12-09T07:45:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/count-covered-buildings-leetcode-3531</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/trZj9w1WcdY/hqdefault.jpg</video:thumbnail_loc><video:title>Count Covered Buildings | Simplest Intuition | Dry Run | Leetcode 3531 | codestorywithMIK</video:title><video:description>Count Covered Buildings | Simplest Intuition | Dry Run | Leetcode 3531 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/trZj9w1WcdY</video:player_loc><video:duration>1803</video:duration><video:publication_date>2025-12-11T11:23:41.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/maximum-square-area-by-removing-fences-from-a-field-leetcode-2975</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/7H_tzns_G3M/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Square Area by Removing Fences From a Field | Intuition | Leetcode 2975 | codestorywithMIK</video:title><video:description>Maximum Square Area by Removing Fences From a Field | Intuition | Leetcode 2975 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/7H_tzns_G3M</video:player_loc><video:duration>1970</video:duration><video:publication_date>2026-01-16T10:16:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/minimum-pair-removal-to-sort-array-ii-leetcode-3510</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/h56PqNa5stI/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Pair Removal to Sort Array II | Detailed Explanation | Leetcode 3510 | codestorywithMIK</video:title><video:description>Minimum Pair Removal to Sort Array II | Detailed Explanation | Leetcode 3510 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/h56PqNa5stI</video:player_loc><video:duration>3751</video:duration><video:publication_date>2026-01-23T01:01:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/longest-balanced-substring-ii-leetcode-3714</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/eBhYqD4G4rw/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Balanced Substring II | Detailed | Dry Run | Thought Process | Leetcode 3714 | MIK</video:title><video:description>Longest Balanced Substring II | Detailed | Dry Run | Thought Process | Leetcode 3714 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/eBhYqD4G4rw</video:player_loc><video:duration>2568</video:duration><video:publication_date>2026-02-13T02:49:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/check-if-strings-can-be-made-equal-with-operations-i-leetcode-2839</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/IKY4B7Yu7JA/hqdefault.jpg</video:thumbnail_loc><video:title>Check if Strings Can be Made Equal With Operations I and II | 2 Approaches | Leetcode 2839 and 2840</video:title><video:description>Check if Strings Can be Made Equal With Operations I and II | 2 Approaches | Leetcode 2839 and 2840. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/IKY4B7Yu7JA</video:player_loc><video:duration>1844</video:duration><video:publication_date>2026-03-29T02:24:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/minimum-distance-between-three-equal-elements-i-leetcode-3741</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Qio1gMSEzG8/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Distance Between Three Equal Elements I and II | Dry Run | Leetcode 3741 and 3740 | MIK</video:title><video:description>Minimum Distance Between Three Equal Elements I and II | Dry Run | Leetcode 3741 and 3740 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Qio1gMSEzG8</video:player_loc><video:duration>1637</video:duration><video:publication_date>2026-04-10T14:35:51.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/closest-equal-element-queries-leetcode-3488</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/AWj_mZXrIW4/hqdefault.jpg</video:thumbnail_loc><video:title>Closest Equal Element Queries | Super Simplified | Dry Run | Leetcode 3488 | codestorywithMIK</video:title><video:description>Closest Equal Element Queries | Super Simplified | Dry Run | Leetcode 3488 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/AWj_mZXrIW4</video:player_loc><video:duration>1398</video:duration><video:publication_date>2026-04-16T06:24:57.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/minimum-absolute-distance-between-mirror-pairs-leetcode-3761</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/fnY6t8bXVNQ/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Absolute Distance Between Mirror Pairs | Simplest Explanation | Leetcode 3761 | MIK</video:title><video:description>Minimum Absolute Distance Between Mirror Pairs | Simplest Explanation | Leetcode 3761 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/fnY6t8bXVNQ</video:player_loc><video:duration>665</video:duration><video:publication_date>2026-04-17T10:47:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/count-the-number-of-special-characters-ii-leetcode-3121</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/0xsr7j5hdcY/hqdefault.jpg</video:thumbnail_loc><video:title>Count the Number of Special Characters II | Simplest Explanation | Dry Run | Leetcode 3121 | MIK</video:title><video:description>Count the Number of Special Characters II | Simplest Explanation | Dry Run | Leetcode 3121 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/0xsr7j5hdcY</video:player_loc><video:duration>867</video:duration><video:publication_date>2026-05-27T05:20:17.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/find-the-maximum-number-of-elements-in-subset-leetcode-3020</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/_71KQ4Voj3c/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Maximum Number of Elements in Subset | Detailed Explanation | Dry Run | Leetcode 3020 | MIK</video:title><video:description>Find the Maximum Number of Elements in Subset | Detailed Explanation | Dry Run | Leetcode 3020 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/_71KQ4Voj3c</video:player_loc><video:duration>2113</video:duration><video:publication_date>2026-06-27T17:35:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/evaluate-the-bracket-pairs-of-a-string-leetcode-1807</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/nZvRDBEH8OQ/hqdefault.jpg</video:thumbnail_loc><video:title>Evaluate the Bracket Pairs of a String | 3 Ways | Dry Runs | Leetcode 1807 | codestorywithMIK</video:title><video:description>Evaluate the Bracket Pairs of a String | 3 Ways | Dry Runs | Leetcode 1807 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/nZvRDBEH8OQ</video:player_loc><video:duration>1338</video:duration><video:publication_date>2026-09-26T03:00:39.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/destination-city-leetcode-1436</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/GyHzuQC7sd8/hqdefault.jpg</video:thumbnail_loc><video:title>Destination City | 2 Approaches | Leetcode-1436</video:title><video:description>Destination City | 2 Approaches | Leetcode-1436. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/GyHzuQC7sd8</video:player_loc><video:duration>538</video:duration><video:publication_date>2023-12-15T02:14:57.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/path-crossing-leetcode-1496</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/uJaWNFdm2IU/hqdefault.jpg</video:thumbnail_loc><video:title>Path Crossing | Leetcode 1496</video:title><video:description>Path Crossing | Leetcode 1496. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/uJaWNFdm2IU</video:player_loc><video:duration>537</video:duration><video:publication_date>2023-12-23T04:34:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/redistribute-characters-to-make-all-strings-equal-leetcode-1897</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/BWETRja2KHg/hqdefault.jpg</video:thumbnail_loc><video:title>Redistribute Characters to Make All Strings Equal | 3 Ways | C++ | JAVA | Leetcode 1897</video:title><video:description>Redistribute Characters to Make All Strings Equal | 3 Ways | C++ | JAVA | Leetcode 1897. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/BWETRja2KHg</video:player_loc><video:duration>1117</video:duration><video:publication_date>2023-12-30T03:27:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/isomorphic-strings-leetcode-205</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/2ISNCDJEgqQ/hqdefault.jpg</video:thumbnail_loc><video:title>Isomorphic Strings | Simple Thought Process | Leetcode 205| LinkedIn | codestorywithMIK</video:title><video:description>Isomorphic Strings | Simple Thought Process | Leetcode 205| LinkedIn | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/2ISNCDJEgqQ</video:player_loc><video:duration>1142</video:duration><video:publication_date>2024-04-02T02:21:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/count-the-number-of-consistent-strings-leetcode-1684</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QEIKg95HKzg/hqdefault.jpg</video:thumbnail_loc><video:title>Count the Number of Consistent Strings | Using Bit Manipulation | Leetcode 1684 | codestorywithMIK</video:title><video:description>Count the Number of Consistent Strings | Using Bit Manipulation | Leetcode 1684 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QEIKg95HKzg</video:player_loc><video:duration>874</video:duration><video:publication_date>2024-09-12T03:46:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/minimum-number-of-operations-to-make-elements-in-array-leetcode-3396</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/6UI_f7_epV0/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Number of Operations to Make Elements in Array Distinct | 2 Approaches | Leetcode 3396 | MIK</video:title><video:description>Minimum Number of Operations to Make Elements in Array Distinct | 2 Approaches | Leetcode 3396 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/6UI_f7_epV0</video:player_loc><video:duration>986</video:duration><video:publication_date>2025-04-08T13:20:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/minimum-operations-to-make-array-values-equal-to-k-leetcode-3375</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/dDl_tmwd6HQ/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Operations to Make Array Values Equal to K | Detailed Thought Process | Leetcode 3375 | MIK</video:title><video:description>Minimum Operations to Make Array Values Equal to K | Detailed Thought Process | Leetcode 3375 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/dDl_tmwd6HQ</video:player_loc><video:duration>1202</video:duration><video:publication_date>2025-04-09T11:34:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/number-of-equivalent-domino-pairs-leetcode-1128</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/LjO4YmVGSTA/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Equivalent Domino Pairs | Multiple Approaches | Dry Run | Leetcode 1128 | codestorywithMIK</video:title><video:description>Number of Equivalent Domino Pairs | Multiple Approaches | Dry Run | Leetcode 1128 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/LjO4YmVGSTA</video:player_loc><video:duration>1535</video:duration><video:publication_date>2025-05-04T02:20:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/find-lucky-integer-in-an-array-leetcode-1394</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/cGGJPSeHYaw/hqdefault.jpg</video:thumbnail_loc><video:title>Find Lucky Integer in an Array | 3 Approaches | In Place | Leetcode 1394 | codestorywithMIK</video:title><video:description>Find Lucky Integer in an Array | 3 Approaches | In Place | Leetcode 1394 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/cGGJPSeHYaw</video:player_loc><video:duration>2340</video:duration><video:publication_date>2025-07-05T05:07:23.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/maximum-unique-subarray-sum-after-deletion-leetcode-3487</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/0Q4cqxmR0qc/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Unique Subarray Sum After Deletion | Constant Space | Leetcode 3487 | codestorywithMIK</video:title><video:description>Maximum Unique Subarray Sum After Deletion | Constant Space | Leetcode 3487 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/0Q4cqxmR0qc</video:player_loc><video:duration>581</video:duration><video:publication_date>2025-07-25T05:53:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/coupon-code-validator-leetcode-3606</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/iH67r9BLpAw/hqdefault.jpg</video:thumbnail_loc><video:title>Coupon Code Validator | Simple Explanation | Leetcode 3606 | codestorywithMIK</video:title><video:description>Coupon Code Validator | Simple Explanation | Leetcode 3606 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/iH67r9BLpAw</video:player_loc><video:duration>1081</video:duration><video:publication_date>2025-12-13T12:09:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/n-repeated-element-in-size-2n-array-leetcode-961</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/mUsl5SCuSrY/hqdefault.jpg</video:thumbnail_loc><video:title>N-Repeated Element in Size 2N Array | Multiple Ways | Detailed For Beginners | Leetcode 961 | MIK</video:title><video:description>N-Repeated Element in Size 2N Array | Multiple Ways | Detailed For Beginners | Leetcode 961 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/mUsl5SCuSrY</video:player_loc><video:duration>1459</video:duration><video:publication_date>2026-01-02T05:38:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/hashing/smallest-missing-integer-greater-than-sequential-prefix-sum-leetcode-2996</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/K8vdd4IeD-o/hqdefault.jpg</video:thumbnail_loc><video:title>Smallest Missing Integer Greater Than Sequential Prefix Sum | Leetcode 2996 | codestorywithMIK</video:title><video:description>Smallest Missing Integer Greater Than Sequential Prefix Sum | Leetcode 2996 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/K8vdd4IeD-o</video:player_loc><video:duration>627</video:duration><video:publication_date>2026-08-11T02:54:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/prefix-sum-and-difference-array/introduction</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/-FxkJiCyg5g/hqdefault.jpg</video:thumbnail_loc><video:title>Introduction | What | Why | Line Sweep Technique | Concepts &amp; Questions - 1 | codestorywithMIK</video:title><video:description>Introduction | What | Why | Line Sweep Technique | Concepts &amp; Questions - 1 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/-FxkJiCyg5g</video:player_loc><video:duration>1600</video:duration><video:publication_date>2026-01-23T23:00:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/prefix-sum-and-difference-array/line-sweep-vs-difference-array</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9X0-4zSfd80/hqdefault.jpg</video:thumbnail_loc><video:title>Line Sweep Vs Difference Array | Line Sweep Technique | Concepts &amp; Questions - 2 | codestorywithMIK</video:title><video:description>Line Sweep Vs Difference Array | Line Sweep Technique | Concepts &amp; Questions - 2 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9X0-4zSfd80</video:player_loc><video:duration>565</video:duration><video:publication_date>2026-01-24T23:15:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/prefix-sum-and-difference-array/range-addition-leetcode-370</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ZHNVmtm08WY/hqdefault.jpg</video:thumbnail_loc><video:title>Introduction | What | How | Difference Array Technique: Concepts &amp; Questions - 1 | codestorywithMIK</video:title><video:description>Introduction | What | How | Difference Array Technique: Concepts &amp; Questions - 1 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ZHNVmtm08WY</video:player_loc><video:duration>1570</video:duration><video:publication_date>2025-01-05T04:56:53.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/prefix-sum-and-difference-array/difference-array-technique-with-jumps</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/sG5Lm8vi-2Q/hqdefault.jpg</video:thumbnail_loc><video:title>Difference Array Technique with Jumps | Detailed | Concepts &amp; Questions - 8 | codestorywithMIK</video:title><video:description>Difference Array Technique with Jumps | Detailed | Concepts &amp; Questions - 8 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/sG5Lm8vi-2Q</video:player_loc><video:duration>1674</video:duration><video:publication_date>2026-04-09T07:09:56.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/prefix-sum-and-difference-array/maximum-population-year-leetcode-1854</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/hpbYXxKk-Sg/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Population Year | Leetcode 1854 | 3 Approaches | Concepts &amp; Questions - 3 | codestorywithMIK</video:title><video:description>Maximum Population Year | Leetcode 1854 | 3 Approaches | Concepts &amp; Questions - 3 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/hpbYXxKk-Sg</video:player_loc><video:duration>1720</video:duration><video:publication_date>2026-01-25T22:45:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/prefix-sum-and-difference-array/meeting-rooms-ii-leetcode-253</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/zKSDKQ-ifmI/hqdefault.jpg</video:thumbnail_loc><video:title>Meeting Rooms II | Leetcode 253 | Line Sweep Technique Concepts &amp; Questions - 4 | codestorywithMIK</video:title><video:description>Meeting Rooms II | Leetcode 253 | Line Sweep Technique Concepts &amp; Questions - 4 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/zKSDKQ-ifmI</video:player_loc><video:duration>817</video:duration><video:publication_date>2026-01-26T23:15:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/prefix-sum-and-difference-array/my-calendar-ii-leetcode-731</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Pp4LIen7d0M/hqdefault.jpg</video:thumbnail_loc><video:title>My Calendar II | Leetcode 731 | Line Sweep Technique Concepts &amp; Questions - 5 | codestorywithMIK</video:title><video:description>My Calendar II | Leetcode 731 | Line Sweep Technique Concepts &amp; Questions - 5 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Pp4LIen7d0M</video:player_loc><video:duration>940</video:duration><video:publication_date>2026-01-27T23:00:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/prefix-sum-and-difference-array/car-pooling-leetcode-1094</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/E0g0QTwYK6g/hqdefault.jpg</video:thumbnail_loc><video:title>Car Pooling | Leetcode 1094 | Line Sweep Technique Concepts &amp; Questions - 6 | codestorywithMIK</video:title><video:description>Car Pooling | Leetcode 1094 | Line Sweep Technique Concepts &amp; Questions - 6 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/E0g0QTwYK6g</video:player_loc><video:duration>882</video:duration><video:publication_date>2026-01-30T23:15:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/prefix-sum-and-difference-array/my-calendar-iii-leetcode-732</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/zcMYtmwQNMg/hqdefault.jpg</video:thumbnail_loc><video:title>My Calendar III | Leetcode 732 | Line Sweep Technique Concepts &amp; Questions - 7 | codestorywithMIK</video:title><video:description>My Calendar III | Leetcode 732 | Line Sweep Technique Concepts &amp; Questions - 7 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/zcMYtmwQNMg</video:player_loc><video:duration>859</video:duration><video:publication_date>2026-01-31T18:45:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/prefix-sum-and-difference-array/describe-the-painting-leetcode-1943</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/e3Tr6ZnqKP0/hqdefault.jpg</video:thumbnail_loc><video:title>Describe the Painting | Leetcode 1943 | Line Sweep Technique Concepts &amp; Questions - 8 | MIK</video:title><video:description>Describe the Painting | Leetcode 1943 | Line Sweep Technique Concepts &amp; Questions - 8 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/e3Tr6ZnqKP0</video:player_loc><video:duration>2047</video:duration><video:publication_date>2026-02-02T23:33:55.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/prefix-sum-and-difference-array/maximum-sum-obtained-of-any-permutation-leetcode-1589</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YniLXdtGp5w/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Sum Obtained of Any Permutation | Leetcode 1589 | Line Sweep Concepts &amp; Questions - 9 | MIK</video:title><video:description>Maximum Sum Obtained of Any Permutation | Leetcode 1589 | Line Sweep Concepts &amp; Questions - 9 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YniLXdtGp5w</video:player_loc><video:duration>1586</video:duration><video:publication_date>2026-02-08T00:37:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/prefix-sum-and-difference-array/corporate-flight-bookings-leetcode-1109</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/17sXcR5zGSs/hqdefault.jpg</video:thumbnail_loc><video:title>Corporate Flight Bookings | Leetcode 1109 | Line Sweep Technique Concepts &amp; Questions - 10 | MIK</video:title><video:description>Corporate Flight Bookings | Leetcode 1109 | Line Sweep Technique Concepts &amp; Questions - 10 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/17sXcR5zGSs</video:player_loc><video:duration>969</video:duration><video:publication_date>2026-02-14T20:45:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/prefix-sum-and-difference-array/shifting-letters-ii-leetcode-2381</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/_lC3Wb5di2s/hqdefault.jpg</video:thumbnail_loc><video:title>Shifting Letters II | Leetcode 2381 | Difference Array Technique: Concepts &amp; Questions - 2 | MIK</video:title><video:description>Shifting Letters II | Leetcode 2381 | Difference Array Technique: Concepts &amp; Questions - 2 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/_lC3Wb5di2s</video:player_loc><video:duration>2184</video:duration><video:publication_date>2025-01-05T07:32:51.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/prefix-sum-and-difference-array/zero-array-transformation-ii-leetcode-3356</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8xHewtmPULs/hqdefault.jpg</video:thumbnail_loc><video:title>Zero Array Transformation II | Brute Force | Better | Leetcode 3356 | codestorywithMIK</video:title><video:description>Zero Array Transformation II | Brute Force | Better | Leetcode 3356 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8xHewtmPULs</video:player_loc><video:duration>2543</video:duration><video:publication_date>2025-03-13T05:04:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/prefix-sum-and-difference-array/zero-array-transformation-i-leetcode-3356</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/JbF-Bsm4yak/hqdefault.jpg</video:thumbnail_loc><video:title>Zero Array Transformation I | Brute Force | Optimal | Leetcode 3356 | codestorywithMIK</video:title><video:description>Zero Array Transformation I | Brute Force | Optimal | Leetcode 3356 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/JbF-Bsm4yak</video:player_loc><video:duration>1114</video:duration><video:publication_date>2025-05-20T01:44:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/prefix-sum-and-difference-array/maximum-frequency-of-an-element-after-performing-operations-leetcode-3346</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/BaEebscdBJM/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Frequency of an Element After Performing Operations I | Difference Array | Leetcode 3346</video:title><video:description>Maximum Frequency of an Element After Performing Operations I | Difference Array | Leetcode 3346. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/BaEebscdBJM</video:player_loc><video:duration>1974</video:duration><video:publication_date>2025-10-21T23:00:13.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/prefix-sum-and-difference-array/maximum-frequency-of-an-element-after-performing-operations-leetcode-3347</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/hSyXvam4Us4/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Frequency of an Element After Performing Operations II | Difference Array | Leetcode 3347</video:title><video:description>Maximum Frequency of an Element After Performing Operations II | Difference Array | Leetcode 3347. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/hSyXvam4Us4</video:player_loc><video:duration>1831</video:duration><video:publication_date>2025-10-22T00:00:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/prefix-sum-and-difference-array/increment-submatrices-by-one-leetcode-2536</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/GluIvp5NaGw/hqdefault.jpg</video:thumbnail_loc><video:title>Increment Submatrices by One | Difference Array Technique in 2-D Array | Leetcode 2536 | MIK</video:title><video:description>Increment Submatrices by One | Difference Array Technique in 2-D Array | Leetcode 2536 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/GluIvp5NaGw</video:player_loc><video:duration>1044</video:duration><video:publication_date>2025-11-14T05:51:53.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/prefix-sum-and-difference-array/xor-after-range-multiplication-queries-ii-leetcode-3655</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/O3rF3W23PNg/hqdefault.jpg</video:thumbnail_loc><video:title>XOR After Range Multiplication Queries II | Leetcode 3655 | Difference Array &amp; Questions - 9 | MIK</video:title><video:description>XOR After Range Multiplication Queries II | Leetcode 3655 | Difference Array &amp; Questions - 9 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/O3rF3W23PNg</video:player_loc><video:duration>1840</video:duration><video:publication_date>2026-04-09T09:26:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/prefix-sum-and-difference-array/minimum-moves-to-make-array-complementary-leetcode-1674</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/OzBKFDXNCkY/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Moves to Make Array Complementary | Beginner Friendly | Super Detailed | Leetcode 1674 | MIK</video:title><video:description>Minimum Moves to Make Array Complementary | Beginner Friendly | Super Detailed | Leetcode 1674 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/OzBKFDXNCkY</video:player_loc><video:duration>3312</video:duration><video:publication_date>2026-05-13T16:47:48.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/two-pointers/reverse-vowels-of-a-string-leetcode-345</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/pqzvpK8zTHU/hqdefault.jpg</video:thumbnail_loc><video:title>Reverse Vowels of a String (Google, Zoho, Flipkart) : Explanation ➕ Live Coding 🧑🏻‍💻👩🏻‍💻</video:title><video:description>Reverse Vowels of a String (Google, Zoho, Flipkart) : Explanation ➕ Live Coding 🧑🏻‍💻👩🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/pqzvpK8zTHU</video:player_loc><video:duration>563</video:duration><video:publication_date>2022-11-04T02:54:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/two-pointers/remove-duplicates-from-sorted-array-leetcode-26</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/06ALbFrgIoQ/hqdefault.jpg</video:thumbnail_loc><video:title>Remove Duplicates from Sorted Array (Google, Amazon, Microsoft…) : Explanation ➕ Live Coding</video:title><video:description>Remove Duplicates from Sorted Array (Google, Amazon, Microsoft…) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/06ALbFrgIoQ</video:player_loc><video:duration>550</video:duration><video:publication_date>2022-11-11T03:47:35.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/two-pointers/reverse-words-in-a-string-leetcode-151</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/mdej8UiRCkI/hqdefault.jpg</video:thumbnail_loc><video:title>Reverse Words in a String (Amazon, Microsoft, MentorGraphics, MakeMyTrip) : Explanation➕Live Coding</video:title><video:description>Reverse Words in a String (Amazon, Microsoft, MentorGraphics, MakeMyTrip) : Explanation➕Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/mdej8UiRCkI</video:player_loc><video:duration>1373</video:duration><video:publication_date>2022-11-13T05:52:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/two-pointers/number-of-subsequences-that-satisfy-the-given-sum-condition-leetcode-1498</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/eGqs55VTP3I/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Subsequences That Satisfy the Given Sum Condition | AMAZON | Leetcode - 1498 | Live Coding</video:title><video:description>Number of Subsequences That Satisfy the Given Sum Condition | AMAZON | Leetcode - 1498 | Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/eGqs55VTP3I</video:player_loc><video:duration>2094</video:duration><video:publication_date>2023-05-06T13:43:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/two-pointers/minimize-maximum-pair-sum-in-array-leetcode-1877</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/1L9C3a38fHU/hqdefault.jpg</video:thumbnail_loc><video:title>Minimize Maximum Pair Sum in Array | Intuition | Similar Problems | Leetcode 1877 | codestorywithMIK</video:title><video:description>Minimize Maximum Pair Sum in Array | Intuition | Similar Problems | Leetcode 1877 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/1L9C3a38fHU</video:player_loc><video:duration>688</video:duration><video:publication_date>2023-11-17T02:26:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/two-pointers/count-the-number-of-good-partitions-leetcode-2963</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/fyyjpElDeuY/hqdefault.jpg</video:thumbnail_loc><video:title>Count the Number of Good Partitions | Intuition | Leetcode-2963 | Weekly Contest 375</video:title><video:description>Count the Number of Good Partitions | Intuition | Leetcode-2963 | Weekly Contest 375. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/fyyjpElDeuY</video:player_loc><video:duration>1641</video:duration><video:publication_date>2023-12-10T15:13:43.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/two-pointers/minimum-length-of-string-after-deleting-similar-ends-leetcode-1750</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/skEofEGj46Y/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Length of String After Deleting Similar Ends | Simple Two Pointers | Leetcode 1750</video:title><video:description>Minimum Length of String After Deleting Similar Ends | Simple Two Pointers | Leetcode 1750. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/skEofEGj46Y</video:player_loc><video:duration>969</video:duration><video:publication_date>2024-03-05T05:26:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/two-pointers/maximum-width-ramp-leetcode-962</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/mcJBhWXel-Y/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Width Ramp | Brute Force | Better | Optimal | Leetcode 962 | codestorywithMIK</video:title><video:description>Maximum Width Ramp | Brute Force | Better | Optimal | Leetcode 962 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/mcJBhWXel-Y</video:player_loc><video:duration>1553</video:duration><video:publication_date>2024-10-10T12:30:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/two-pointers/partition-labels-leetcode-763</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/c11UizbJYZU/hqdefault.jpg</video:thumbnail_loc><video:title>Partition Labels | 2 Clean Approaches | Leetcode 763 | codestorywithMIK</video:title><video:description>Partition Labels | 2 Clean Approaches | Leetcode 763 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/c11UizbJYZU</video:player_loc><video:duration>1630</video:duration><video:publication_date>2025-03-30T02:40:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/two-pointers/push-dominoes-leetcode-838</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/HrUZKTzStII/hqdefault.jpg</video:thumbnail_loc><video:title>Push Dominoes | Simplest Intuition | Complete Dry Run | Leetcode 838 | codestorywithMIK</video:title><video:description>Push Dominoes | Simplest Intuition | Complete Dry Run | Leetcode 838 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/HrUZKTzStII</video:player_loc><video:duration>2406</video:duration><video:publication_date>2025-05-02T07:10:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/two-pointers/find-the-lexicographically-largest-string-from-the-box-i-leetcode-3403</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/4w-_rtiau_Q/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Lexicographically Largest String From the Box I | Another Approach | Leetcode 3403 | MIK</video:title><video:description>Find the Lexicographically Largest String From the Box I | Another Approach | Leetcode 3403 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/4w-_rtiau_Q</video:player_loc><video:duration>1332</video:duration><video:publication_date>2025-06-04T08:53:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/two-pointers/minimum-removals-to-balance-array-leetcode-3634</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/d4qAUbuEqvw/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Removals to Balance Array | Simple Clean Intuition | Leetcode 3634 | codestorywithMIK</video:title><video:description>Minimum Removals to Balance Array | Simple Clean Intuition | Leetcode 3634 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/d4qAUbuEqvw</video:player_loc><video:duration>1411</video:duration><video:publication_date>2026-02-06T02:13:41.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/two-pointers/longest-balanced-substring-i-leetcode-3713</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/tEUJZkSgxuA/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Balanced Substring I | Easy Explanation | Leetcode 3713 | codestorywithMIK</video:title><video:description>Longest Balanced Substring I | Easy Explanation | Leetcode 3713 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/tEUJZkSgxuA</video:player_loc><video:duration>818</video:duration><video:publication_date>2026-02-07T01:08:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/two-pointers/longest-balanced-subarray-i-leetcode-3719</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/fZBdZ5TDKOw/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Balanced Subarray I | Simple Explanation | Leetcode 3719 | codestorywithMIK</video:title><video:description>Longest Balanced Subarray I | Simple Explanation | Leetcode 3719 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/fZBdZ5TDKOw</video:player_loc><video:duration>751</video:duration><video:publication_date>2026-02-10T02:01:17.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/two-pointers/maximum-distance-between-a-pair-of-values-leetcode-1855</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/-wI7ee4D8KU/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Distance Between a Pair of Values | Intuitive Explanation | Dry Run | Leetcode 1855 | MIK</video:title><video:description>Maximum Distance Between a Pair of Values | Intuitive Explanation | Dry Run | Leetcode 1855 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/-wI7ee4D8KU</video:player_loc><video:duration>826</video:duration><video:publication_date>2026-04-19T03:15:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/count-occurrences-of-anagrams</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/mrUBUWb23hk/hqdefault.jpg</video:thumbnail_loc><video:title>Count Occurrences of Anagrams | Made Super Easy | Amazon | Microsoft | Flipkart | codestorywithMIK</video:title><video:description>Count Occurrences of Anagrams | Made Super Easy | Amazon | Microsoft | Flipkart | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/mrUBUWb23hk</video:player_loc><video:duration>1649</video:duration><video:publication_date>2022-08-12T13:30:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/find-all-anagrams-in-a-string-leetcode-438</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/XxeOHMwBQZU/hqdefault.jpg</video:thumbnail_loc><video:title>Find All Anagrams in a String-(Amazon, Microsoft, Flipkart):Explanation ➕ Live Coding 🧑🏻‍💻👩🏻‍💻</video:title><video:description>Find All Anagrams in a String-(Amazon, Microsoft, Flipkart):Explanation ➕ Live Coding 🧑🏻‍💻👩🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/XxeOHMwBQZU</video:player_loc><video:duration>384</video:duration><video:publication_date>2022-08-18T02:30:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/minimum-size-subarray-sum-leetcode-209</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/D2MbogiFXWU/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Size Subarray Sum | Google | Amazon | Easy Explanation | codestorywithMIK</video:title><video:description>Minimum Size Subarray Sum | Google | Amazon | Easy Explanation | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/D2MbogiFXWU</video:player_loc><video:duration>1120</video:duration><video:publication_date>2022-09-10T13:50:25.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/first-negative-integer-in-every-window-of-size-k-amazon-mentorgraphics</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/-uc7OCrjp8g/hqdefault.jpg</video:thumbnail_loc><video:title>First negative integer in every window of size k-(Amazon,MentorGraphics):Explanation➕ Live Coding</video:title><video:description>First negative integer in every window of size k-(Amazon,MentorGraphics):Explanation➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/-uc7OCrjp8g</video:player_loc><video:duration>1642</video:duration><video:publication_date>2022-10-15T01:30:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/minimum-window-substring-leetcode-76</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/3Bp3OVD1EGc/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Window Substring | Google | Leetcode 76</video:title><video:description>Minimum Window Substring | Google | Leetcode 76. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/3Bp3OVD1EGc</video:player_loc><video:duration>2286</video:duration><video:publication_date>2022-10-22T04:20:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/contains-duplicate-ii-leetcode-219</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/AyiGBwFlMb8/hqdefault.jpg</video:thumbnail_loc><video:title>Contains Duplicate II (Sliding Window) -(Airbnb, Palantir Technologies): Explanation ➕ Live Coding</video:title><video:description>Contains Duplicate II (Sliding Window) -(Airbnb, Palantir Technologies): Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/AyiGBwFlMb8</video:player_loc><video:duration>977</video:duration><video:publication_date>2022-10-22T17:23:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/count-subarrays-with-fixed-bounds-leetcode-2444</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/z6LwIkEn9qc/hqdefault.jpg</video:thumbnail_loc><video:title>Count Subarrays With Fixed Bounds  | Made Simple | Microsoft | Leetcode 2444 | codestorywithMIK</video:title><video:description>Count Subarrays With Fixed Bounds  | Made Simple | Microsoft | Leetcode 2444 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/z6LwIkEn9qc</video:player_loc><video:duration>1697</video:duration><video:publication_date>2023-03-04T11:40:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/maximum-number-of-vowels-in-a-substring-of-given-length-leetcode-1456</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/CAVnGkDzqAs/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Number of Vowels in a Substring of Given Length | MICROSOFT | Leetcode - 1456 | Live Coding</video:title><video:description>Maximum Number of Vowels in a Substring of Given Length | MICROSOFT | Leetcode - 1456 | Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/CAVnGkDzqAs</video:player_loc><video:duration>781</video:duration><video:publication_date>2023-05-05T10:12:47.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/k-radius-subarray-averages-leetcode-2090</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/M_YXCATc4ro/hqdefault.jpg</video:thumbnail_loc><video:title>K Radius Subarray Averages | Sliding Window | Leetcode-2090 | AMAZON | Explanation ➕ Live Coding</video:title><video:description>K Radius Subarray Averages | Sliding Window | Leetcode-2090 | AMAZON | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/M_YXCATc4ro</video:player_loc><video:duration>1101</video:duration><video:publication_date>2023-06-20T14:01:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/longest-subarray-of-1s-after-deleting-one-element-leetcode-1493</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/SQ8tY9nxeZU/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Subarray of 1&apos;s After Deleting One Element | Multiple Approaches | GOOGLE | Leetcode-1493</video:title><video:description>Longest Subarray of 1&apos;s After Deleting One Element | Multiple Approaches | GOOGLE | Leetcode-1493. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/SQ8tY9nxeZU</video:player_loc><video:duration>2010</video:duration><video:publication_date>2023-07-05T04:09:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/max-consecutive-ones-iii-leetcode-2024</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/vY06L8hZVGI/hqdefault.jpg</video:thumbnail_loc><video:title>Maximize the Confusion of an Exam | 3 Approaches | MICROSOFT | Leetcode-2024 | Explanation</video:title><video:description>Maximize the Confusion of an Exam | 3 Approaches | MICROSOFT | Leetcode-2024 | Explanation. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/vY06L8hZVGI</video:player_loc><video:duration>2476</video:duration><video:publication_date>2023-07-07T09:02:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/sliding-window-maximum-leetcode-239</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/29OnjVQ-fk4/hqdefault.jpg</video:thumbnail_loc><video:title>Sliding Window Maximum | Monotonic Deque | INTUITIVE | GOOGLE | Leetcode-239 | Dry Run</video:title><video:description>Sliding Window Maximum | Monotonic Deque | INTUITIVE | GOOGLE | Leetcode-239 | Dry Run. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/29OnjVQ-fk4</video:player_loc><video:duration>1914</video:duration><video:publication_date>2023-08-16T08:33:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/frequency-of-the-most-frequent-element-leetcode-1838</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/iOqH_JnXIOQ/hqdefault.jpg</video:thumbnail_loc><video:title>Frequency of the Most Frequent Element | Binary Search | Sliding Window | META | Leetcode-1838</video:title><video:description>Frequency of the Most Frequent Element | Binary Search | Sliding Window | META | Leetcode-1838. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/iOqH_JnXIOQ</video:player_loc><video:duration>3445</video:duration><video:publication_date>2023-11-18T07:23:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/count-complete-substrings-leetcode-2953</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ygPMLjxaT2Y/hqdefault.jpg</video:thumbnail_loc><video:title>Count Complete Substrings | Sliding Window | Weekly Contest 374 | Leetcode-2953</video:title><video:description>Count Complete Substrings | Sliding Window | Weekly Contest 374 | Leetcode-2953. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ygPMLjxaT2Y</video:player_loc><video:duration>3478</video:duration><video:publication_date>2023-12-09T03:02:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/binary-subarrays-with-sum-leetcode-930</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5Quv9nnZs34/hqdefault.jpg</video:thumbnail_loc><video:title>Binary Subarrays With Sum | 2 Approaches | Detailed Explanation | Leetcode 930 | codestorywithMIK</video:title><video:description>Binary Subarrays With Sum | 2 Approaches | Detailed Explanation | Leetcode 930 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5Quv9nnZs34</video:player_loc><video:duration>2208</video:duration><video:publication_date>2024-03-14T11:28:53.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/subarray-product-less-than-k-leetcode-713</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9fmKB1F1pEE/hqdefault.jpg</video:thumbnail_loc><video:title>Subarray Product Less Than K | Khandani Sliding Window template | Leetcode 713 | codestorywithMIK</video:title><video:description>Subarray Product Less Than K | Khandani Sliding Window template | Leetcode 713 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9fmKB1F1pEE</video:player_loc><video:duration>1015</video:duration><video:publication_date>2024-03-27T02:12:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/length-of-longest-subarray-with-at-most-k-frequency-leetcode-2958</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/txSMzRMREKA/hqdefault.jpg</video:thumbnail_loc><video:title>Length of Longest Subarray With at Most K Frequency | 2 Ways | Leetcode 2958 | codestorywithMIK</video:title><video:description>Length of Longest Subarray With at Most K Frequency | 2 Ways | Leetcode 2958 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/txSMzRMREKA</video:player_loc><video:duration>1312</video:duration><video:publication_date>2024-03-28T02:42:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/count-subarrays-where-max-element-appears-at-least-k-times-leetcode-2962</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/06VaWkj8e-0/hqdefault.jpg</video:thumbnail_loc><video:title>Count Subarrays Where Max Element Appears at Least K Times | 2 Approaches | Leetcode 2962</video:title><video:description>Count Subarrays Where Max Element Appears at Least K Times | 2 Approaches | Leetcode 2962. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/06VaWkj8e-0</video:player_loc><video:duration>2166</video:duration><video:publication_date>2024-03-29T04:31:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/subarrays-with-k-different-integers-leetcode-992</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/uJJSGxfzix8/hqdefault.jpg</video:thumbnail_loc><video:title>Subarrays with K Different Integers | Approach-1 | With Reasons | Leetcode 992 | codestorywithMIK</video:title><video:description>Subarrays with K Different Integers | Approach-1 | With Reasons | Leetcode 992 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/uJJSGxfzix8</video:player_loc><video:duration>2108</video:duration><video:publication_date>2024-03-30T04:05:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/subarrays-with-k-different-integers-leetcode-992-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/0Kmbzm5nKqw/hqdefault.jpg</video:thumbnail_loc><video:title>Subarrays with K Different Integers | Approach-2 | One Pass | Leetcode 992 | codestorywithMIK</video:title><video:description>Subarrays with K Different Integers | Approach-2 | One Pass | Leetcode 992 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/0Kmbzm5nKqw</video:player_loc><video:duration>1758</video:duration><video:publication_date>2024-03-30T10:39:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/get-equal-substrings-within-budget-leetcode-1208</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/MF2MgJQuFhA/hqdefault.jpg</video:thumbnail_loc><video:title>Get Equal Substrings Within Budget | Classic Sliding Window | Leetcode 1208 | codestorywithMIK</video:title><video:description>Get Equal Substrings Within Budget | Classic Sliding Window | Leetcode 1208 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/MF2MgJQuFhA</video:player_loc><video:duration>1210</video:duration><video:publication_date>2024-05-28T01:48:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/find-subarray-with-bitwise-and-closest-to-k-leetcode-3171</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/BWBKtU8Euno/hqdefault.jpg</video:thumbnail_loc><video:title>Find Subarray With Bitwise AND Closest to K | Sliding Window | Leetcode 3171 | codestorywithMIK</video:title><video:description>Find Subarray With Bitwise AND Closest to K | Sliding Window | Leetcode 3171 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/BWBKtU8Euno</video:player_loc><video:duration>3624</video:duration><video:publication_date>2024-06-04T17:12:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/grumpy-bookstore-owner-leetcode-1052</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/kCxCE0_66vM/hqdefault.jpg</video:thumbnail_loc><video:title>Grumpy Bookstore Owner | Simplest Thought Process | Leetcode 1052 | codestorywithMIK</video:title><video:description>Grumpy Bookstore Owner | Simplest Thought Process | Leetcode 1052 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/kCxCE0_66vM</video:player_loc><video:duration>1764</video:duration><video:publication_date>2024-06-21T02:56:18.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/longest-continuous-subarray-with-absolute-diff-less-than-or-leetcode-1438</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/xZDbcGB2PQs/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Leetcode 1438 |Detailed</video:title><video:description>Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Leetcode 1438 |Detailed. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/xZDbcGB2PQs</video:player_loc><video:duration>2942</video:duration><video:publication_date>2024-06-23T04:15:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/minimum-swaps-to-group-all-1s-together-ii-leetcode-2134</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/t82KJaI1kNQ/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Swaps to Group All 1&apos;s Together II | 2 Ways | Dry Runs | Leetcode 2134 | codestorywithMIK</video:title><video:description>Minimum Swaps to Group All 1&apos;s Together II | 2 Ways | Dry Runs | Leetcode 2134 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/t82KJaI1kNQ</video:player_loc><video:duration>1558</video:duration><video:publication_date>2024-08-02T04:12:47.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/count-substrings-that-satisfy-k-constraint-i-leetcode-3258</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/2d1ALG8wwDc/hqdefault.jpg</video:thumbnail_loc><video:title>Count Substrings That Satisfy K-Constraint I &amp; II | Detailed Explanation | Leetcode 3258 &amp; 3261</video:title><video:description>Count Substrings That Satisfy K-Constraint I &amp; II | Detailed Explanation | Leetcode 3258 &amp; 3261. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/2d1ALG8wwDc</video:player_loc><video:duration>4096</video:duration><video:publication_date>2024-08-18T17:08:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/permutation-in-string-leetcode-567</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/iTwwvsyUsi4/hqdefault.jpg</video:thumbnail_loc><video:title>Permutation in String | Multiple Approaches | Clean Dry Run | Leetcode 567 | codestorywithMIK</video:title><video:description>Permutation in String | Multiple Approaches | Clean Dry Run | Leetcode 567 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/iTwwvsyUsi4</video:player_loc><video:duration>1339</video:duration><video:publication_date>2024-10-05T05:30:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/find-the-power-of-k-size-subarrays-i-leetcode-3254</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/P1_yXMhqC50/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Power of K-Size Subarrays I | Simple Explanation | Dry Run| Leetcode 3254 |codestorywithMIK</video:title><video:description>Find the Power of K-Size Subarrays I | Simple Explanation | Dry Run| Leetcode 3254 |codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/P1_yXMhqC50</video:player_loc><video:duration>1223</video:duration><video:publication_date>2024-11-16T05:28:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/find-the-power-of-k-size-subarrays-i-leetcode-3254-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/7xkCA80h5a4/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Power of K-Size Subarrays I | Why Monotonic Deque | Dry Run|Leetcode 3254 |codestorywithMIK</video:title><video:description>Find the Power of K-Size Subarrays I | Why Monotonic Deque | Dry Run|Leetcode 3254 |codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/7xkCA80h5a4</video:player_loc><video:duration>1003</video:duration><video:publication_date>2024-11-16T11:23:35.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/shortest-subarray-with-sum-at-least-k-leetcode-862</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Z4tH40wH6JA/hqdefault.jpg</video:thumbnail_loc><video:title>Shortest Subarray with Sum at Least K | Already Studied Concept | Leetcode 862 | codestorywithMIK</video:title><video:description>Shortest Subarray with Sum at Least K | Already Studied Concept | Leetcode 862 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Z4tH40wH6JA</video:player_loc><video:duration>2137</video:duration><video:publication_date>2024-11-17T08:26:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/maximum-sum-of-distinct-subarrays-with-length-k-leetcode-2461</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/X1LgOR-_pJE/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Sum of Distinct Subarrays With Length K | Khandani Template |Leetcode 2461 |codestorywithMIK</video:title><video:description>Maximum Sum of Distinct Subarrays With Length K | Khandani Template |Leetcode 2461 |codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/X1LgOR-_pJE</video:player_loc><video:duration>1193</video:duration><video:publication_date>2024-11-19T01:59:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/take-k-of-each-character-from-left-and-right-leetcode-2516</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/s4nRUC1SDDA/hqdefault.jpg</video:thumbnail_loc><video:title>Take K of Each Character From Left and Right | 2 Approaches | Leetcode 2516 | codestorywithMIK</video:title><video:description>Take K of Each Character From Left and Right | 2 Approaches | Leetcode 2516 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/s4nRUC1SDDA</video:player_loc><video:duration>2144</video:duration><video:publication_date>2024-11-20T05:12:43.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/continuous-subarrays-leetcode-2762</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/SWyGD8w_85E/hqdefault.jpg</video:thumbnail_loc><video:title>Continuous Subarrays | Detailed Approaches | Time Complexity | Leetcode 2762 | codestorywithMIK</video:title><video:description>Continuous Subarrays | Detailed Approaches | Time Complexity | Leetcode 2762 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/SWyGD8w_85E</video:player_loc><video:duration>3133</video:duration><video:publication_date>2024-12-14T06:07:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/alternating-groups-ii-leetcode-3208</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/EZVLzXvaQ2A/hqdefault.jpg</video:thumbnail_loc><video:title>Alternating Groups II | Multiple Detailed Approaches | Dry Runs | Leetcode 3208 | codestorywithMIK</video:title><video:description>Alternating Groups II | Multiple Detailed Approaches | Dry Runs | Leetcode 3208 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/EZVLzXvaQ2A</video:player_loc><video:duration>2576</video:duration><video:publication_date>2025-03-09T03:35:59.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/count-of-substrings-containing-every-vowel-and-k-consonants-leetcode-3306</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8FP1kkYf2U4/hqdefault.jpg</video:thumbnail_loc><video:title>Count of Substrings Containing Every Vowel and K Consonants II | Leetcode 3306 | codestorywithMIK</video:title><video:description>Count of Substrings Containing Every Vowel and K Consonants II | Leetcode 3306 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8FP1kkYf2U4</video:player_loc><video:duration>3101</video:duration><video:publication_date>2025-03-10T03:35:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/number-of-substrings-containing-all-three-characters-leetcode-1358</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/wafDgldM9MA/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Substrings Containing All Three Characters | Dry Runs | Leetcode 1358 | codestorywithMIK</video:title><video:description>Number of Substrings Containing All Three Characters | Dry Runs | Leetcode 1358 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/wafDgldM9MA</video:player_loc><video:duration>1241</video:duration><video:publication_date>2025-03-11T01:31:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/longest-nice-subarray-leetcode-2401</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/t2p4Sn0Qepo/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Nice Subarray | Brute Force | Better | Optimal | Dry Runs | Leetcode 2401 | codestorywithMIK</video:title><video:description>Longest Nice Subarray | Brute Force | Better | Optimal | Dry Runs | Leetcode 2401 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/t2p4Sn0Qepo</video:player_loc><video:duration>2259</video:duration><video:publication_date>2025-03-18T03:19:59.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/count-the-number-of-good-subarrays-leetcode-2537</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/bO39iLSqvQY/hqdefault.jpg</video:thumbnail_loc><video:title>Count the Number of Good Subarrays | Thought Process | Khandani Template | Leetcode 2537 | MIK</video:title><video:description>Count the Number of Good Subarrays | Thought Process | Khandani Template | Leetcode 2537 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/bO39iLSqvQY</video:player_loc><video:duration>1281</video:duration><video:publication_date>2025-04-16T01:56:21.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/count-complete-subarrays-in-an-array-leetcode-2799</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/t8kDspIQyFQ/hqdefault.jpg</video:thumbnail_loc><video:title>Count Complete Subarrays in an Array | Khandani Template | Dry Run | Leetcode 2799 |codestorywithMIK</video:title><video:description>Count Complete Subarrays in an Array | Khandani Template | Dry Run | Leetcode 2799 |codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/t8kDspIQyFQ</video:player_loc><video:duration>1141</video:duration><video:publication_date>2025-04-24T01:30:58.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/count-subarrays-with-score-less-than-k-leetcode-2302</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/wxd3SWgzoKA/hqdefault.jpg</video:thumbnail_loc><video:title>Count Subarrays With Score Less Than K | Khandani Template Simple | Leetcode 2302 | codestorywithMIK</video:title><video:description>Count Subarrays With Score Less Than K | Khandani Template Simple | Leetcode 2302 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/wxd3SWgzoKA</video:player_loc><video:duration>1192</video:duration><video:publication_date>2025-04-28T01:24:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/maximum-difference-between-even-and-odd-frequency-ii-leetcode-3445</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/zNi7uftAYEs/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Difference Between Even and Odd Frequency II | Super Detailed | Leetcode 3445 | MIK</video:title><video:description>Maximum Difference Between Even and Odd Frequency II | Super Detailed | Leetcode 3445 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/zNi7uftAYEs</video:player_loc><video:duration>4148</video:duration><video:publication_date>2025-06-11T09:57:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/reschedule-meetings-for-maximum-free-time-i-leetcode-3439</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/JPWBTUyGCnM/hqdefault.jpg</video:thumbnail_loc><video:title>Reschedule Meetings for Maximum Free Time I | Detailed Intuition | Leetcode 3439 | codestorywithMIK</video:title><video:description>Reschedule Meetings for Maximum Free Time I | Detailed Intuition | Leetcode 3439 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/JPWBTUyGCnM</video:player_loc><video:duration>1545</video:duration><video:publication_date>2025-07-09T08:03:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/maximum-erasure-value-leetcode-1695</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/V7ZmYjVdZSU/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Erasure Value | 2 Approaches | Leetcode 1695 | codestorywithMIK</video:title><video:description>Maximum Erasure Value | 2 Approaches | Leetcode 1695 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/V7ZmYjVdZSU</video:player_loc><video:duration>1939</video:duration><video:publication_date>2025-07-22T07:18:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/fruit-into-baskets-leetcode-904</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QBi5_btsse4/hqdefault.jpg</video:thumbnail_loc><video:title>Fruit Into Baskets | Simple Observation | Leetcode 904 | codestorywithMIK</video:title><video:description>Fruit Into Baskets | Simple Observation | Leetcode 904 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QBi5_btsse4</video:player_loc><video:duration>1218</video:duration><video:publication_date>2025-08-04T10:51:39.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/find-x-sum-of-all-k-long-subarrays-ii-leetcode-3321</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ZyE1zCe_gSQ/hqdefault.jpg</video:thumbnail_loc><video:title>Find X-Sum of All K-Long Subarrays II | Detailed Intuition | Complete Dry Run | Leetcode 3321 | MIK</video:title><video:description>Find X-Sum of All K-Long Subarrays II | Detailed Intuition | Complete Dry Run | Leetcode 3321 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ZyE1zCe_gSQ</video:player_loc><video:duration>3766</video:duration><video:publication_date>2025-11-05T04:30:23.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/best-time-to-buy-and-sell-stock-using-strategy-leetcode-3652</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/fZl7ymC0uaU/hqdefault.jpg</video:thumbnail_loc><video:title>Best Time to Buy and Sell Stock using Strategy | Simply Detailed | Dry Run | Leetcode 3652 | MIK</video:title><video:description>Best Time to Buy and Sell Stock using Strategy | Simply Detailed | Dry Run | Leetcode 3652 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/fZl7ymC0uaU</video:player_loc><video:duration>2262</video:duration><video:publication_date>2025-12-18T08:17:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/divide-an-array-into-subarrays-with-minimum-cost-ii-leetcode-3013</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/hnj5JrPVqZk/hqdefault.jpg</video:thumbnail_loc><video:title>Divide an Array Into Subarrays With Minimum Cost II | Detailed Intuition | Leetcode 3013 | MIK</video:title><video:description>Divide an Array Into Subarrays With Minimum Cost II | Detailed Intuition | Leetcode 3013 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/hnj5JrPVqZk</video:player_loc><video:duration>3315</video:duration><video:publication_date>2026-02-02T00:14:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/minimum-number-of-flips-to-make-the-binary-string-leetcode-1888</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/T3lhIT7hbl4/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Number of Flips to Make the Binary String Alternating | 3 Detailed Approach | Leetcode 1888</video:title><video:description>Minimum Number of Flips to Make the Binary String Alternating | 3 Detailed Approach | Leetcode 1888. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/T3lhIT7hbl4</video:player_loc><video:duration>2712</video:duration><video:publication_date>2026-03-07T00:54:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/shortest-and-lexicographically-smallest-beautiful-string-leetcode-2904</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/7xvAJkNMHO0/hqdefault.jpg</video:thumbnail_loc><video:title>Shortest and Lexicographically Smallest Beautiful String | Made Very Simple | Leetcode 2904 | MIK</video:title><video:description>Shortest and Lexicographically Smallest Beautiful String | Made Very Simple | Leetcode 2904 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/7xvAJkNMHO0</video:player_loc><video:duration>1439</video:duration><video:publication_date>2026-08-26T06:10:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/find-two-non-overlapping-sub-arrays-each-with-target-sum-leetcode-1477</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/OozgrdhmWWA/hqdefault.jpg</video:thumbnail_loc><video:title>Find Two Non-overlapping Sub-arrays Each With Target Sum | Simple Clean Intuition | Leetcode 1477</video:title><video:description>Find Two Non-overlapping Sub-arrays Each With Target Sum | Simple Clean Intuition | Leetcode 1477. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/OozgrdhmWWA</video:player_loc><video:duration>1635</video:duration><video:publication_date>2026-09-17T02:02:56.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/defuse-the-bomb-leetcode-1652</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QjO6T1cThRU/hqdefault.jpg</video:thumbnail_loc><video:title>Defuse the Bomb | Detailed for Beginners | Leetcode 1652 | codestorywithMIK</video:title><video:description>Defuse the Bomb | Detailed for Beginners | Leetcode 1652 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QjO6T1cThRU</video:player_loc><video:duration>1281</video:duration><video:publication_date>2024-11-18T08:07:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sliding-window/minimum-recolors-to-get-k-consecutive-black-blocks-leetcode-2379</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/3X6pwCDWFUM/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Recolors to Get K Consecutive Black Blocks | 2 Approaches | Leetcode 2379 | codestorywithMIK</video:title><video:description>Minimum Recolors to Get K Consecutive Black Blocks | 2 Approaches | Leetcode 2379 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/3X6pwCDWFUM</video:player_loc><video:duration>1154</video:duration><video:publication_date>2025-03-08T03:05:17.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/find-first-and-last-position-of-element-in-sorted-array-leetcode-34</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/jpuDyt-ruFc/hqdefault.jpg</video:thumbnail_loc><video:title>Find First &amp; Last Position Of Element In Sorted Array-(LinkedIn, Amazon):Live Coding 🧑🏻‍💻👩🏻‍💻</video:title><video:description>Find First &amp; Last Position Of Element In Sorted Array-(LinkedIn, Amazon):Live Coding 🧑🏻‍💻👩🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/jpuDyt-ruFc</video:player_loc><video:duration>1110</video:duration><video:publication_date>2022-07-16T23:30:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/find-minimum-in-rotated-sorted-array-leetcode-153</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Jin6vO0MdzY/hqdefault.jpg</video:thumbnail_loc><video:title>Find Minimum in Rotated Sorted Array | Leetcode 153 | codestorywithMIK</video:title><video:description>Find Minimum in Rotated Sorted Array | Leetcode 153 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Jin6vO0MdzY</video:player_loc><video:duration>845</video:duration><video:publication_date>2022-07-17T23:30:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/search-a-2d-matrix-leetcode-74</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/NYk3IuJinuc/hqdefault.jpg</video:thumbnail_loc><video:title>Search a 2D Matrix | Made Super Easy | Binary Search | AMAZON | Leetcode-74</video:title><video:description>Search a 2D Matrix | Made Super Easy | Binary Search | AMAZON | Leetcode-74. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/NYk3IuJinuc</video:player_loc><video:duration>1150</video:duration><video:publication_date>2022-07-25T23:30:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/single-element-in-a-sorted-array-leetcode-540</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/cw5XhYeAU5o/hqdefault.jpg</video:thumbnail_loc><video:title>Single Element in a Sorted Array | Amazon | Microsoft | Leetcode 540</video:title><video:description>Single Element in a Sorted Array | Amazon | Microsoft | Leetcode 540. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/cw5XhYeAU5o</video:player_loc><video:duration>1490</video:duration><video:publication_date>2022-07-30T23:30:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/find-the-rotation-count-in-rotated-sorted-array-amazon-flipkart-abco-live-coding</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/HodpFY9Y6Vs/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Rotation Count in Rotated Sorted array-(Amazon, Flipkart, ABCO):Live Coding 🧑🏻‍💻👩🏻‍💻</video:title><video:description>Find the Rotation Count in Rotated Sorted array-(Amazon, Flipkart, ABCO):Live Coding 🧑🏻‍💻👩🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/HodpFY9Y6Vs</video:player_loc><video:duration>701</video:duration><video:publication_date>2022-08-22T11:30:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/search-in-rotated-sorted-array-leetcode-33</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/U1VsdRgVevY/hqdefault.jpg</video:thumbnail_loc><video:title>Search in Rotated Sorted Array | Made Super Easy | Binary Search | GOOGLE | AMAZON | Leetcode-33</video:title><video:description>Search in Rotated Sorted Array | Made Super Easy | Binary Search | GOOGLE | AMAZON | Leetcode-33. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/U1VsdRgVevY</video:player_loc><video:duration>1091</video:duration><video:publication_date>2022-09-02T15:51:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/search-in-rotated-sorted-array-ii-leetcode-81</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/eneo_XPUEj0/hqdefault.jpg</video:thumbnail_loc><video:title>Search in Rotated Sorted Array II | Made Super Easy | Binary Search | ADOBE | AMAZON | Leetcode-81</video:title><video:description>Search in Rotated Sorted Array II | Made Super Easy | Binary Search | ADOBE | AMAZON | Leetcode-81. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/eneo_XPUEj0</video:player_loc><video:duration>1238</video:duration><video:publication_date>2022-10-02T08:39:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/guess-number-higher-or-lower-leetcode-374</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/oWp--NIqWac/hqdefault.jpg</video:thumbnail_loc><video:title>Guess Number Higher or Lower -(Microsoft , Google (with variation)) : Explanation ➕ Live Coding</video:title><video:description>Guess Number Higher or Lower -(Microsoft , Google (with variation)) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/oWp--NIqWac</video:player_loc><video:duration>239</video:duration><video:publication_date>2022-11-16T10:30:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/kth-missing-positive-number-leetcode-1539</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/BltzCxN1vRc/hqdefault.jpg</video:thumbnail_loc><video:title>Kth Missing Positive Number | 2 Approaches | codestorywithMIK</video:title><video:description>Kth Missing Positive Number | 2 Approaches | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/BltzCxN1vRc</video:player_loc><video:duration>1395</video:duration><video:publication_date>2023-03-06T11:55:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/minimum-time-to-complete-trips-leetcode-2187</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/tUCVupA0lAc/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Time to Complete Trips | Leetcode 2187 | Detailed | codestorywithMIK</video:title><video:description>Minimum Time to Complete Trips | Leetcode 2187 | Detailed | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/tUCVupA0lAc</video:player_loc><video:duration>1627</video:duration><video:publication_date>2023-03-07T09:28:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/koko-eating-bananas-leetcode-875</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QQcEIxK-snE/hqdefault.jpg</video:thumbnail_loc><video:title>Koko Eating Bananas - (Leetcode - 875) - (Google, Microsoft) : Explanation ➕ Live Coding</video:title><video:description>Koko Eating Bananas - (Leetcode - 875) - (Google, Microsoft) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QQcEIxK-snE</video:player_loc><video:duration>1300</video:duration><video:publication_date>2023-03-08T07:37:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/binary-search-leetcode-704</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Rxf93Ey1fpA/hqdefault.jpg</video:thumbnail_loc><video:title>Binary Search - (Recursive + Iterative) | Leetcode-704 | Explanation ➕ Live Coding</video:title><video:description>Binary Search - (Recursive + Iterative) | Leetcode-704 | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Rxf93Ey1fpA</video:player_loc><video:duration>792</video:duration><video:publication_date>2023-04-01T09:31:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/successful-pairs-of-spells-and-potions-leetcode-2300</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QZI4TCVckpA/hqdefault.jpg</video:thumbnail_loc><video:title>Successful Pairs of Spells and Potions | Leetcode 2300 | Detailed | codestorywithMIK</video:title><video:description>Successful Pairs of Spells and Potions | Leetcode 2300 | Detailed | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QZI4TCVckpA</video:player_loc><video:duration>2105</video:duration><video:publication_date>2023-04-02T07:33:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/minimize-maximum-of-array-leetcode-2439</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/lWU1wI7koGk/hqdefault.jpg</video:thumbnail_loc><video:title>Minimize Maximum of Array - (META) | Leetcode-2439 | Explanation ➕ Live Coding 🧑🏻‍💻👩🏻‍💻</video:title><video:description>Minimize Maximum of Array - (META) | Leetcode-2439 | Explanation ➕ Live Coding 🧑🏻‍💻👩🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/lWU1wI7koGk</video:player_loc><video:duration>2004</video:duration><video:publication_date>2023-04-05T07:41:45.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/maximum-value-at-a-given-index-in-a-bounded-array-leetcode-1802</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/d50vvNSrqfk/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Value at a Given Index in a Bounded Array | Detailed Explanation | GOOGLE | Leetcode-1802</video:title><video:description>Maximum Value at a Given Index in a Bounded Array | Detailed Explanation | GOOGLE | Leetcode-1802. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/d50vvNSrqfk</video:player_loc><video:duration>2228</video:duration><video:publication_date>2023-06-10T14:29:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/minimum-cost-to-make-array-equal-leetcode-2448</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/lGo6E8jiDB8/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Cost to Make Array Equal | Simplest Solution | MICROSOFT | Leetcode-2448 | Explanation</video:title><video:description>Minimum Cost to Make Array Equal | Simplest Solution | MICROSOFT | Leetcode-2448 | Explanation. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/lGo6E8jiDB8</video:player_loc><video:duration>1268</video:duration><video:publication_date>2023-06-21T04:20:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/last-day-where-you-can-still-cross-leetcode-1970</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/U4C7-PF_fi8/hqdefault.jpg</video:thumbnail_loc><video:title>Last Day Where You Can Still Cross | BFS | DFS | Binary Search | Leetcode 1970 | codestorywithMIK</video:title><video:description>Last Day Where You Can Still Cross | BFS | DFS | Binary Search | Leetcode 1970 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/U4C7-PF_fi8</video:player_loc><video:duration>1749</video:duration><video:publication_date>2023-06-30T11:01:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/peak-index-in-a-mountain-array-leetcode-852</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Op07kT-LoH8/hqdefault.jpg</video:thumbnail_loc><video:title>Peak Index in a Mountain Array | Binary Search | DRY RUN | GOOGLE | Leetcode-852</video:title><video:description>Peak Index in a Mountain Array | Binary Search | DRY RUN | GOOGLE | Leetcode-852. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Op07kT-LoH8</video:player_loc><video:duration>1156</video:duration><video:publication_date>2023-07-25T03:54:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/koko-eating-bananas-leetcode-1870</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/6VHDJMYtn3Q/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Speed to Arrive on Time | Binary Search | INTUITION | Online Assessment | Leetcode-1870</video:title><video:description>Minimum Speed to Arrive on Time | Binary Search | INTUITION | Online Assessment | Leetcode-1870. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/6VHDJMYtn3Q</video:player_loc><video:duration>1840</video:duration><video:publication_date>2023-07-26T04:38:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/minimum-speed-to-arrive-on-time-leetcode-2141</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/CdqZNsvVSS4/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Running Time of N Computers | Detailed Deep Dive | Dry Run | Leetcode 2141 | MIK</video:title><video:description>Maximum Running Time of N Computers | Detailed Deep Dive | Dry Run | Leetcode 2141 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/CdqZNsvVSS4</video:player_loc><video:duration>1803</video:duration><video:publication_date>2023-07-27T08:42:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/minimize-the-maximum-difference-of-pairs-leetcode-2616</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/OsG2i00LXFc/hqdefault.jpg</video:thumbnail_loc><video:title>Minimize the Maximum Difference of Pairs | Intuition | META | Leetcode 2616 | codestorywithMIK</video:title><video:description>Minimize the Maximum Difference of Pairs | Intuition | META | Leetcode 2616 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/OsG2i00LXFc</video:player_loc><video:duration>1866</video:duration><video:publication_date>2023-08-09T08:41:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/median-of-two-sorted-arrays-leetcode-4</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/7nABqJCEMuY/hqdefault.jpg</video:thumbnail_loc><video:title>Median of Two Sorted Arrays | PART-2 | Best Approach | Binary Search | Google | Apple | Leetcode - 4</video:title><video:description>Median of Two Sorted Arrays | PART-2 | Best Approach | Binary Search | Google | Apple | Leetcode - 4. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/7nABqJCEMuY</video:player_loc><video:duration>2512</video:duration><video:publication_date>2023-09-21T14:12:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/number-of-flowers-in-full-bloom-leetcode-2251</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9L7258j-enE/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Flowers in Full Bloom | Brute Force | Optimal Approach | Binary Search | Leetcode - 2251</video:title><video:description>Number of Flowers in Full Bloom | Brute Force | Optimal Approach | Binary Search | Leetcode - 2251. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9L7258j-enE</video:player_loc><video:duration>1387</video:duration><video:publication_date>2023-10-11T13:00:59.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/find-in-mountain-array-leetcode-1095</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/wzHmgBIdQXA/hqdefault.jpg</video:thumbnail_loc><video:title>Find in Mountain Array | Binary Search | Using Same Code | AMAZON | Leetcode - 1095</video:title><video:description>Find in Mountain Array | Binary Search | Using Same Code | AMAZON | Leetcode - 1095. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/wzHmgBIdQXA</video:player_loc><video:duration>1158</video:duration><video:publication_date>2023-10-12T09:39:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/apply-operations-to-maximize-frequency-score-leetcode-2968</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Iaz-8ZQYUvs/hqdefault.jpg</video:thumbnail_loc><video:title>Apply Operations to Maximize Frequency Score | Weekly Contest 376 | Leetcode 2968</video:title><video:description>Apply Operations to Maximize Frequency Score | Weekly Contest 376 | Leetcode 2968. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Iaz-8ZQYUvs</video:player_loc><video:duration>3963</video:duration><video:publication_date>2023-12-20T17:35:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/find-the-safest-path-in-a-grid-leetcode-2812</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8I0Z_eajcvs/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Safest Path in a Grid | Super Detailed | Thought Process | Leetcode 2812 | codestorywithMIK</video:title><video:description>Find the Safest Path in a Grid | Super Detailed | Thought Process | Leetcode 2812 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8I0Z_eajcvs</video:player_loc><video:duration>3896</video:duration><video:publication_date>2024-05-15T06:18:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/special-array-with-x-elements-greater-than-or-equal-x-leetcode-1608</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/pYqncHGUqh4/hqdefault.jpg</video:thumbnail_loc><video:title>Special Array With X Elements Greater Than or Equal X | 3 Approaches |Leetcode 1608|codestorywithMIK</video:title><video:description>Special Array With X Elements Greater Than or Equal X | 3 Approaches |Leetcode 1608|codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/pYqncHGUqh4</video:player_loc><video:duration>2226</video:duration><video:publication_date>2024-05-27T04:34:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/most-profit-assigning-work-leetcode-826</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/_HptwlLP8sI/hqdefault.jpg</video:thumbnail_loc><video:title>Most Profit Assigning Work | Multiple Approaches | With Intuition | Leetcode 826 | codestorywithMIK</video:title><video:description>Most Profit Assigning Work | Multiple Approaches | With Intuition | Leetcode 826 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/_HptwlLP8sI</video:player_loc><video:duration>2248</video:duration><video:publication_date>2024-06-18T05:48:38.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/minimum-number-of-days-to-make-m-bouquets-leetcode-1482</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/erWfh_hBF80/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Number of Days to Make m Bouquets | Simple Thought Process| Leetcode 1482 | codestorywithMIK</video:title><video:description>Minimum Number of Days to Make m Bouquets | Simple Thought Process| Leetcode 1482 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/erWfh_hBF80</video:player_loc><video:duration>1556</video:duration><video:publication_date>2024-06-19T02:04:34.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/magnetic-force-between-two-balls-leetcode-1552</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/CSXkcvH8V-c/hqdefault.jpg</video:thumbnail_loc><video:title>Magnetic Force Between Two Balls | Simple Thought Process | Leetcode 1552 | codestorywithMIK</video:title><video:description>Magnetic Force Between Two Balls | Simple Thought Process | Leetcode 1552 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/CSXkcvH8V-c</video:player_loc><video:duration>1502</video:duration><video:publication_date>2024-06-20T03:00:35.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/find-k-th-smallest-pair-distance-leetcode-719</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/hx8Ssz_3XSs/hqdefault.jpg</video:thumbnail_loc><video:title>Find K-th Smallest Pair Distance | Multiple Approaches | Leetcode 719 | codestorywithMIK</video:title><video:description>Find K-th Smallest Pair Distance | Multiple Approaches | Leetcode 719 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/hx8Ssz_3XSs</video:player_loc><video:duration>3234</video:duration><video:publication_date>2024-08-14T06:18:35.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/most-beautiful-item-for-each-query-leetcode-2070</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/kZGRjC7p3AE/hqdefault.jpg</video:thumbnail_loc><video:title>Most Beautiful Item for Each Query | Simple Explanation | Leetcode 2070 | codestorywithMIK</video:title><video:description>Most Beautiful Item for Each Query | Simple Explanation | Leetcode 2070 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/kZGRjC7p3AE</video:player_loc><video:duration>1364</video:duration><video:publication_date>2024-11-12T02:53:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/count-the-number-of-fair-pairs-leetcode-2563</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/r3EnymXRC9A/hqdefault.jpg</video:thumbnail_loc><video:title>Count the Number of Fair Pairs | Detailed Explanation | Leetcode 2563 | codestorywithMIK</video:title><video:description>Count the Number of Fair Pairs | Detailed Explanation | Leetcode 2563 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/r3EnymXRC9A</video:player_loc><video:duration>2071</video:duration><video:publication_date>2024-11-13T05:58:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/minimized-maximum-of-products-distributed-to-any-store-leetcode-2064</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/VaUhSxN1-S0/hqdefault.jpg</video:thumbnail_loc><video:title>Minimized Maximum of Products Distributed to Any Store | Leetcode 2064 | codestorywithMIK</video:title><video:description>Minimized Maximum of Products Distributed to Any Store | Leetcode 2064 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/VaUhSxN1-S0</video:player_loc><video:duration>1539</video:duration><video:publication_date>2024-11-14T05:27:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/minimum-limit-of-balls-in-a-bag-leetcode-1760</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5gtuhc-a_DQ/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Limit of Balls in a Bag | Detailed | Why Binary Search | Leetcode 1760 | codestorywithMIK</video:title><video:description>Minimum Limit of Balls in a Bag | Detailed | Why Binary Search | Leetcode 1760 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5gtuhc-a_DQ</video:player_loc><video:duration>2533</video:duration><video:publication_date>2024-12-07T05:01:21.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/maximize-the-minimum-game-score-leetcode-3449</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/mKDi2RYriLE/hqdefault.jpg</video:thumbnail_loc><video:title>Maximize the Minimum Game Score | Super Detailed | Dry Runs | Leetcode 3449 | codestorywithMIK</video:title><video:description>Maximize the Minimum Game Score | Super Detailed | Dry Runs | Leetcode 3449 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/mKDi2RYriLE</video:player_loc><video:duration>4028</video:duration><video:publication_date>2025-02-13T14:58:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/maximum-candies-allocated-to-k-children-leetcode-2226</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9UxjDEBt8Vg/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Candies Allocated to K Children | Brute Force | Optimal | Leetcode 2226 | codestorywithMIK</video:title><video:description>Maximum Candies Allocated to K Children | Brute Force | Optimal | Leetcode 2226 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9UxjDEBt8Vg</video:player_loc><video:duration>1664</video:duration><video:publication_date>2025-03-14T02:10:49.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/house-robber-iv-leetcode-2560</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YrRvP9720vY/hqdefault.jpg</video:thumbnail_loc><video:title>House Robber IV | Brute Force | Optimal | Leetcode 2560 | codestorywithMIK</video:title><video:description>House Robber IV | Brute Force | Optimal | Leetcode 2560 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YrRvP9720vY</video:player_loc><video:duration>2292</video:duration><video:publication_date>2025-03-15T05:07:35.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/minimum-time-to-repair-cars-leetcode-2594</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/tOo5RX2pt0g/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Time to Repair Cars | With Minute Details | Leetcode 2594 | codestorywithMIK</video:title><video:description>Minimum Time to Repair Cars | With Minute Details | Leetcode 2594 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/tOo5RX2pt0g</video:player_loc><video:duration>1775</video:duration><video:publication_date>2025-03-16T04:13:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/maximum-number-of-tasks-you-can-assign-leetcode-2071</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/7tGM7XA06MI/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Number of Tasks You Can Assign | Detailed Explanation | Leetcode 2071 | codestorywithMIK</video:title><video:description>Maximum Number of Tasks You Can Assign | Detailed Explanation | Leetcode 2071 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/7tGM7XA06MI</video:player_loc><video:duration>2831</video:duration><video:publication_date>2025-05-01T07:44:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/minimize-the-maximum-adjacent-element-difference-leetcode-3357</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/J_2DtfCHeSI/hqdefault.jpg</video:thumbnail_loc><video:title>Minimize the Maximum Adjacent Element Difference | Detailed Explanation | Leetcode 3357 | MIK</video:title><video:description>Minimize the Maximum Adjacent Element Difference | Detailed Explanation | Leetcode 3357 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/J_2DtfCHeSI</video:player_loc><video:duration>4847</video:duration><video:publication_date>2025-06-17T04:07:57.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/kth-smallest-product-of-two-sorted-arrays-leetcode-2040</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/pjY5KaxYVIE/hqdefault.jpg</video:thumbnail_loc><video:title>Kth Smallest Product of Two Sorted Arrays | Detailed Explanation | Leetcode 2040 | codestorywithMIK</video:title><video:description>Kth Smallest Product of Two Sorted Arrays | Detailed Explanation | Leetcode 2040 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/pjY5KaxYVIE</video:player_loc><video:duration>3571</video:duration><video:publication_date>2025-06-25T12:18:58.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/maximum-fruits-harvested-after-at-most-k-steps-leetcode-2106</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9biz4kxyVh8/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Fruits Harvested After at Most K Steps | Detailed Explanation | Leetcode 2106 | MIK</video:title><video:description>Maximum Fruits Harvested After at Most K Steps | Detailed Explanation | Leetcode 2106 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9biz4kxyVh8</video:player_loc><video:duration>2431</video:duration><video:publication_date>2025-08-03T06:25:51.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/avoid-flood-in-the-city-leetcode-1488</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/OVLW_XnOUQ4/hqdefault.jpg</video:thumbnail_loc><video:title>Avoid Flood in The City | Detailed Thought Process | Intuitive | Leetcode 1488 | codestorywithMIK</video:title><video:description>Avoid Flood in The City | Detailed Thought Process | Intuitive | Leetcode 1488 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/OVLW_XnOUQ4</video:player_loc><video:duration>1986</video:duration><video:publication_date>2025-10-07T11:48:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/maximize-the-minimum-powered-city-leetcode-2528</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/CAvYhc74Eio/hqdefault.jpg</video:thumbnail_loc><video:title>Maximize the Minimum Powered City | Deep Dive | Dry Run | Intuition | Leetcode 2528 | MIK</video:title><video:description>Maximize the Minimum Powered City | Deep Dive | Dry Run | Intuition | Leetcode 2528 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/CAvYhc74Eio</video:player_loc><video:duration>3571</video:duration><video:publication_date>2025-11-07T12:31:41.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/separate-squares-i-leetcode-3453</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/w0QJQtMxUfk/hqdefault.jpg</video:thumbnail_loc><video:title>Separate Squares I | Understand WHY behind everything | Intuition | Leetcode 3453 | codestorywithMIK</video:title><video:description>Separate Squares I | Understand WHY behind everything | Intuition | Leetcode 3453 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/w0QJQtMxUfk</video:player_loc><video:duration>2503</video:duration><video:publication_date>2026-01-13T08:41:45.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/minimum-number-of-seconds-to-make-mountain-height-zero-leetcode-3296</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/TUfk43zbdwI/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Number of Seconds to Make Mountain Height Zero | Understand WHY | Leetcode 3296 | MIK</video:title><video:description>Minimum Number of Seconds to Make Mountain Height Zero | Understand WHY | Leetcode 3296 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/TUfk43zbdwI</video:player_loc><video:duration>1585</video:duration><video:publication_date>2026-03-13T03:25:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/maximize-the-distance-between-points-on-a-square-leetcode-3464</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/iOBDwcfrAf0/hqdefault.jpg</video:thumbnail_loc><video:title>Maximize the Distance Between Points on a Square | Super Detailed Intuition | Leetcode 3464 | MIK</video:title><video:description>Maximize the Distance Between Points on a Square | Super Detailed Intuition | Leetcode 3464 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/iOBDwcfrAf0</video:player_loc><video:duration>4590</video:duration><video:publication_date>2026-04-25T16:44:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/minimum-initial-energy-to-finish-tasks-leetcode-1665</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Bw0HySng9wo/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Initial Energy to Finish Tasks | Simplified | Intuition | Leetcode 1665 | codestorywithMIK</video:title><video:description>Minimum Initial Energy to Finish Tasks | Simplified | Intuition | Leetcode 1665 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Bw0HySng9wo</video:player_loc><video:duration>1543</video:duration><video:publication_date>2026-05-12T00:37:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search/find-minimum-in-rotated-sorted-array-ii-leetcode-154</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/N9YDsS9WJmM/hqdefault.jpg</video:thumbnail_loc><video:title>Find Minimum in Rotated Sorted Array II | Simplified | Template | Dry Run | Leetcode 154 | MIK</video:title><video:description>Find Minimum in Rotated Sorted Array II | Simplified | Template | Dry Run | Leetcode 154 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/N9YDsS9WJmM</video:player_loc><video:duration>1257</video:duration><video:publication_date>2026-05-16T03:06:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sorting/top-k-frequent-words-leetcode-692</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/zW-8-6A2gxM/hqdefault.jpg</video:thumbnail_loc><video:title>Top K Frequent Words -(Amazon, Bloomberg, Uber, Microsoft, Adobe...): Explanation ➕ Live Coding</video:title><video:description>Top K Frequent Words -(Amazon, Bloomberg, Uber, Microsoft, Adobe...): Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/zW-8-6A2gxM</video:player_loc><video:duration>1076</video:duration><video:publication_date>2022-10-19T03:34:13.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sorting/sort-characters-by-frequency-leetcode-451</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/pnxShVARLLw/hqdefault.jpg</video:thumbnail_loc><video:title>Sort Characters By Frequency | Sorting | Lambda | Leetcode 451</video:title><video:description>Sort Characters By Frequency | Sorting | Lambda | Leetcode 451. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/pnxShVARLLw</video:player_loc><video:duration>1044</video:duration><video:publication_date>2022-12-03T07:16:18.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sorting/sort-an-array-leetcode-912</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/PnyxRdn-N9U/hqdefault.jpg</video:thumbnail_loc><video:title>Sort an Array | Leetcode 912 | codestorywithMIK</video:title><video:description>Sort an Array | Leetcode 912 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/PnyxRdn-N9U</video:player_loc><video:duration>608</video:duration><video:publication_date>2023-03-01T08:05:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sorting/partition-array-such-that-maximum-difference-is-k-leetcode-2294</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/4Tptf8TvYag/hqdefault.jpg</video:thumbnail_loc><video:title>Partition Array Such That Maximum Difference Is K | Simple Thought Process | Leetcode 2294 | MIK</video:title><video:description>Partition Array Such That Maximum Difference Is K | Simple Thought Process | Leetcode 2294 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/4Tptf8TvYag</video:player_loc><video:duration>1105</video:duration><video:publication_date>2025-06-19T01:01:47.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sorting/find-subsequence-of-length-k-with-the-largest-sum-leetcode-2099</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/J6tGPJmCXG4/hqdefault.jpg</video:thumbnail_loc><video:title>Find Subsequence of Length K With the Largest Sum | 2 Approaches | Leetcode 2099 | codestorywithMIK</video:title><video:description>Find Subsequence of Length K With the Largest Sum | 2 Approaches | Leetcode 2099 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/J6tGPJmCXG4</video:player_loc><video:duration>2442</video:duration><video:publication_date>2025-06-28T06:14:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sorting/maximum-number-of-events-that-can-be-attended-leetcode-1353</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/7xa6JIuxAOo/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Number of Events That Can Be Attended | Detailed Approach | Leetcode 1353 | codestorywithMIK</video:title><video:description>Maximum Number of Events That Can Be Attended | Detailed Approach | Leetcode 1353 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/7xa6JIuxAOo</video:player_loc><video:duration>1684</video:duration><video:publication_date>2025-07-07T03:01:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sorting/maximum-matching-of-players-with-trainers-leetcode-2410</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ORr5HNEJNlU/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Matching of Players With Trainers | Simple Intuition | Leetcode 2410 | codestorywithMIK</video:title><video:description>Maximum Matching of Players With Trainers | Simple Intuition | Leetcode 2410 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ORr5HNEJNlU</video:player_loc><video:duration>869</video:duration><video:publication_date>2025-07-13T04:05:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sorting/reordered-power-of-2-leetcode-869</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/_Y8xqGvZu8M/hqdefault.jpg</video:thumbnail_loc><video:title>Reordered Power of 2 | 4 APPROACHES | Leetcode 869 | codestorywithMIK</video:title><video:description>Reordered Power of 2 | 4 APPROACHES | Leetcode 869 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/_Y8xqGvZu8M</video:player_loc><video:duration>1983</video:duration><video:publication_date>2025-08-10T06:17:58.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sorting/count-mentions-per-user-leetcode-3433</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/3WN6qHE4K_E/hqdefault.jpg</video:thumbnail_loc><video:title>Count Mentions Per User | Simple | Straight Forward Explanation | Dry Run | Leetcode 3433 | MIK</video:title><video:description>Count Mentions Per User | Simple | Straight Forward Explanation | Dry Run | Leetcode 3433 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/3WN6qHE4K_E</video:player_loc><video:duration>1613</video:duration><video:publication_date>2025-12-12T06:39:56.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sorting/remove-covered-intervals-leetcode-1288</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Tbx_AJaDTUg/hqdefault.jpg</video:thumbnail_loc><video:title>Remove Covered Intervals | 3 Detailed Approaches | Dry Runs | Leetcode 1288 | codestorywithMIK</video:title><video:description>Remove Covered Intervals | 3 Detailed Approaches | Dry Runs | Leetcode 1288 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Tbx_AJaDTUg</video:player_loc><video:duration>1963</video:duration><video:publication_date>2026-07-06T03:22:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/sorting/minimum-swaps-to-sort-by-digit-sum-leetcode-3551</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/2COTaaNSLfg/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Swaps to Sort by Digit Sum | Simplest Intuition | Leetcode 3551 | codestorywithMIK</video:title><video:description>Minimum Swaps to Sort by Digit Sum | Simplest Intuition | Leetcode 3551 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/2COTaaNSLfg</video:player_loc><video:duration>1199</video:duration><video:publication_date>2026-10-17T05:01:41.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/delete-node-in-a-linked-list-leetcode-237</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/TvLWOECe8mQ/hqdefault.jpg</video:thumbnail_loc><video:title>Delete Node in a Linked List | Super Easy | Apple | Microsoft | Leetcode 237</video:title><video:description>Delete Node in a Linked List | Super Easy | Apple | Microsoft | Leetcode 237. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/TvLWOECe8mQ</video:player_loc><video:duration>721</video:duration><video:publication_date>2022-10-13T04:31:52.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/delete-the-middle-node-of-a-linked-list-leetcode-2095</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/KEcXDqthMLE/hqdefault.jpg</video:thumbnail_loc><video:title>Delete the Middle Node of a Linked List | Flipkart | Amazon | Microsoft | Leetcode 2095</video:title><video:description>Delete the Middle Node of a Linked List | Flipkart | Amazon | Microsoft | Leetcode 2095. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/KEcXDqthMLE</video:player_loc><video:duration>876</video:duration><video:publication_date>2022-10-14T03:23:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/middle-of-the-linked-list-leetcode-876</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/I8h_hI_BF3Y/hqdefault.jpg</video:thumbnail_loc><video:title>Middle of the Linked List | Hare and Tortoise  | Leetcode 876</video:title><video:description>Middle of the Linked List | Hare and Tortoise  | Leetcode 876. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/I8h_hI_BF3Y</video:player_loc><video:duration>421</video:duration><video:publication_date>2022-12-05T07:24:59.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/odd-even-linked-list-leetcode-328</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/kbcucihgO_I/hqdefault.jpg</video:thumbnail_loc><video:title>Odd Even Linked List | Made Easy | Leetcode 328 | codestorywithMIK</video:title><video:description>Odd Even Linked List | Made Easy | Leetcode 328 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/kbcucihgO_I</video:player_loc><video:duration>1324</video:duration><video:publication_date>2022-12-06T05:35:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/linked-list-cycle-ii-leetcode-142</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/vlrxs-LPni4/hqdefault.jpg</video:thumbnail_loc><video:title>Linked List Cycle II | Complete Intuition | Leetcode - 142 | Amazon | Microsoft</video:title><video:description>Linked List Cycle II | Complete Intuition | Leetcode - 142 | Amazon | Microsoft. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/vlrxs-LPni4</video:player_loc><video:duration>1013</video:duration><video:publication_date>2023-03-09T08:40:52.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/linked-list-random-node-leetcode-382</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9vC4I5sKFsw/hqdefault.jpg</video:thumbnail_loc><video:title>Linked List Random Node - (Leetcode - 382) - (GOOGLE) : Explanation ➕ Live Coding</video:title><video:description>Linked List Random Node - (Leetcode - 382) - (GOOGLE) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9vC4I5sKFsw</video:player_loc><video:duration>1274</video:duration><video:publication_date>2023-03-10T15:06:55.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/convert-sorted-list-to-binary-search-tree-leetcode-109</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/4zvmruet_H0/hqdefault.jpg</video:thumbnail_loc><video:title>Convert Sorted List to Binary Search Tree | Google | Flipkart | Amazon | Leetcode 109</video:title><video:description>Convert Sorted List to Binary Search Tree | Google | Flipkart | Amazon | Leetcode 109. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/4zvmruet_H0</video:player_loc><video:duration>1349</video:duration><video:publication_date>2023-03-11T05:18:34.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/merge-k-sorted-lists-leetcode-23</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Q64u-W3l3mA/hqdefault.jpg</video:thumbnail_loc><video:title>Merge k Sorted Lists - (Leetcode - 23) - (Google, Amazon, Microsoft..) : Explanation ➕ Live Coding</video:title><video:description>Merge k Sorted Lists - (Leetcode - 23) - (Google, Amazon, Microsoft..) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Q64u-W3l3mA</video:player_loc><video:duration>1618</video:duration><video:publication_date>2023-03-12T06:14:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/remove-zero-sum-consecutive-nodes-from-linked-list-leetcode-1171</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5UWEVMg10rY/hqdefault.jpg</video:thumbnail_loc><video:title>Remove Zero Sum Consecutive Nodes from Linked List | Made Super Easy | Leetcode-1171</video:title><video:description>Remove Zero Sum Consecutive Nodes from Linked List | Made Super Easy | Leetcode-1171. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5UWEVMg10rY</video:player_loc><video:duration>1433</video:duration><video:publication_date>2023-04-17T07:03:52.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/swapping-nodes-in-a-linked-list-leetcode-1721</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/TxryJMerDwE/hqdefault.jpg</video:thumbnail_loc><video:title>Swapping Nodes in a Linked List | 1 Pass | 2 Pass | MICROSOFT, AMAZON | Leetcode-1721 | Live Code</video:title><video:description>Swapping Nodes in a Linked List | 1 Pass | 2 Pass | MICROSOFT, AMAZON | Leetcode-1721 | Live Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/TxryJMerDwE</video:player_loc><video:duration>1073</video:duration><video:publication_date>2023-05-15T08:54:47.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/swap-nodes-in-pairs-leetcode-24</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8yLiGS4ntHw/hqdefault.jpg</video:thumbnail_loc><video:title>Swap Nodes in Pairs | | MICROSOFT, AMAZON | Leetcode-24 | Live Code + Explanation 🧑🏻‍💻👩🏻‍💻</video:title><video:description>Swap Nodes in Pairs | | MICROSOFT, AMAZON | Leetcode-24 | Live Code + Explanation 🧑🏻‍💻👩🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8yLiGS4ntHw</video:player_loc><video:duration>939</video:duration><video:publication_date>2023-05-16T05:56:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/maximum-twin-sum-of-a-linked-list-leetcode-2130</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/L0UnqdfFcV4/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Twin Sum of a Linked List | 3 Approaches | GOOGLE | Leetcode-2130 | Live Code + Explanation</video:title><video:description>Maximum Twin Sum of a Linked List | 3 Approaches | GOOGLE | Leetcode-2130 | Live Code + Explanation. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/L0UnqdfFcV4</video:player_loc><video:duration>1557</video:duration><video:publication_date>2023-05-17T10:39:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/add-two-numbers-ii-leetcode-445</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/B-uQN5wp6Jg/hqdefault.jpg</video:thumbnail_loc><video:title>Add Two Numbers II | Follow Up Qn Also | 2 Approaches | AMAZON | MICROSOFT | Leetcode-445</video:title><video:description>Add Two Numbers II | Follow Up Qn Also | 2 Approaches | AMAZON | MICROSOFT | Leetcode-445. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/B-uQN5wp6Jg</video:player_loc><video:duration>1710</video:duration><video:publication_date>2023-07-17T02:52:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/partition-list-leetcode-86</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/NYZKRUT_8MY/hqdefault.jpg</video:thumbnail_loc><video:title>Partition List | Made Super Easy | Leetcode 86 | Dry Run | codestorywithMIK</video:title><video:description>Partition List | Made Super Easy | Leetcode 86 | Dry Run | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/NYZKRUT_8MY</video:player_loc><video:duration>893</video:duration><video:publication_date>2023-08-15T04:47:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/copy-list-with-random-pointer-leetcode-138</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/OLgXN2Yg3xQ/hqdefault.jpg</video:thumbnail_loc><video:title>Copy List with Random Pointer | 2 Approaches | Clear Intuition | Dry Run | Microsoft| Leetcode - 138</video:title><video:description>Copy List with Random Pointer | 2 Approaches | Clear Intuition | Dry Run | Microsoft| Leetcode - 138. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/OLgXN2Yg3xQ</video:player_loc><video:duration>2708</video:duration><video:publication_date>2023-09-05T04:09:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/split-linked-list-in-parts-leetcode-725</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/tY1HevJFD98/hqdefault.jpg</video:thumbnail_loc><video:title>Split Linked List in Parts | Clean | Simple Code | Dry Run | Leetcode - 725 | codestorywithMIK</video:title><video:description>Split Linked List in Parts | Clean | Simple Code | Dry Run | Leetcode - 725 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/tY1HevJFD98</video:player_loc><video:duration>1710</video:duration><video:publication_date>2023-09-06T03:48:53.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/reverse-linked-list-ii-leetcode-92</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/bRZ_Fy4zRRY/hqdefault.jpg</video:thumbnail_loc><video:title>Reverse Linked List II | Clean Approach | Dry Run | MICROSOFT | Leetcode - 92 | codestorywithMIK</video:title><video:description>Reverse Linked List II | Clean Approach | Dry Run | MICROSOFT | Leetcode - 92 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/bRZ_Fy4zRRY</video:player_loc><video:duration>1313</video:duration><video:publication_date>2023-09-07T06:43:25.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/reverse-linked-list-leetcode-206</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/RreHsOfi14w/hqdefault.jpg</video:thumbnail_loc><video:title>Reverse Linked List | Merge Two Sorted Lists | Reverse Order | Leetcode 206 | Leetcode 21 | GFG POTD</video:title><video:description>Reverse Linked List | Merge Two Sorted Lists | Reverse Order | Leetcode 206 | Leetcode 21 | GFG POTD. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/RreHsOfi14w</video:player_loc><video:duration>1672</video:duration><video:publication_date>2024-01-08T16:22:13.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/remove-nth-node-from-end-of-list-leetcode-19</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ZQizovB_UdI/hqdefault.jpg</video:thumbnail_loc><video:title>Remove Nth Node From End of List | 1 Pass | 2 Pass | Leetcode 19</video:title><video:description>Remove Nth Node From End of List | 1 Pass | 2 Pass | Leetcode 19. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ZQizovB_UdI</video:player_loc><video:duration>1290</video:duration><video:publication_date>2024-03-03T05:41:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/merge-in-between-linked-lists-leetcode-1669</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/wIC9enD8Wzg/hqdefault.jpg</video:thumbnail_loc><video:title>Merge In Between Linked Lists | Easy Straight Forward | AMAZON | Leetcode 1669 | codestorywithMIK</video:title><video:description>Merge In Between Linked Lists | Easy Straight Forward | AMAZON | Leetcode 1669 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/wIC9enD8Wzg</video:player_loc><video:duration>705</video:duration><video:publication_date>2024-03-20T03:41:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/palindrome-linked-list-leetcode-234</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Sgi2BHiW0-Q/hqdefault.jpg</video:thumbnail_loc><video:title>Palindrome Linked List | 4 Approaches | Leetcode 234| codestorywithMIK</video:title><video:description>Palindrome Linked List | 4 Approaches | Leetcode 234| codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Sgi2BHiW0-Q</video:player_loc><video:duration>2693</video:duration><video:publication_date>2024-03-22T04:50:57.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/reorder-list-leetcode-143</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/7cp_HR1BT1E/hqdefault.jpg</video:thumbnail_loc><video:title>Reorder List | 3 Approaches | Leetcode 143 | codestorywithMIK</video:title><video:description>Reorder List | 3 Approaches | Leetcode 143 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/7cp_HR1BT1E</video:player_loc><video:duration>2394</video:duration><video:publication_date>2024-03-23T05:19:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/remove-nodes-from-linked-list-leetcode-2487</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/RTVG66xulcA/hqdefault.jpg</video:thumbnail_loc><video:title>Remove Nodes From Linked List | 3 Detailed Approaches | Story | Leetcode 2487 | codestorywithMIK</video:title><video:description>Remove Nodes From Linked List | 3 Detailed Approaches | Story | Leetcode 2487 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/RTVG66xulcA</video:player_loc><video:duration>1889</video:duration><video:publication_date>2024-05-06T05:15:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/double-a-number-represented-as-a-linked-list-leetcode-2816</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/KlB72wJDTv4/hqdefault.jpg</video:thumbnail_loc><video:title>Double a Number Represented as a Linked List | 4 Approaches | Story|Leetcode 2816 | codestorywithMIK</video:title><video:description>Double a Number Represented as a Linked List | 4 Approaches | Story|Leetcode 2816 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/KlB72wJDTv4</video:player_loc><video:duration>2592</video:duration><video:publication_date>2024-05-07T06:21:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/merge-nodes-in-between-zeros-leetcode-2181</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/GyoRAaVCOKs/hqdefault.jpg</video:thumbnail_loc><video:title>Merge Nodes in Between Zeros | 2 Approaches | Leap Of Faith | Leetcode 2181 | codestorywithMIK</video:title><video:description>Merge Nodes in Between Zeros | 2 Approaches | Leap Of Faith | Leetcode 2181 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/GyoRAaVCOKs</video:player_loc><video:duration>1296</video:duration><video:publication_date>2024-07-04T02:32:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/find-the-minimum-and-maximum-number-of-nodes-between-leetcode-2058</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/RPxCrG3F8CE/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Minimum and Maximum Number of Nodes Between Critical Points | 2 Ways | Leetcode 2058</video:title><video:description>Find the Minimum and Maximum Number of Nodes Between Critical Points | 2 Ways | Leetcode 2058. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/RPxCrG3F8CE</video:player_loc><video:duration>1901</video:duration><video:publication_date>2024-07-05T04:48:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/delete-nodes-from-linked-list-present-in-array-leetcode-3217</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/qb7br7auuOc/hqdefault.jpg</video:thumbnail_loc><video:title>Delete Nodes From Linked List Present in Array | Simple | Dry Run | Leetcode 3217 | codestorywithMIK</video:title><video:description>Delete Nodes From Linked List Present in Array | Simple | Dry Run | Leetcode 3217 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/qb7br7auuOc</video:player_loc><video:duration>919</video:duration><video:publication_date>2024-09-06T03:01:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/insert-greatest-common-divisors-in-linked-list-leetcode-2807</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/BYXcK48Bzok/hqdefault.jpg</video:thumbnail_loc><video:title>Insert Greatest Common Divisors in Linked List | 2 Approaches | Leetcode 2807 | codestorywithMIK</video:title><video:description>Insert Greatest Common Divisors in Linked List | 2 Approaches | Leetcode 2807 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/BYXcK48Bzok</video:player_loc><video:duration>1168</video:duration><video:publication_date>2024-09-10T02:18:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/rotate-list-leetcode-61</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/3OdL3HskfCc/hqdefault.jpg</video:thumbnail_loc><video:title>Rotate List | Simplified Approach | Dry Run | Leetcode 61 | codestorywithMIK</video:title><video:description>Rotate List | Simplified Approach | Dry Run | Leetcode 61 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/3OdL3HskfCc</video:player_loc><video:duration>1070</video:duration><video:publication_date>2026-05-05T09:33:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/linked-list/convert-binary-number-in-a-linked-list-to-integer-leetcode-1290</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/sUf_-_c1zYI/hqdefault.jpg</video:thumbnail_loc><video:title>Convert Binary Number in a Linked List to Integer | 2 Approaches | Leetcode 1290 | codestorywithMIK</video:title><video:description>Convert Binary Number in a Linked List to Integer | 2 Approaches | Leetcode 1290 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/sUf_-_c1zYI</video:player_loc><video:duration>885</video:duration><video:publication_date>2025-07-14T01:30:57.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/introduction-to-monotonic-data-structures</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/yRyumGu_owg/hqdefault.jpg</video:thumbnail_loc><video:title>Introduction to Monotonic Data Structures | Roadmap | Applications | codestorywithMIK</video:title><video:description>Introduction to Monotonic Data Structures | Roadmap | Applications | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/yRyumGu_owg</video:player_loc><video:duration>257</video:duration><video:publication_date>2025-06-10T20:02:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/what-are-monotonic-data-structures</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/BX38sNbRaMs/hqdefault.jpg</video:thumbnail_loc><video:title>What are Monotonic Data Structures | Monotonic Stack | Template | codestorywithMIK</video:title><video:description>What are Monotonic Data Structures | Monotonic Stack | Template | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/BX38sNbRaMs</video:player_loc><video:duration>2416</video:duration><video:publication_date>2025-06-10T20:02:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/monotonic-queue</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/cnOtN6T_zMY/hqdefault.jpg</video:thumbnail_loc><video:title>Monotonic Queue | Template | Detailed Dry Runs | Related Problems | codestorywithMIK</video:title><video:description>Monotonic Queue | Template | Detailed Dry Runs | Related Problems | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/cnOtN6T_zMY</video:player_loc><video:duration>2339</video:duration><video:publication_date>2025-06-10T20:02:38.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/online-stock-span-leetcode-901</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/IDC1rnr3vus/hqdefault.jpg</video:thumbnail_loc><video:title>Online Stock Span (Microsoft, Amazon, FactSet, Samsung, Adobe, Flipkart) : Explanation ➕ Live Coding</video:title><video:description>Online Stock Span (Microsoft, Amazon, FactSet, Samsung, Adobe, Flipkart) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/IDC1rnr3vus</video:player_loc><video:duration>1011</video:duration><video:publication_date>2022-11-09T07:30:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/remove-all-adjacent-duplicates-in-string-leetcode-1047</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/VeOUal3_s6c/hqdefault.jpg</video:thumbnail_loc><video:title>Remove All Adjacent Duplicates In String (Microsoft, Paytm, Samsung) : Explanation ➕ Live Coding</video:title><video:description>Remove All Adjacent Duplicates In String (Microsoft, Paytm, Samsung) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/VeOUal3_s6c</video:player_loc><video:duration>606</video:duration><video:publication_date>2022-11-10T03:48:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/basic-calculator-leetcode-224</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/3AEKyHx3tzU/hqdefault.jpg</video:thumbnail_loc><video:title>Basic Calculator (Google, Meta, Airbnb) : Explanation ➕ Live Coding 🧑🏻‍💻👩🏻‍💻</video:title><video:description>Basic Calculator (Google, Meta, Airbnb) : Explanation ➕ Live Coding 🧑🏻‍💻👩🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/3AEKyHx3tzU</video:player_loc><video:duration>2060</video:duration><video:publication_date>2022-11-20T10:36:34.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/sum-of-subarray-minimums-leetcode-907</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/HRQB7-D2bi0/hqdefault.jpg</video:thumbnail_loc><video:title>Sum of Subarray Minimums | Detailed | Leetcode 907 | codestorywithMIK</video:title><video:description>Sum of Subarray Minimums | Detailed | Leetcode 907 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/HRQB7-D2bi0</video:player_loc><video:duration>2979</video:duration><video:publication_date>2022-11-25T14:48:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/implement-queue-using-stacks-leetcode-232</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/V1vqtGW0X0Y/hqdefault.jpg</video:thumbnail_loc><video:title>Implement Queue using Stacks | Amortised O(1) | Leetcode 232 | Google</video:title><video:description>Implement Queue using Stacks | Amortised O(1) | Leetcode 232 | Google. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/V1vqtGW0X0Y</video:player_loc><video:duration>1300</video:duration><video:publication_date>2022-12-16T06:19:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/evaluate-reverse-polish-notation-leetcode-150</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/BM-bu4tJz7U/hqdefault.jpg</video:thumbnail_loc><video:title>Evaluate Reverse Polish Notation | 2 Approaches | Leetcode 150</video:title><video:description>Evaluate Reverse Polish Notation | 2 Approaches | Leetcode 150. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/BM-bu4tJz7U</video:player_loc><video:duration>1253</video:duration><video:publication_date>2022-12-17T03:35:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/daily-temperatures-leetcode-739</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ZhZEmGv-sOY/hqdefault.jpg</video:thumbnail_loc><video:title>Daily Temperatures | Time Complexity Explained | Google | Leetcode 739</video:title><video:description>Daily Temperatures | Time Complexity Explained | Google | Leetcode 739. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ZhZEmGv-sOY</video:player_loc><video:duration>1311</video:duration><video:publication_date>2022-12-18T04:45:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/valid-parentheses-leetcode-20</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/3ssh_mk4LqY/hqdefault.jpg</video:thumbnail_loc><video:title>Valid Parentheses | Leetcode - 20 | Google, Meta | Explanation ➕ Live Coding Trash</video:title><video:description>Valid Parentheses | Leetcode - 20 | Google, Meta | Explanation ➕ Live Coding Trash. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/3ssh_mk4LqY</video:player_loc><video:duration>580</video:duration><video:publication_date>2023-04-10T04:39:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/removing-stars-from-a-string-leetcode-2390</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/s1pcdsRCVDg/hqdefault.jpg</video:thumbnail_loc><video:title>Removing Stars From a String | Leetcode - 2390 | MICROSOFT | Explanation ➕ Live Coding</video:title><video:description>Removing Stars From a String | Leetcode - 2390 | MICROSOFT | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/s1pcdsRCVDg</video:player_loc><video:duration>794</video:duration><video:publication_date>2023-04-11T04:06:23.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/simplify-path-leetcode-71</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ZV-Hi1e1KL8/hqdefault.jpg</video:thumbnail_loc><video:title>Simplify Path | Leetcode - 71 | META | Explanation ➕ Live Coding</video:title><video:description>Simplify Path | Leetcode - 71 | META | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ZV-Hi1e1KL8</video:player_loc><video:duration>1168</video:duration><video:publication_date>2023-04-12T15:09:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/validate-stack-sequences-leetcode-946</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/HEh7EtNSXtg/hqdefault.jpg</video:thumbnail_loc><video:title>Validate Stack Sequences | Leetcode - 946 | AMAZON | Explanation ➕ Live Coding</video:title><video:description>Validate Stack Sequences | Leetcode - 946 | AMAZON | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/HEh7EtNSXtg</video:player_loc><video:duration>664</video:duration><video:publication_date>2023-04-13T07:13:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/asteroid-collision-leetcode-735</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/7isfomHzzno/hqdefault.jpg</video:thumbnail_loc><video:title>Asteroid Collision | Intuition | Dry Run | Leetcode-735 | Uber | Lyft | Explanation ➕ Live Coding</video:title><video:description>Asteroid Collision | Intuition | Dry Run | Leetcode-735 | Uber | Lyft | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/7isfomHzzno</video:player_loc><video:duration>1254</video:duration><video:publication_date>2023-07-20T06:14:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/132-pattern-leetcode-456</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/RZXxX1EU364/hqdefault.jpg</video:thumbnail_loc><video:title>132 Pattern | Intuition explained | Brute Force | Better | Optimal  | META | AMAZON | Leetcode - 456</video:title><video:description>132 Pattern | Intuition explained | Brute Force | Better | Optimal  | META | AMAZON | Leetcode - 456. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/RZXxX1EU364</video:player_loc><video:duration>1898</video:duration><video:publication_date>2023-09-30T10:09:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/build-an-array-with-stack-operations-leetcode-1441</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/nmNLu1Qz-C0/hqdefault.jpg</video:thumbnail_loc><video:title>Build an Array With Stack Operations | Dry Run | Clean | Leetcode - 1441</video:title><video:description>Build an Array With Stack Operations | Dry Run | Clean | Leetcode - 1441. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/nmNLu1Qz-C0</video:player_loc><video:duration>840</video:duration><video:publication_date>2023-11-03T03:15:48.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/minimum-remove-to-make-valid-parentheses-leetcode-1249</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/NNxaYz0nrk0/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Remove to Make Valid Parentheses | 3 Detailed Approaches | Leetcode 1249 | codestorywithMIK</video:title><video:description>Minimum Remove to Make Valid Parentheses | 3 Detailed Approaches | Leetcode 1249 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/NNxaYz0nrk0</video:player_loc><video:duration>2658</video:duration><video:publication_date>2024-04-06T05:13:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/remove-k-digits-leetcode-402</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/lWcZB7l-O7M/hqdefault.jpg</video:thumbnail_loc><video:title>Remove K Digits | Intuition | Dry Run | Leetcode 402 | codestorywithMIK</video:title><video:description>Remove K Digits | Intuition | Dry Run | Leetcode 402 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/lWcZB7l-O7M</video:player_loc><video:duration>2107</video:duration><video:publication_date>2024-04-11T05:54:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/maximal-rectangle-leetcode-85</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/sH5yj83ta_Y/hqdefault.jpg</video:thumbnail_loc><video:title>Maximal Rectangle | Multiple Hidden Problems | Intuition | Leetcode 85 | codestorywithMIK</video:title><video:description>Maximal Rectangle | Multiple Hidden Problems | Intuition | Leetcode 85 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/sH5yj83ta_Y</video:player_loc><video:duration>4850</video:duration><video:publication_date>2024-04-13T05:16:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/reverse-substrings-between-each-pair-of-parentheses-leetcode-1190</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/dUQRS4luBvA/hqdefault.jpg</video:thumbnail_loc><video:title>Reverse Substrings Between Each Pair of Parentheses | 2 Approaches | Leetcode 1190 |codestorywithMIK</video:title><video:description>Reverse Substrings Between Each Pair of Parentheses | 2 Approaches | Leetcode 1190 |codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/dUQRS4luBvA</video:player_loc><video:duration>2155</video:duration><video:publication_date>2024-07-11T05:18:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/check-if-word-is-valid-after-substitutions-leetcode-1717</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/WTAjAcjSTqM/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Score From Removing Substrings | 2 Approaches | With Proof | Leetcode 1717</video:title><video:description>Maximum Score From Removing Substrings | 2 Approaches | With Proof | Leetcode 1717. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/WTAjAcjSTqM</video:player_loc><video:duration>2433</video:duration><video:publication_date>2024-07-12T10:44:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/robot-collisions-leetcode-2751</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/fkcA9zvP7_w/hqdefault.jpg</video:thumbnail_loc><video:title>Robot Collisions | Made Easy | Dry Run | Leetcode 2751 | codestorywithMIK</video:title><video:description>Robot Collisions | Made Easy | Dry Run | Leetcode 2751 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/fkcA9zvP7_w</video:player_loc><video:duration>2130</video:duration><video:publication_date>2024-07-13T07:41:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/number-of-atoms-leetcode-726</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/XnVWIT47H0Y/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Atoms | Made Easy | Full Dry Run | Leetcode 726 | Google | codestorywithMIK</video:title><video:description>Number of Atoms | Made Easy | Full Dry Run | Leetcode 726 | Google | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/XnVWIT47H0Y</video:player_loc><video:duration>2287</video:duration><video:publication_date>2024-07-14T03:51:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/minimum-deletions-to-make-string-balanced-leetcode-1653</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/gorAMHTwDfU/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Deletions to Make String Balanced | Multiple Approaches | Leetcode 1653 | codestorywithMIK</video:title><video:description>Minimum Deletions to Make String Balanced | Multiple Approaches | Leetcode 1653 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/gorAMHTwDfU</video:player_loc><video:duration>2040</video:duration><video:publication_date>2024-07-30T02:56:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/minimum-number-of-swaps-to-make-the-string-balanced-leetcode-1963</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/W61jIP-O8lw/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Number of Swaps to Make the String Balanced | Reason | Leetcode 1963 | codestorywithMIK</video:title><video:description>Minimum Number of Swaps to Make the String Balanced | Reason | Leetcode 1963 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/W61jIP-O8lw</video:player_loc><video:duration>1089</video:duration><video:publication_date>2024-10-08T04:08:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/minimum-add-to-make-parentheses-valid-leetcode-921</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/lIdHFWyIrYE/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Add to Make Parentheses Valid | Simple Intuition | Leetcode 921 | codestorywithMIK</video:title><video:description>Minimum Add to Make Parentheses Valid | Simple Intuition | Leetcode 921 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/lIdHFWyIrYE</video:player_loc><video:duration>563</video:duration><video:publication_date>2024-10-09T03:32:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/parsing-a-boolean-expression-leetcode-1106</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/AXfTSqFUopw/hqdefault.jpg</video:thumbnail_loc><video:title>Parsing A Boolean Expression | Cleanest Explanation | Dry Run | Leetcode 1106 | codestorywithMIK</video:title><video:description>Parsing A Boolean Expression | Cleanest Explanation | Dry Run | Leetcode 1106 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/AXfTSqFUopw</video:player_loc><video:duration>1156</video:duration><video:publication_date>2024-10-20T06:04:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/check-if-a-parentheses-string-can-be-valid-leetcode-2116</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Xw8SkHIu2bI/hqdefault.jpg</video:thumbnail_loc><video:title>Check if a Parentheses String Can Be Valid | Detailed Intuition | 2 Approaches | Leetcode 2116 | MIK</video:title><video:description>Check if a Parentheses String Can Be Valid | Detailed Intuition | 2 Approaches | Leetcode 2116 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Xw8SkHIu2bI</video:player_loc><video:duration>3174</video:duration><video:publication_date>2025-01-12T06:59:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/remove-all-occurrences-of-a-substring-leetcode-1910</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/v6_q_fu1ev0/hqdefault.jpg</video:thumbnail_loc><video:title>Remove All Occurrences of a Substring | 3 Approaches | Leetcode 1910 | codestorywithMIK</video:title><video:description>Remove All Occurrences of a Substring | 3 Approaches | Leetcode 1910 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/v6_q_fu1ev0</video:player_loc><video:duration>1206</video:duration><video:publication_date>2025-02-11T02:22:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/replace-non-coprime-numbers-in-array-leetcode-2197</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ll-m8RR7EcU/hqdefault.jpg</video:thumbnail_loc><video:title>Replace Non-Coprime Numbers in Array | Simple Intuition | Leetcode 2197 | codestorywithMIK</video:title><video:description>Replace Non-Coprime Numbers in Array | Simple Intuition | Leetcode 2197 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ll-m8RR7EcU</video:player_loc><video:duration>1196</video:duration><video:publication_date>2025-09-16T06:53:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/minimum-operations-to-convert-all-elements-to-zero-leetcode-3542</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Q1OSaRRkEcs/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Operations to Convert All Elements to Zero | Brute Force | Optimal | Leetcode 3542 | MIK</video:title><video:description>Minimum Operations to Convert All Elements to Zero | Brute Force | Optimal | Leetcode 3542 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Q1OSaRRkEcs</video:player_loc><video:duration>2197</video:duration><video:publication_date>2025-11-10T05:37:41.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/score-of-parentheses-leetcode-856</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/PGMGftedbZY/hqdefault.jpg</video:thumbnail_loc><video:title>Score of Parentheses | 2 Simple Intuitions | Leetcode 856 | codestorywithMIK</video:title><video:description>Score of Parentheses | 2 Simple Intuitions | Leetcode 856 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/PGMGftedbZY</video:player_loc><video:duration>1514</video:duration><video:publication_date>2026-10-05T04:10:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/maximum-nesting-depth-of-the-parentheses-leetcode-1614</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/uzP77oJVLos/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Nesting Depth of the Parentheses | 2 Approaches | Leetcode 1614 | codestorywithMIK</video:title><video:description>Maximum Nesting Depth of the Parentheses | 2 Approaches | Leetcode 1614 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/uzP77oJVLos</video:player_loc><video:duration>1009</video:duration><video:publication_date>2024-04-04T01:16:38.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/crawler-log-folder-leetcode-1598</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/xAI0hcwzuuE/hqdefault.jpg</video:thumbnail_loc><video:title>Crawler Log Folder | 2 Approaches | Dry Runs | Leetcode 1598 | codestorywithMIK</video:title><video:description>Crawler Log Folder | 2 Approaches | Dry Runs | Leetcode 1598 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/xAI0hcwzuuE</video:player_loc><video:duration>902</video:duration><video:publication_date>2024-07-10T01:16:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/final-prices-with-a-special-discount-in-a-shop-leetcode-1475</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/y5CZ7LhqSAU/hqdefault.jpg</video:thumbnail_loc><video:title>Final Prices With a Special Discount in a Shop | Something to learn |Leetcode 1475 |codestorywithMIK</video:title><video:description>Final Prices With a Special Discount in a Shop | Something to learn |Leetcode 1475 |codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/y5CZ7LhqSAU</video:player_loc><video:duration>1461</video:duration><video:publication_date>2024-12-18T03:59:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/stack/clear-digits-leetcode-3174</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/WI9PhnDxAik/hqdefault.jpg</video:thumbnail_loc><video:title>Clear Digits | 4 Detailed Approaches | Leetcode 3174 | codestorywithMIK</video:title><video:description>Clear Digits | 4 Detailed Approaches | Leetcode 3174 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/WI9PhnDxAik</video:player_loc><video:duration>1711</video:duration><video:publication_date>2025-02-10T01:48:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/queue/reverse-first-k-elements-of-queue</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/2fA9-uhVliY/hqdefault.jpg</video:thumbnail_loc><video:title>Reverse First K elements of Queue | Simple | Intuitive | Amazon | GfG POTD</video:title><video:description>Reverse First K elements of Queue | Simple | Intuitive | Amazon | GfG POTD. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/2fA9-uhVliY</video:player_loc><video:duration>812</video:duration><video:publication_date>2024-01-12T05:40:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/queue/reveal-cards-in-increasing-order-leetcode-950</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/S6MGVmkMz2c/hqdefault.jpg</video:thumbnail_loc><video:title>Reveal Cards In Increasing Order  | 2 Approaches | Leetcode 950 | codestorywithMIK</video:title><video:description>Reveal Cards In Increasing Order  | 2 Approaches | Leetcode 950 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/S6MGVmkMz2c</video:player_loc><video:duration>2236</video:duration><video:publication_date>2024-04-10T03:07:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/introduction</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/pfb1Zduesi8/hqdefault.jpg</video:thumbnail_loc><video:title>Introduction | Recursion Concepts And Questions | Video 1</video:title><video:description>Introduction | Recursion Concepts And Questions | Video 1. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/pfb1Zduesi8</video:player_loc><video:duration>400</video:duration><video:publication_date>2024-02-05T11:11:41.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/recursion-leap-of-faith</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/V2xavUKCdyY/hqdefault.jpg</video:thumbnail_loc><video:title>Recursion Leap Of Faith | Examples | Recursion Concepts And Questions | Video 2</video:title><video:description>Recursion Leap Of Faith | Examples | Recursion Concepts And Questions | Video 2. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/V2xavUKCdyY</video:player_loc><video:duration>687</video:duration><video:publication_date>2024-02-05T11:12:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/recursion-tree</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/THStJiQAyD4/hqdefault.jpg</video:thumbnail_loc><video:title>Recursion Tree | Call Stack | Recursion Concepts And Questions | Video 3</video:title><video:description>Recursion Tree | Call Stack | Recursion Concepts And Questions | Video 3. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/THStJiQAyD4</video:player_loc><video:duration>1206</video:duration><video:publication_date>2024-02-05T11:12:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/time-complexity</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/eWXLxn4JbZA/hqdefault.jpg</video:thumbnail_loc><video:title>Time Complexity | Space Complexity | Examples | Recursion Concepts And Questions | Video 4</video:title><video:description>Time Complexity | Space Complexity | Examples | Recursion Concepts And Questions | Video 4. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/eWXLxn4JbZA</video:player_loc><video:duration>1668</video:duration><video:publication_date>2024-02-05T11:50:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/tail-recursion</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YtxlDPr4kso/hqdefault.jpg</video:thumbnail_loc><video:title>Tail Recursion | Tail call Optimisation | Examples | Recursion Concepts And Questions | Video 5</video:title><video:description>Tail Recursion | Tail call Optimisation | Examples | Recursion Concepts And Questions | Video 5. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YtxlDPr4kso</video:player_loc><video:duration>1125</video:duration><video:publication_date>2024-02-05T14:41:39.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/reverse-a-stack</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/aDQeF8Izv5I/hqdefault.jpg</video:thumbnail_loc><video:title>Reverse a Stack | O(n) Auxiliary Space | O(1) Auxiliary Space | Video 6</video:title><video:description>Reverse a Stack | O(n) Auxiliary Space | O(1) Auxiliary Space | Video 6. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/aDQeF8Izv5I</video:player_loc><video:duration>1631</video:duration><video:publication_date>2024-02-06T01:04:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/tower-of-hanoi</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/FfUE6gtqOB4/hqdefault.jpg</video:thumbnail_loc><video:title>Tower Of Hanoi | Simple Story | Story To Code | Recursion Concepts And Questions | Video 7</video:title><video:description>Tower Of Hanoi | Simple Story | Story To Code | Recursion Concepts And Questions | Video 7. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/FfUE6gtqOB4</video:player_loc><video:duration>1514</video:duration><video:publication_date>2024-02-07T01:53:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/merge-sort</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/-cQxPZfYDWs/hqdefault.jpg</video:thumbnail_loc><video:title>Merge Sort | Simple Story | Story To Code | Recursion Concepts And Questions | Video 8</video:title><video:description>Merge Sort | Simple Story | Story To Code | Recursion Concepts And Questions | Video 8. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/-cQxPZfYDWs</video:player_loc><video:duration>2137</video:duration><video:publication_date>2024-02-08T12:51:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/quick-sort</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/4eEWCQveqk8/hqdefault.jpg</video:thumbnail_loc><video:title>Quick Sort | Simple Story | Story To Code | Recursion Concepts And Questions | Video 9</video:title><video:description>Quick Sort | Simple Story | Story To Code | Recursion Concepts And Questions | Video 9. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/4eEWCQveqk8</video:player_loc><video:duration>2861</video:duration><video:publication_date>2024-02-13T13:00:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/rat-in-a-maze-problem</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/wXwZSytYrIs/hqdefault.jpg</video:thumbnail_loc><video:title>Rat in a Maze Problem  | Simple Story To Code | Recursion Concepts And Questions | Video 11</video:title><video:description>Rat in a Maze Problem  | Simple Story To Code | Recursion Concepts And Questions | Video 11. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/wXwZSytYrIs</video:player_loc><video:duration>2450</video:duration><video:publication_date>2024-02-15T16:57:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/flatten-bst-to-sorted-list</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/NzXtnzQTouk/hqdefault.jpg</video:thumbnail_loc><video:title>Flatten BST to sorted list | Magic Of Recursion | Recursion Concepts And Questions | Video 12</video:title><video:description>Flatten BST to sorted list | Magic Of Recursion | Recursion Concepts And Questions | Video 12. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/NzXtnzQTouk</video:player_loc><video:duration>1445</video:duration><video:publication_date>2024-02-16T16:00:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/flattening-a-linked-list</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Q05ZTiqgBtw/hqdefault.jpg</video:thumbnail_loc><video:title>Flattening a Linked List | Magic Of Recursion | Recursion Concepts And Questions | Video 13</video:title><video:description>Flattening a Linked List | Magic Of Recursion | Recursion Concepts And Questions | Video 13. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Q05ZTiqgBtw</video:player_loc><video:duration>1379</video:duration><video:publication_date>2024-02-19T07:44:39.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/n-queens-leetcode-51</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/FOY49yQcbQ4/hqdefault.jpg</video:thumbnail_loc><video:title>N-Queens | 2 Approaches | Super Detailed | Magic Of Recursion | Recursion Concepts And Questions</video:title><video:description>N-Queens | 2 Approaches | Super Detailed | Magic Of Recursion | Recursion Concepts And Questions. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/FOY49yQcbQ4</video:player_loc><video:duration>3997</video:duration><video:publication_date>2024-02-23T07:10:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/generate-parentheses-leetcode-22</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/7xkPbffc6w8/hqdefault.jpg</video:thumbnail_loc><video:title>Generate Parentheses | 2 Approaches | Magic Of Recursion | Recursion Concepts And Questions</video:title><video:description>Generate Parentheses | 2 Approaches | Magic Of Recursion | Recursion Concepts And Questions. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/7xkPbffc6w8</video:player_loc><video:duration>2384</video:duration><video:publication_date>2024-02-25T15:48:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/power-set</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/tp9Y2AqBk6s/hqdefault.jpg</video:thumbnail_loc><video:title>Power Set | Same as Subsets | Magic Of Recursion | Recursion Concepts And Questions</video:title><video:description>Power Set | Same as Subsets | Magic Of Recursion | Recursion Concepts And Questions. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/tp9Y2AqBk6s</video:player_loc><video:duration>789</video:duration><video:publication_date>2024-02-27T07:32:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/permutations-ii-leetcode-47</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Vd2YizhbN74/hqdefault.jpg</video:thumbnail_loc><video:title>Permutations II | Two Approaches | Detailed | Recursion Concepts And Questions</video:title><video:description>Permutations II | Two Approaches | Detailed | Recursion Concepts And Questions. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Vd2YizhbN74</video:player_loc><video:duration>2411</video:duration><video:publication_date>2024-02-28T15:48:49.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/subsets-leetcode-78</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/p4bP_FIXGWw/hqdefault.jpg</video:thumbnail_loc><video:title>Subsets | Simple Story To Code | Leetcode 78 | Recursion Concepts And Questions | Video 17</video:title><video:description>Subsets | Simple Story To Code | Leetcode 78 | Recursion Concepts And Questions | Video 17. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/p4bP_FIXGWw</video:player_loc><video:duration>1325</video:duration><video:publication_date>2024-02-14T07:37:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/regular-expression-matching-leetcode-10</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/3vbBrl-LeDc/hqdefault.jpg</video:thumbnail_loc><video:title>Regular Expression Matching | Brute Force | Optimal | Recursion Concepts And Questions</video:title><video:description>Regular Expression Matching | Brute Force | Optimal | Recursion Concepts And Questions. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/3vbBrl-LeDc</video:player_loc><video:duration>3264</video:duration><video:publication_date>2024-03-12T15:05:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/k-th-symbol-in-grammar-leetcode-779</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Cw7A8YU0WjY/hqdefault.jpg</video:thumbnail_loc><video:title>K-th Symbol in Grammar | Recursion | Recurrence Relation Explained | GOOGLE | Leetcode - 779</video:title><video:description>K-th Symbol in Grammar | Recursion | Recurrence Relation Explained | GOOGLE | Leetcode - 779. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Cw7A8YU0WjY</video:player_loc><video:duration>1774</video:duration><video:publication_date>2023-10-25T04:39:55.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/construct-string-from-binary-tree-leetcode-606</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/KZLMac8vUVw/hqdefault.jpg</video:thumbnail_loc><video:title>Construct String from Binary Tree | Amazon | Leetcode 606</video:title><video:description>Construct String from Binary Tree | Amazon | Leetcode 606. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/KZLMac8vUVw</video:player_loc><video:duration>992</video:duration><video:publication_date>2023-12-08T06:40:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/find-the-winner-of-the-circular-game-leetcode-1823</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/lq3RMxKST-Y/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Winner of the Circular Game | 3 Approaches | Leetcode 1823 | codestorywithMIK</video:title><video:description>Find the Winner of the Circular Game | 3 Approaches | Leetcode 1823 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/lq3RMxKST-Y</video:player_loc><video:duration>2074</video:duration><video:publication_date>2024-07-08T04:55:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/integer-to-english-words-leetcode-273</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9FLpWWJ987w/hqdefault.jpg</video:thumbnail_loc><video:title>Integer to English Words | Story To Code | Leetcode 273 | codestorywithMIK</video:title><video:description>Integer to English Words | Story To Code | Leetcode 273 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9FLpWWJ987w</video:player_loc><video:duration>2304</video:duration><video:publication_date>2024-08-07T03:21:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/different-ways-to-add-parentheses-leetcode-241</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/vWW67t_a--8/hqdefault.jpg</video:thumbnail_loc><video:title>Different Ways to Add Parentheses | Simple Story To Code | Leetcode 241 | codestorywithMIK</video:title><video:description>Different Ways to Add Parentheses | Simple Story To Code | Leetcode 241 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/vWW67t_a--8</video:player_loc><video:duration>1305</video:duration><video:publication_date>2024-09-19T05:51:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/lexicographical-numbers-leetcode-386</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/vuS3US_bDBo/hqdefault.jpg</video:thumbnail_loc><video:title>Lexicographical Numbers | Simple DFS | Leetcode 386 | codestorywithMIK</video:title><video:description>Lexicographical Numbers | Simple DFS | Leetcode 386 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/vuS3US_bDBo</video:player_loc><video:duration>975</video:duration><video:publication_date>2024-09-21T05:55:13.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/k-th-smallest-in-lexicographical-order-leetcode-440</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/pQ_BQ9J9p-c/hqdefault.jpg</video:thumbnail_loc><video:title>K-th Smallest in Lexicographical Order | Super Detailed | Dry Run | Leetcode 440 | codestorywithMIK</video:title><video:description>K-th Smallest in Lexicographical Order | Super Detailed | Dry Run | Leetcode 440 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/pQ_BQ9J9p-c</video:player_loc><video:duration>2579</video:duration><video:publication_date>2024-09-22T07:13:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/find-the-k-th-character-in-string-game-ii-leetcode-3307</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/JlpjAjsA03o/hqdefault.jpg</video:thumbnail_loc><video:title>Find the K-th Character in String Game II | Recursion | Dry Run | Leetcode 3307 | codestorywithMIK</video:title><video:description>Find the K-th Character in String Game II | Recursion | Dry Run | Leetcode 3307 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/JlpjAjsA03o</video:player_loc><video:duration>1882</video:duration><video:publication_date>2024-09-29T17:58:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/find-the-k-th-character-in-string-game-ii-leetcode-1545</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/z4gmEqrhrkE/hqdefault.jpg</video:thumbnail_loc><video:title>Find Kth Bit in Nth Binary String | Detailed Recursion | Dry Run | Leetcode 1545 | codestorywithMIK</video:title><video:description>Find Kth Bit in Nth Binary String | Detailed Recursion | Dry Run | Leetcode 1545 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/z4gmEqrhrkE</video:player_loc><video:duration>1492</video:duration><video:publication_date>2024-10-19T07:35:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/find-the-punishment-number-of-an-integer-leetcode-2698</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/SmnRAvkkohA/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Punishment Number of an Integer | Multiple Ways | Dry Run |Leetcode 2698 | codestorywithMIK</video:title><video:description>Find the Punishment Number of an Integer | Multiple Ways | Dry Run |Leetcode 2698 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/SmnRAvkkohA</video:player_loc><video:duration>2785</video:duration><video:publication_date>2025-02-15T04:55:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/the-earliest-and-latest-rounds-where-players-compete-leetcode-1900</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/NnfyGypen1w/hqdefault.jpg</video:thumbnail_loc><video:title>The Earliest and Latest Rounds Where Players Compete | Detailed Intuition | Leetcode 1900 | MIK</video:title><video:description>The Earliest and Latest Rounds Where Players Compete | Detailed Intuition | Leetcode 1900 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/NnfyGypen1w</video:player_loc><video:duration>3490</video:duration><video:publication_date>2025-07-12T16:37:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/special-binary-string-leetcode-761</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/EJ4hBpyYGDM/hqdefault.jpg</video:thumbnail_loc><video:title>Special Binary String | Detailed Intuition | Dry Run | Leetcode 761 | codestorywithMIK</video:title><video:description>Special Binary String | Detailed Intuition | Dry Run | Leetcode 761 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/EJ4hBpyYGDM</video:player_loc><video:duration>2077</video:duration><video:publication_date>2026-02-20T03:07:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/recursion/brace-expansion-ii-leetcode-1096</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/0WEQ2tC5EJo/hqdefault.jpg</video:thumbnail_loc><video:title>Brace Expansion II | Super Detailed | Story To Code | Leetcode 1096 | Google | codestorywithMIK</video:title><video:description>Brace Expansion II | Super Detailed | Story To Code | Leetcode 1096 | Google | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/0WEQ2tC5EJo</video:player_loc><video:duration>2696</video:duration><video:publication_date>2026-09-25T06:33:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/backtracking/word-search-leetcode-79</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/whyax_vB8xY/hqdefault.jpg</video:thumbnail_loc><video:title>Word Search | In Depth Explanation | Apple | Amazon | Microsoft | codestorywithMIK</video:title><video:description>Word Search | In Depth Explanation | Apple | Amazon | Microsoft | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/whyax_vB8xY</video:player_loc><video:duration>1102</video:duration><video:publication_date>2022-11-24T04:03:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/backtracking/unique-paths-iii-leetcode-980</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/eagGLroZXMk/hqdefault.jpg</video:thumbnail_loc><video:title>Unique Paths III -(Apple, Amazon, Microsoft, Intuit) : Explanation ➕ Live Coding</video:title><video:description>Unique Paths III -(Apple, Amazon, Microsoft, Intuit) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/eagGLroZXMk</video:player_loc><video:duration>1836</video:duration><video:publication_date>2022-12-31T06:38:43.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/backtracking/non-decreasing-subsequences-leetcode-491</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8dfPwZvvDc8/hqdefault.jpg</video:thumbnail_loc><video:title>Non-decreasing Subsequences | Khaandani Backtracking Template |   Explanation | Live Coding</video:title><video:description>Non-decreasing Subsequences | Khaandani Backtracking Template |   Explanation | Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8dfPwZvvDc8</video:player_loc><video:duration>1782</video:duration><video:publication_date>2023-01-20T08:30:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/backtracking/palindrome-partitioning-leetcode-131</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/jHR7KUAAEzw/hqdefault.jpg</video:thumbnail_loc><video:title>Palindrome Partitioning | Backtracking | Khaandani Template | Leetcode 131 | codestorywithMIK</video:title><video:description>Palindrome Partitioning | Backtracking | Khaandani Template | Leetcode 131 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/jHR7KUAAEzw</video:player_loc><video:duration>1525</video:duration><video:publication_date>2023-01-22T08:41:58.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/backtracking/fair-distribution-of-cookies-leetcode-2305</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/vcaAC2fqFpk/hqdefault.jpg</video:thumbnail_loc><video:title>Fair Distribution of Cookies | Khandani Backtracking Template | Leetcode-2305 | Explanation | Coding</video:title><video:description>Fair Distribution of Cookies | Khandani Backtracking Template | Leetcode-2305 | Explanation | Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/vcaAC2fqFpk</video:player_loc><video:duration>931</video:duration><video:publication_date>2023-07-01T10:50:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/backtracking/maximum-number-of-achievable-transfer-requests-leetcode-1601</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/eY4PHr1DPp0/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Number of Achievable Transfer Requests | Khandani Backtracking Template | Leetcode-1601</video:title><video:description>Maximum Number of Achievable Transfer Requests | Khandani Backtracking Template | Leetcode-1601. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/eY4PHr1DPp0</video:player_loc><video:duration>1184</video:duration><video:publication_date>2023-07-02T17:30:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/backtracking/combination-sum-leetcode-77</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QQ9Tn2i269I/hqdefault.jpg</video:thumbnail_loc><video:title>Combinations | INTUITIVE | Backtracking Template | Two Ways | Similar Problems | Leetcode-77</video:title><video:description>Combinations | INTUITIVE | Backtracking Template | Two Ways | Similar Problems | Leetcode-77. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QQ9Tn2i269I</video:player_loc><video:duration>1117</video:duration><video:publication_date>2023-08-01T03:36:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/backtracking/subsets-leetcode-46</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/T8hqjK94Fig/hqdefault.jpg</video:thumbnail_loc><video:title>Permutations | INTUITIVE | Backtracking Template | Two Ways | Similar Problems | Leetcode 46</video:title><video:description>Permutations | INTUITIVE | Backtracking Template | Two Ways | Similar Problems | Leetcode 46. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/T8hqjK94Fig</video:player_loc><video:duration>2196</video:duration><video:publication_date>2023-08-02T04:22:13.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/backtracking/binary-watch-leetcode-17</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/vgnhZzw-kfU/hqdefault.jpg</video:thumbnail_loc><video:title>Letter Combinations of a Phone Number | INTUITIVE | Backtracking Template | Leetcode-17</video:title><video:description>Letter Combinations of a Phone Number | INTUITIVE | Backtracking Template | Leetcode-17. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/vgnhZzw-kfU</video:player_loc><video:duration>1361</video:duration><video:publication_date>2023-08-03T03:58:56.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/backtracking/combination-sum-leetcode-377</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YyuwTwXzSxY/hqdefault.jpg</video:thumbnail_loc><video:title>Combination Sum IV | 2 Ways | DRY RUN | Tree Diagram | GOOGLE | SNAPCHAT | META | Leetcode - 377</video:title><video:description>Combination Sum IV | 2 Ways | DRY RUN | Tree Diagram | GOOGLE | SNAPCHAT | META | Leetcode - 377. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YyuwTwXzSxY</video:player_loc><video:duration>1338</video:duration><video:publication_date>2023-09-09T06:23:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/backtracking/find-the-minimum-cost-array-permutation-leetcode-3149</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/l4B7HTwfNn0/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Minimum Cost Array Permutation | Tree Diagram | Backtrack | Leetcode 3149 |codestorywithMIK</video:title><video:description>Find the Minimum Cost Array Permutation | Tree Diagram | Backtrack | Leetcode 3149 |codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/l4B7HTwfNn0</video:player_loc><video:duration>2072</video:duration><video:publication_date>2024-05-12T15:40:39.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/backtracking/path-with-maximum-gold-leetcode-1219</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/qlgeXDM1z7A/hqdefault.jpg</video:thumbnail_loc><video:title>Path with Maximum Gold | Simplest Explanation | Leetcode 1219 | codestorywithMIK</video:title><video:description>Path with Maximum Gold | Simplest Explanation | Leetcode 1219 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/qlgeXDM1z7A</video:player_loc><video:duration>1319</video:duration><video:publication_date>2024-05-14T01:53:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/backtracking/the-number-of-beautiful-subsets-leetcode-2597</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/RoEzdG1bB9s/hqdefault.jpg</video:thumbnail_loc><video:title>The Number of Beautiful Subsets | Backtracking | Khaandani Template | Leetcode 2597|codestorywithMIK</video:title><video:description>The Number of Beautiful Subsets | Backtracking | Khaandani Template | Leetcode 2597|codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/RoEzdG1bB9s</video:player_loc><video:duration>867</video:duration><video:publication_date>2024-05-23T04:45:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/backtracking/maximum-score-words-formed-by-letters-leetcode-1255</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Vn2eno9OIpc/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Score Words Formed by Letters | Why Backtracking | Why Greedy Fails | Leetcode 1255</video:title><video:description>Maximum Score Words Formed by Letters | Why Backtracking | Why Greedy Fails | Leetcode 1255. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Vn2eno9OIpc</video:player_loc><video:duration>1812</video:duration><video:publication_date>2024-05-24T03:48:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/backtracking/word-break-ii-leetcode-140</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/TmkRMtbXVPw/hqdefault.jpg</video:thumbnail_loc><video:title>Word Break II | 2 Recursion Approaches | Backtracking | Memoization | Tree Diagram | Leetcode 140</video:title><video:description>Word Break II | 2 Recursion Approaches | Backtracking | Memoization | Tree Diagram | Leetcode 140. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/TmkRMtbXVPw</video:player_loc><video:duration>2306</video:duration><video:publication_date>2024-05-25T05:47:58.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/backtracking/combination-sum-ii-leetcode-40</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/bfKwLi6jtDk/hqdefault.jpg</video:thumbnail_loc><video:title>Combination Sum II | Simple Khandani Template | Leetcode 40 | codestorywithMIK</video:title><video:description>Combination Sum II | Simple Khandani Template | Leetcode 40 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/bfKwLi6jtDk</video:player_loc><video:duration>1570</video:duration><video:publication_date>2024-08-13T03:34:25.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/backtracking/split-a-string-into-the-max-number-of-unique-substrings-leetcode-1593</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/sTzh1L7BkQA/hqdefault.jpg</video:thumbnail_loc><video:title>Split a String Into the Max Number of Unique Substrings | Khandani Template | Dry Run |Leetcode 1593</video:title><video:description>Split a String Into the Max Number of Unique Substrings | Khandani Template | Dry Run |Leetcode 1593. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/sTzh1L7BkQA</video:player_loc><video:duration>1707</video:duration><video:publication_date>2024-10-21T05:02:57.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/backtracking/construct-the-lexicographically-largest-valid-sequence-leetcode-1718</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/wNOZM1Ki4DY/hqdefault.jpg</video:thumbnail_loc><video:title>Construct the Lexicographically Largest Valid Sequence | Detailed | Leetcode 1718 | codestorywithMIK</video:title><video:description>Construct the Lexicographically Largest Valid Sequence | Detailed | Leetcode 1718 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/wNOZM1Ki4DY</video:player_loc><video:duration>2259</video:duration><video:publication_date>2025-02-16T04:33:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/backtracking/letter-tile-possibilities-leetcode-1079</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/cD0D-QSKG20/hqdefault.jpg</video:thumbnail_loc><video:title>Letter Tile Possibilities | 2 Ways | Using Standard Template | Leetcode 1079 | codestorywithMIK</video:title><video:description>Letter Tile Possibilities | 2 Ways | Using Standard Template | Leetcode 1079 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/cD0D-QSKG20</video:player_loc><video:duration>1764</video:duration><video:publication_date>2025-02-17T04:22:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/backtracking/the-k-th-lexicographical-string-of-all-happy-strings-of-leetcode-1415</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/sQ1gHiDtcXg/hqdefault.jpg</video:thumbnail_loc><video:title>The k-th Lexicographical String of All Happy Strings of Length n | Leetcode 1415 | codestorywithMIK</video:title><video:description>The k-th Lexicographical String of All Happy Strings of Length n | Leetcode 1415 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/sQ1gHiDtcXg</video:player_loc><video:duration>2125</video:duration><video:publication_date>2025-02-19T02:27:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/backtracking/longest-subsequence-repeated-k-times-leetcode-2014</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Kc4eUX-heL4/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Subsequence Repeated k Times | 2 Ways To Code | Detailed | Leetcode 2014 | codestorywithMIK</video:title><video:description>Longest Subsequence Repeated k Times | 2 Ways To Code | Detailed | Leetcode 2014 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Kc4eUX-heL4</video:player_loc><video:duration>2895</video:duration><video:publication_date>2025-06-27T07:16:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/backtracking/24-game-leetcode-679</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/mmu3_8n0fVM/hqdefault.jpg</video:thumbnail_loc><video:title>24 Game | Simple Intuition | Something to learn | Leetcode 679 | Google | codestorywithMIK</video:title><video:description>24 Game | Simple Intuition | Something to learn | Leetcode 679 | Google | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/mmu3_8n0fVM</video:player_loc><video:duration>2367</video:duration><video:publication_date>2025-08-18T12:25:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/backtracking/sudoku-solver-leetcode-37</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5g6fheUtjRs/hqdefault.jpg</video:thumbnail_loc><video:title>Sudoku Solver | Simple Explanation | Leetcode 37 | codestorywithMIK</video:title><video:description>Sudoku Solver | Simple Explanation | Leetcode 37 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5g6fheUtjRs</video:player_loc><video:duration>1597</video:duration><video:publication_date>2025-08-31T04:12:21.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/backtracking/pyramid-transition-matrix-leetcode-756</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/dWlpBUZDQc0/hqdefault.jpg</video:thumbnail_loc><video:title>Pyramid Transition Matrix | Detailed Intuition | Beginner Friendly | Dry Runs | Leetcode 756 | MIK</video:title><video:description>Pyramid Transition Matrix | Detailed Intuition | Beginner Friendly | Dry Runs | Leetcode 756 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/dWlpBUZDQc0</video:player_loc><video:duration>2445</video:duration><video:publication_date>2025-12-29T05:53:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/backtracking/remove-invalid-parentheses-leetcode-301</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/mSsS9kXoWJI/hqdefault.jpg</video:thumbnail_loc><video:title>Remove Invalid Parentheses | Detailed | Simplified | Intuition | Leetcode 301 | codestorywithMIK</video:title><video:description>Remove Invalid Parentheses | Detailed | Simplified | Intuition | Leetcode 301 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/mSsS9kXoWJI</video:player_loc><video:duration>1533</video:duration><video:publication_date>2026-10-07T05:55:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/construct-quad-tree-leetcode-427</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/tzABQFpl6Mk/hqdefault.jpg</video:thumbnail_loc><video:title>Construct Quad Tree (Leetcode - 427) - (Google) : Explanation ➕ Live Coding</video:title><video:description>Construct Quad Tree (Leetcode - 427) - (Google) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/tzABQFpl6Mk</video:player_loc><video:duration>1716</video:duration><video:publication_date>2023-02-27T05:21:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/time-needed-to-inform-all-employees-leetcode-1376</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/4fiZOJpis9g/hqdefault.jpg</video:thumbnail_loc><video:title>Time Needed to Inform All Employees | DFS | BFS | AMAZON | Leetcode-1376 | Live Code</video:title><video:description>Time Needed to Inform All Employees | DFS | BFS | AMAZON | Leetcode-1376 | Live Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/4fiZOJpis9g</video:player_loc><video:duration>1496</video:duration><video:publication_date>2023-06-03T06:47:55.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/binary-tree-right-side-view-leetcode-199</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/-Qs1T_xfzLo/hqdefault.jpg</video:thumbnail_loc><video:title>Binary Tree Right Side View | BFS | Amazon | Accolite | Flipkart | Live Coding</video:title><video:description>Binary Tree Right Side View | BFS | Amazon | Accolite | Flipkart | Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/-Qs1T_xfzLo</video:player_loc><video:duration>645</video:duration><video:publication_date>2022-07-13T00:30:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/binary-leetcode-199</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/IZ1asDkWg34/hqdefault.jpg</video:thumbnail_loc><video:title>Binary Tree Right Side View | DFS | Amazon | Leetcode 199</video:title><video:description>Binary Tree Right Side View | DFS | Amazon | Leetcode 199. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/IZ1asDkWg34</video:player_loc><video:duration>562</video:duration><video:publication_date>2022-07-13T23:30:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/construct-binary-tree-from-preorder-and-inorder-traversal-leetcode-105</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/G5c1wM3Kpuw/hqdefault.jpg</video:thumbnail_loc><video:title>Construct Binary Tree From Preorder And Inorder Traversal | Leetcode 105 | codestorywithMIK</video:title><video:description>Construct Binary Tree From Preorder And Inorder Traversal | Leetcode 105 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/G5c1wM3Kpuw</video:player_loc><video:duration>1467</video:duration><video:publication_date>2022-07-16T00:00:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/lowest-common-ancestor-of-a-binary-tree-leetcode-236</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Oi3_06ultic/hqdefault.jpg</video:thumbnail_loc><video:title>Lowest Common Ancestor of a Binary Tree | Leetcode 236 | Microsoft | Amazon | codestorywithMIK</video:title><video:description>Lowest Common Ancestor of a Binary Tree | Leetcode 236 | Microsoft | Amazon | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Oi3_06ultic</video:player_loc><video:duration>1004</video:duration><video:publication_date>2022-07-27T23:30:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/check-completeness-of-a-binary-tree-leetcode-958</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/08e5EBHoXxE/hqdefault.jpg</video:thumbnail_loc><video:title>Check Completeness of a Binary Tree (BFS) - (Meta, Amazon) : Explanation ➕ Live Coding</video:title><video:description>Check Completeness of a Binary Tree (BFS) - (Meta, Amazon) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/08e5EBHoXxE</video:player_loc><video:duration>771</video:duration><video:publication_date>2022-08-04T23:30:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/check-completeness-of-a-binary-tree-leetcode-958-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5zyG8Nw9V78/hqdefault.jpg</video:thumbnail_loc><video:title>Check Completeness of a Binary Tree (DFS) - (Meta, Amazon) : Explanation ➕ Live Coding</video:title><video:description>Check Completeness of a Binary Tree (DFS) - (Meta, Amazon) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5zyG8Nw9V78</video:player_loc><video:duration>739</video:duration><video:publication_date>2022-08-05T23:30:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/delete-nodes-and-return-forest-leetcode-1110</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/z-pX53sYwWI/hqdefault.jpg</video:thumbnail_loc><video:title>Delete Nodes And Return Forest Solved | Simple Approach | Google | Leetcode 1110 | codestorywithMIK</video:title><video:description>Delete Nodes And Return Forest Solved | Simple Approach | Google | Leetcode 1110 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/z-pX53sYwWI</video:player_loc><video:duration>924</video:duration><video:publication_date>2022-08-14T02:30:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/find-leaves-of-binary-tree-leetcode-366</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/g-gaAYSyt3Q/hqdefault.jpg</video:thumbnail_loc><video:title>Find Leaves Of Binary Tree | Google Onsite 2022 | Amazon | codestorywithMIK</video:title><video:description>Find Leaves Of Binary Tree | Google Onsite 2022 | Amazon | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/g-gaAYSyt3Q</video:player_loc><video:duration>1065</video:duration><video:publication_date>2022-08-21T11:00:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/binary-tree-pruning-leetcode-814</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/bzQIbtlnBW0/hqdefault.jpg</video:thumbnail_loc><video:title>Binary Tree Pruning | O(n^2) |  Google | Amazon | Microsoft | Simple Explanation | codestorywithMIK</video:title><video:description>Binary Tree Pruning | O(n^2) |  Google | Amazon | Microsoft | Simple Explanation | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/bzQIbtlnBW0</video:player_loc><video:duration>1008</video:duration><video:publication_date>2022-09-17T14:18:38.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/binary-tree-pruning-leetcode-814-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/vV5oRkBWHo4/hqdefault.jpg</video:thumbnail_loc><video:title>Binary Tree Pruning (O(n))- (Google, Amazon, Microsoft) : Explanation + Live Coding 🧑🏻‍💻👩🏻‍💻</video:title><video:description>Binary Tree Pruning (O(n))- (Google, Amazon, Microsoft) : Explanation + Live Coding 🧑🏻‍💻👩🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/vV5oRkBWHo4</video:player_loc><video:duration>360</video:duration><video:publication_date>2022-09-17T14:42:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/path-sum-ii-leetcode-113</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/eoyO8hOkPNs/hqdefault.jpg</video:thumbnail_loc><video:title>Path Sum II | Bloomberg | LinkedIn | Amazon | Bloomberg | Quora | Leetcode 113</video:title><video:description>Path Sum II | Bloomberg | LinkedIn | Amazon | Bloomberg | Quora | Leetcode 113. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/eoyO8hOkPNs</video:player_loc><video:duration>758</video:duration><video:publication_date>2022-09-25T00:30:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/path-sum-leetcode-112</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/7jIWcMDxT28/hqdefault.jpg</video:thumbnail_loc><video:title>Path Sum - (Amazon, Microsoft, Accolite, Adobe...) : Explanation + Live Coding 🧑🏻‍💻👩🏻‍💻</video:title><video:description>Path Sum - (Amazon, Microsoft, Accolite, Adobe...) : Explanation + Live Coding 🧑🏻‍💻👩🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/7jIWcMDxT28</video:player_loc><video:duration>633</video:duration><video:publication_date>2022-09-29T00:30:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/add-one-row-to-tree-leetcode-623</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Za2OFfRLp70/hqdefault.jpg</video:thumbnail_loc><video:title>Add One Row to Tree | Made Super Easy | Google | Leetcode 623 | codestorywithMIK</video:title><video:description>Add One Row to Tree | Made Super Easy | Google | Leetcode 623 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Za2OFfRLp70</video:player_loc><video:duration>908</video:duration><video:publication_date>2022-10-05T05:39:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/count-complete-tree-nodes-leetcode-222</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/2XTXL7a6ItI/hqdefault.jpg</video:thumbnail_loc><video:title>Count Complete Tree Nodes -(Amazon, Microsoft, Salesforce, Meta) : Explanation ➕ Live Coding</video:title><video:description>Count Complete Tree Nodes -(Amazon, Microsoft, Salesforce, Meta) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/2XTXL7a6ItI</video:player_loc><video:duration>1296</video:duration><video:publication_date>2022-11-15T15:34:58.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/leaf-similar-trees-leetcode-872</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/rlWJlXQNt0Q/hqdefault.jpg</video:thumbnail_loc><video:title>Leaf-Similar Trees | Simple Recursion | Story | Microsoft | Meta | Leetcode 872</video:title><video:description>Leaf-Similar Trees | Simple Recursion | Story | Microsoft | Meta | Leetcode 872. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/rlWJlXQNt0Q</video:player_loc><video:duration>488</video:duration><video:publication_date>2022-12-08T04:19:45.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/maximum-difference-between-node-and-ancestor-leetcode-1026</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/cvekQzmBdcs/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Difference Between Node and Ancestor | Brute Force | Optimal | Google | Leetcode 1026</video:title><video:description>Maximum Difference Between Node and Ancestor | Brute Force | Optimal | Google | Leetcode 1026. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/cvekQzmBdcs</video:player_loc><video:duration>2123</video:duration><video:publication_date>2022-12-09T05:53:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/maximum-product-of-splitted-binary-tree-leetcode-1339</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ITySQXe9Ybg/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Product of Splitted Binary Tree | Simple Intuition | Leetcode 1339 | codestorywithMIK</video:title><video:description>Maximum Product of Splitted Binary Tree | Simple Intuition | Leetcode 1339 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ITySQXe9Ybg</video:player_loc><video:duration>1784</video:duration><video:publication_date>2022-12-10T04:20:45.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/binary-tree-maximum-path-sum-leetcode-124</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Op6YFcs8R9M/hqdefault.jpg</video:thumbnail_loc><video:title>Binary Tree Maximum Path Sum - (Google, Meta, Amazon, Flipkart) : Explanation ➕ Live Coding</video:title><video:description>Binary Tree Maximum Path Sum - (Google, Meta, Amazon, Flipkart) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Op6YFcs8R9M</video:player_loc><video:duration>1595</video:duration><video:publication_date>2022-12-11T06:22:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/binary-tree-preorder-traversal-microsoft-walmart-flipkart-amazon-explanation</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/GFOlLFUxvNs/hqdefault.jpg</video:thumbnail_loc><video:title>Binary Tree Preorder Traversal - (Microsoft, Walmart, Flipkart, Amazon) : Explanation ➕ Live Coding</video:title><video:description>Binary Tree Preorder Traversal - (Microsoft, Walmart, Flipkart, Amazon) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/GFOlLFUxvNs</video:player_loc><video:duration>157</video:duration><video:publication_date>2023-01-09T07:43:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/same-tree-leetcode-100</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YtoibyDlzk0/hqdefault.jpg</video:thumbnail_loc><video:title>Same Tree | DFS | BFS | Google | Leetcode 100</video:title><video:description>Same Tree | DFS | BFS | Google | Leetcode 100. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YtoibyDlzk0</video:player_loc><video:duration>858</video:duration><video:publication_date>2023-01-10T04:51:53.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/find-duplicate-subtrees-leetcode-652</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/m0dG99f5ct4/hqdefault.jpg</video:thumbnail_loc><video:title>Find Duplicate Subtrees (Leetcode - 652) - (GOOGLE) : Explanation ➕ Live Coding</video:title><video:description>Find Duplicate Subtrees (Leetcode - 652) - (GOOGLE) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/m0dG99f5ct4</video:player_loc><video:duration>851</video:duration><video:publication_date>2023-02-28T09:43:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/symmetric-tree-leetcode-101</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/lHLW1L8Qc5w/hqdefault.jpg</video:thumbnail_loc><video:title>Symmetric Tree (Leetcode - 101) - (Amazon, Microsoft, Mentor (Siemens)) : Explanation ➕ Live Coding</video:title><video:description>Symmetric Tree (Leetcode - 101) - (Amazon, Microsoft, Mentor (Siemens)) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/lHLW1L8Qc5w</video:player_loc><video:duration>607</video:duration><video:publication_date>2023-03-13T04:05:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/sum-root-to-leaf-numbers-leetcode-129</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/KTwkq-MsJDw/hqdefault.jpg</video:thumbnail_loc><video:title>Sum Root to Leaf Numbers | Leetcode - 129 | Google | Microsoft | Meta | Explanation | Live Coding</video:title><video:description>Sum Root to Leaf Numbers | Leetcode - 129 | Google | Microsoft | Meta | Explanation | Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/KTwkq-MsJDw</video:player_loc><video:duration>762</video:duration><video:publication_date>2023-03-14T11:52:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/construct-binary-tree-from-inorder-and-postorder-traversal-leetcode-106</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/y6zSY_z7Kh4/hqdefault.jpg</video:thumbnail_loc><video:title>Construct Binary Tree from Inorder and Postorder Traversal | Leetcode 106 | codestorywithMIK</video:title><video:description>Construct Binary Tree from Inorder and Postorder Traversal | Leetcode 106 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/y6zSY_z7Kh4</video:player_loc><video:duration>1538</video:duration><video:publication_date>2023-03-16T07:15:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/longest-zigzag-path-in-a-binary-tree-leetcode-1372</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/bAO794rh_4M/hqdefault.jpg</video:thumbnail_loc><video:title>Longest ZigZag Path in a Binary Tree - | Leetcode-1372 | MICROSOFT | Explanation + Live Code</video:title><video:description>Longest ZigZag Path in a Binary Tree - | Leetcode-1372 | MICROSOFT | Explanation + Live Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/bAO794rh_4M</video:player_loc><video:duration>1512</video:duration><video:publication_date>2023-04-19T05:11:55.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/maximum-width-of-binary-tree-leetcode-662</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/hwjd0U36MUE/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Width of Binary Tree | Leetcode 662 | Flipkart | Amazon | Explanation | Live Code</video:title><video:description>Maximum Width of Binary Tree | Leetcode 662 | Flipkart | Amazon | Explanation | Live Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/hwjd0U36MUE</video:player_loc><video:duration>1013</video:duration><video:publication_date>2023-04-20T09:04:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/maximum-level-sum-of-a-binary-tree-leetcode-1161</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/GWCVpTCSIFY/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Level Sum of a Binary Tree | Leetcode 1161 | AMAZON | codestorywithMIK</video:title><video:description>Maximum Level Sum of a Binary Tree | Leetcode 1161 | AMAZON | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/GWCVpTCSIFY</video:player_loc><video:duration>1201</video:duration><video:publication_date>2023-06-15T03:54:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/minimum-depth-of-binary-tree-leetcode-111</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/uCvur520ejA/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Depth of Binary Tree | Leetcode-111 | BFS | DFS | AMAZON | Explanation ➕ Live Coding</video:title><video:description>Minimum Depth of Binary Tree | Leetcode-111 | BFS | DFS | AMAZON | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/uCvur520ejA</video:player_loc><video:duration>708</video:duration><video:publication_date>2023-07-10T13:01:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/all-nodes-distance-k-in-binary-tree-leetcode-863</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/1PMjfQl_UVQ/hqdefault.jpg</video:thumbnail_loc><video:title>All Nodes Distance K in Binary Tree | Approach-1 | Leetcode-863 | AMAZON | Explanation ➕ Live Coding</video:title><video:description>All Nodes Distance K in Binary Tree | Approach-1 | Leetcode-863 | AMAZON | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/1PMjfQl_UVQ</video:player_loc><video:duration>1319</video:duration><video:publication_date>2023-07-11T11:15:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/validate-binary-tree-nodes-leetcode-1361</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/JlQEoNs263o/hqdefault.jpg</video:thumbnail_loc><video:title>Validate Binary Tree Nodes | Using Binary Tree Properties | BFS | META | Leetcode - 1361</video:title><video:description>Validate Binary Tree Nodes | Using Binary Tree Properties | BFS | META | Leetcode - 1361. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/JlQEoNs263o</video:player_loc><video:duration>1482</video:duration><video:publication_date>2023-10-17T10:55:13.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/find-largest-value-in-each-tree-row-leetcode-515</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/iBaccPOzD-w/hqdefault.jpg</video:thumbnail_loc><video:title>Find Largest Value in Each Tree Row | DFS | BFS | META | Leetcode - 515</video:title><video:description>Find Largest Value in Each Tree Row | DFS | BFS | META | Leetcode - 515. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/iBaccPOzD-w</video:player_loc><video:duration>1373</video:duration><video:publication_date>2023-10-24T05:36:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/count-nodes-equal-to-average-of-subtree-leetcode-2265</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Y4UGaLpSqCg/hqdefault.jpg</video:thumbnail_loc><video:title>Count Nodes Equal to Average of Subtree | 2 Approaches | Leetcode 2265 | codestorywithMIK</video:title><video:description>Count Nodes Equal to Average of Subtree | 2 Approaches | Leetcode 2265 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Y4UGaLpSqCg</video:player_loc><video:duration>1453</video:duration><video:publication_date>2023-11-02T03:24:18.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/binary-tree-inorder-traversal-leetcode-94</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Wq3ibaP4dJY/hqdefault.jpg</video:thumbnail_loc><video:title>Binary Tree Inorder Traversal | Morris Traversal | Leetcode-94</video:title><video:description>Binary Tree Inorder Traversal | Morris Traversal | Leetcode-94. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Wq3ibaP4dJY</video:player_loc><video:duration>914</video:duration><video:publication_date>2023-12-09T14:36:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/amount-of-time-for-binary-tree-to-be-infected-leetcode-2385</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/JIlQvhrKuAk/hqdefault.jpg</video:thumbnail_loc><video:title>Amount of Time for Binary Tree to Be Infected | Using BFS | Leetcode 2385</video:title><video:description>Amount of Time for Binary Tree to Be Infected | Using BFS | Leetcode 2385. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/JIlQvhrKuAk</video:player_loc><video:duration>1765</video:duration><video:publication_date>2024-01-10T04:33:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/amount-of-time-for-binary-tree-to-be-infected-leetcode-2385-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Xm8jIjAK_Zs/hqdefault.jpg</video:thumbnail_loc><video:title>Amount of Time for Binary Tree to Be Infected | Using DFS | One Pass | Leetcode 2385</video:title><video:description>Amount of Time for Binary Tree to Be Infected | Using DFS | One Pass | Leetcode 2385. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Xm8jIjAK_Zs</video:player_loc><video:duration>2475</video:duration><video:publication_date>2024-01-10T14:50:48.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/distribute-coins-in-binary-tree-leetcode-979</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/FmHxY2104hc/hqdefault.jpg</video:thumbnail_loc><video:title>Distribute Coins in Binary Tree | Distribute candies in a binary tree | Leetcode 979 | GFG</video:title><video:description>Distribute Coins in Binary Tree | Distribute candies in a binary tree | Leetcode 979 | GFG. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/FmHxY2104hc</video:player_loc><video:duration>1581</video:duration><video:publication_date>2024-01-20T12:35:38.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/paths-from-root-with-a-specified-sum</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Nrdm2a5gsr8/hqdefault.jpg</video:thumbnail_loc><video:title>Paths from root with a specified sum | Simple | Story To Code | GfG POTD</video:title><video:description>Paths from root with a specified sum | Simple | Story To Code | GfG POTD. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Nrdm2a5gsr8</video:player_loc><video:duration>678</video:duration><video:publication_date>2024-01-22T13:52:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/pseudo-palindromic-paths-in-a-binary-tree-leetcode-1457</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/FK-Fztwj2gM/hqdefault.jpg</video:thumbnail_loc><video:title>Pseudo-Palindromic Paths in a Binary Tree | 2 Ways | Bit Magic | Leetcode 1457</video:title><video:description>Pseudo-Palindromic Paths in a Binary Tree | 2 Ways | Bit Magic | Leetcode 1457. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/FK-Fztwj2gM</video:player_loc><video:duration>1601</video:duration><video:publication_date>2024-01-24T04:47:53.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/count-the-nodes-at-distance-k-from-leaf</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Lzvqu8WPNh8/hqdefault.jpg</video:thumbnail_loc><video:title>Count the nodes at distance K from leaf | 2 Approaches | Simple Dry Run | GFG POTD</video:title><video:description>Count the nodes at distance K from leaf | 2 Approaches | Simple Dry Run | GFG POTD. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Lzvqu8WPNh8</video:player_loc><video:duration>2750</video:duration><video:publication_date>2024-02-06T09:28:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/diameter-of-binary-tree-leetcode-543</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/15KwRECEXLU/hqdefault.jpg</video:thumbnail_loc><video:title>Diameter of Binary Tree | Simple Story | Amazon | Leetcode 543</video:title><video:description>Diameter of Binary Tree | Simple Story | Amazon | Leetcode 543. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/15KwRECEXLU</video:player_loc><video:duration>1178</video:duration><video:publication_date>2024-02-27T03:11:56.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/find-bottom-left-tree-value-leetcode-513</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YnabMptoE0I/hqdefault.jpg</video:thumbnail_loc><video:title>Find Bottom Left Tree Value | 3 Approaches | Simple Story | Microsoft | Leetcode 513</video:title><video:description>Find Bottom Left Tree Value | 3 Approaches | Simple Story | Microsoft | Leetcode 513. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YnabMptoE0I</video:player_loc><video:duration>1432</video:duration><video:publication_date>2024-02-28T03:04:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/even-odd-tree-leetcode-1609</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ai7zemxYjz4/hqdefault.jpg</video:thumbnail_loc><video:title>Even Odd Tree | DFS | BFS | Leetcode 1609</video:title><video:description>Even Odd Tree | DFS | BFS | Leetcode 1609. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ai7zemxYjz4</video:player_loc><video:duration>2437</video:duration><video:publication_date>2024-02-29T03:28:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/smallest-string-starting-from-leaf-leetcode-988</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/SX7dC8htok0/hqdefault.jpg</video:thumbnail_loc><video:title>Smallest String Starting From Leaf | DFS | BFS | Google | Leetcode 988 | codestorywithMIK</video:title><video:description>Smallest String Starting From Leaf | DFS | BFS | Google | Leetcode 988 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/SX7dC8htok0</video:player_loc><video:duration>1537</video:duration><video:publication_date>2024-04-17T02:55:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/delete-leaves-with-a-given-value-leetcode-1325</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/OzueBIOLJ44/hqdefault.jpg</video:thumbnail_loc><video:title>Delete Leaves With a Given Value | Simple Story To Code | Leetcode 1325 | codestorywithMIK</video:title><video:description>Delete Leaves With a Given Value | Simple Story To Code | Leetcode 1325 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/OzueBIOLJ44</video:player_loc><video:duration>762</video:duration><video:publication_date>2024-05-17T01:58:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/create-binary-tree-from-descriptions-leetcode-2196</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Rt2prDOV2hU/hqdefault.jpg</video:thumbnail_loc><video:title>Create Binary Tree From Descriptions | Simplest Approach | Leetcode 2196 | codestorywithMIK</video:title><video:description>Create Binary Tree From Descriptions | Simplest Approach | Leetcode 2196 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Rt2prDOV2hU</video:player_loc><video:duration>1154</video:duration><video:publication_date>2024-07-15T03:15:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/step-by-step-directions-from-a-binary-tree-node-to-another-leetcode-2096</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/6GXfmgfOGeQ/hqdefault.jpg</video:thumbnail_loc><video:title>Step-By-Step Directions From a Binary Tree Node to Another | 2 Approaches | Leetcode 2096</video:title><video:description>Step-By-Step Directions From a Binary Tree Node to Another | 2 Approaches | Leetcode 2096. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/6GXfmgfOGeQ</video:player_loc><video:duration>2045</video:duration><video:publication_date>2024-07-16T02:54:53.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/number-of-good-leaf-nodes-pairs-leetcode-1530</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/vrbJ7aDuK-A/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Good Leaf Nodes Pairs | Using Graph And BFS | Dry Run | Leetcode 1530 | codestorywithMIK</video:title><video:description>Number of Good Leaf Nodes Pairs | Using Graph And BFS | Dry Run | Leetcode 1530 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/vrbJ7aDuK-A</video:player_loc><video:duration>1735</video:duration><video:publication_date>2024-07-18T03:42:23.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/number-of-good-leaf-nodes-pairs-leetcode-1530-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/AW-gpXiR5DQ/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Good Leaf Nodes Pairs | Simple DFS | Dry Run | Leetcode 1530 | codestorywithMIK</video:title><video:description>Number of Good Leaf Nodes Pairs | Simple DFS | Dry Run | Leetcode 1530 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/AW-gpXiR5DQ</video:player_loc><video:duration>1890</video:duration><video:publication_date>2024-07-19T12:44:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/linked-list-in-binary-tree-leetcode-1367</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Ypzg7G3kg5A/hqdefault.jpg</video:thumbnail_loc><video:title>Linked List in Binary Tree | Easy | Dry Run | Leetcode 1367 | codestorywithMIK</video:title><video:description>Linked List in Binary Tree | Easy | Dry Run | Leetcode 1367 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Ypzg7G3kg5A</video:player_loc><video:duration>1258</video:duration><video:publication_date>2024-09-07T05:06:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/cousins-in-binary-tree-ii-leetcode-2641</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/UIrargaZ61M/hqdefault.jpg</video:thumbnail_loc><video:title>Cousins in Binary Tree II | 2 Detailed Approaches | Dry Run | Leetcode 2641 | codestorywithMIK</video:title><video:description>Cousins in Binary Tree II | 2 Detailed Approaches | Dry Run | Leetcode 2641 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/UIrargaZ61M</video:player_loc><video:duration>2135</video:duration><video:publication_date>2024-10-23T06:39:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/flip-equivalent-binary-trees-leetcode-951</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ePTZbVoJ6FI/hqdefault.jpg</video:thumbnail_loc><video:title>Flip Equivalent Binary Trees | Simple Recursion | Dry Run | Leetcode 951 | codestorywithMIK</video:title><video:description>Flip Equivalent Binary Trees | Simple Recursion | Dry Run | Leetcode 951 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ePTZbVoJ6FI</video:player_loc><video:duration>1423</video:duration><video:publication_date>2024-10-24T02:42:48.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/height-of-binary-tree-after-subtree-removal-queries-leetcode-2458</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/eEfW7CLbhvU/hqdefault.jpg</video:thumbnail_loc><video:title>Height of Binary Tree After Subtree Removal Queries |Thought Process|Leetcode 2458| codestorywithMIK</video:title><video:description>Height of Binary Tree After Subtree Removal Queries |Thought Process|Leetcode 2458| codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/eEfW7CLbhvU</video:player_loc><video:duration>2480</video:duration><video:publication_date>2024-10-26T06:34:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/reverse-odd-levels-of-binary-tree-leetcode-2415</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/kHckQekd-LU/hqdefault.jpg</video:thumbnail_loc><video:title>Reverse Odd Levels of Binary Tree | Detailed | DFS | BFS | Leetcode 2415 | codestorywithMIK</video:title><video:description>Reverse Odd Levels of Binary Tree | Detailed | DFS | BFS | Leetcode 2415 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/kHckQekd-LU</video:player_loc><video:duration>2114</video:duration><video:publication_date>2024-12-20T06:34:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/minimum-number-of-operations-to-sort-a-binary-tree-by-level-leetcode-2471</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/u_IE2W_FEPk/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Number of Operations to Sort a Binary Tree by Level | Leetcode 2471 | codestorywithMIK</video:title><video:description>Minimum Number of Operations to Sort a Binary Tree by Level | Leetcode 2471 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/u_IE2W_FEPk</video:player_loc><video:duration>1476</video:duration><video:publication_date>2024-12-23T07:46:25.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/find-elements-in-a-contaminated-binary-tree-leetcode-1261</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/abqFdXyeAxA/hqdefault.jpg</video:thumbnail_loc><video:title>Find Elements in a Contaminated Binary Tree | BFS | DFS | Leetcode 1261 | codestorywithMIK</video:title><video:description>Find Elements in a Contaminated Binary Tree | BFS | DFS | Leetcode 1261 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/abqFdXyeAxA</video:player_loc><video:duration>783</video:duration><video:publication_date>2025-02-21T01:56:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/recover-a-tree-from-preorder-traversal-leetcode-1028</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/WN0quIK89F0/hqdefault.jpg</video:thumbnail_loc><video:title>Recover a Tree From Preorder Traversal | Easy DFS Simulation | Leetcode 1028 | codestorywithMIK</video:title><video:description>Recover a Tree From Preorder Traversal | Easy DFS Simulation | Leetcode 1028 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/WN0quIK89F0</video:player_loc><video:duration>1606</video:duration><video:publication_date>2025-02-22T05:56:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/construct-binary-tree-from-preorder-and-postorder-traversal-leetcode-889</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/6JDV3kIFyjU/hqdefault.jpg</video:thumbnail_loc><video:title>Construct Binary Tree from Preorder and Postorder Traversal | Leetcode 889 | codestorywithMIK</video:title><video:description>Construct Binary Tree from Preorder and Postorder Traversal | Leetcode 889 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/6JDV3kIFyjU</video:player_loc><video:duration>2391</video:duration><video:publication_date>2025-02-23T04:47:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/lowest-common-ancestor-of-deepest-leaves-leetcode-1123</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ylpPcln87hI/hqdefault.jpg</video:thumbnail_loc><video:title>Lowest Common Ancestor of Deepest Leaves | Smallest Subtree with all the Deepest Nodes | 1123 | 865</video:title><video:description>Lowest Common Ancestor of Deepest Leaves | Smallest Subtree with all the Deepest Nodes | 1123 | 865. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ylpPcln87hI</video:player_loc><video:duration>2545</video:duration><video:publication_date>2025-04-04T08:31:55.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/sum-of-left-leaves-leetcode-404</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/DOyWdDRzoS4/hqdefault.jpg</video:thumbnail_loc><video:title>Sum of Left Leaves | 2 Approaches | META | Leetcode 404 | codestorywithMIK</video:title><video:description>Sum of Left Leaves | 2 Approaches | META | Leetcode 404 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/DOyWdDRzoS4</video:player_loc><video:duration>1189</video:duration><video:publication_date>2024-04-14T01:51:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/evaluate-boolean-binary-tree-leetcode-2331</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/PeNJKq_8pEM/hqdefault.jpg</video:thumbnail_loc><video:title>Evaluate Boolean Binary Tree | Simple Story To Code | Leetcode 2331 | codestorywithMIK</video:title><video:description>Evaluate Boolean Binary Tree | Simple Story To Code | Leetcode 2331 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/PeNJKq_8pEM</video:player_loc><video:duration>539</video:duration><video:publication_date>2024-05-16T02:35:45.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/balanced-binary-tree-leetcode-110</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/w8qXEQkCQO0/hqdefault.jpg</video:thumbnail_loc><video:title>Balanced Binary Tree | Simple Clean Approach | Leetcode 110 | codestorywithMIK</video:title><video:description>Balanced Binary Tree | Simple Clean Approach | Leetcode 110 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/w8qXEQkCQO0</video:player_loc><video:duration>1005</video:duration><video:publication_date>2026-02-08T02:12:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/trees/sum-of-root-to-leaf-binary-numbers-leetcode-1022</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/W8gDFqsMinM/hqdefault.jpg</video:thumbnail_loc><video:title>Sum of Root To Leaf Binary Numbers | Simple Approach | Dry Run | Leetcode 1022 | MIK</video:title><video:description>Sum of Root To Leaf Binary Numbers | Simple Approach | Dry Run | Leetcode 1022 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/W8gDFqsMinM</video:player_loc><video:duration>852</video:duration><video:publication_date>2026-02-24T01:15:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search-trees/range-sum-of-bst-leetcode-938</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/qIFhQ2m6i64/hqdefault.jpg</video:thumbnail_loc><video:title>Range Sum of BST | Simple Story Recursion | Google | Leetcode 938</video:title><video:description>Range Sum of BST | Simple Story Recursion | Google | Leetcode 938. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/qIFhQ2m6i64</video:player_loc><video:duration>870</video:duration><video:publication_date>2022-12-07T06:02:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search-trees/minimum-absolute-difference-in-bst-leetcode-530</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/yNvt9ejf9Ec/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Absolute Difference in BST | Leetcode-530 | GOOGLE | Explanation ➕ Live Coding</video:title><video:description>Minimum Absolute Difference in BST | Leetcode-530 | GOOGLE | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/yNvt9ejf9Ec</video:player_loc><video:duration>1082</video:duration><video:publication_date>2023-06-14T04:31:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search-trees/find-mode-in-binary-search-tree-leetcode-501</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/tYoq7CMJP4A/hqdefault.jpg</video:thumbnail_loc><video:title>Find Mode in Binary Search Tree | 2 Approaches | Follow Up | Leetcode-501 | GOOGLE</video:title><video:description>Find Mode in Binary Search Tree | 2 Approaches | Follow Up | Leetcode-501 | GOOGLE. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/tYoq7CMJP4A</video:player_loc><video:duration>1077</video:duration><video:publication_date>2023-11-01T06:06:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search-trees/binary-search-tree-to-greater-sum-tree-leetcode-1038</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8YuKhynQaqA/hqdefault.jpg</video:thumbnail_loc><video:title>Binary Search Tree to Greater Sum Tree | Brute | Better | Optimal | Leetcode 1038 | codestorywithMIK</video:title><video:description>Binary Search Tree to Greater Sum Tree | Brute | Better | Optimal | Leetcode 1038 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8YuKhynQaqA</video:player_loc><video:duration>1658</video:duration><video:publication_date>2024-06-25T02:47:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/binary-search-trees/balance-a-binary-search-tree-leetcode-1382</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/wHzpM_u7p0s/hqdefault.jpg</video:thumbnail_loc><video:title>Balance a Binary Search Tree | Simple Explanation | Leetcode 1382 | codestorywithMIK</video:title><video:description>Balance a Binary Search Tree | Simple Explanation | Leetcode 1382 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/wHzpM_u7p0s</video:player_loc><video:duration>851</video:duration><video:publication_date>2024-06-26T01:25:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/introduction</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/TZwPVMyG8-M/hqdefault.jpg</video:thumbnail_loc><video:title>Introduction | Top K from Sorted Structures Pattern | Concepts &amp; Questions - 1 | codestorywithMIK</video:title><video:description>Introduction | Top K from Sorted Structures Pattern | Concepts &amp; Questions - 1 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/TZwPVMyG8-M</video:player_loc><video:duration>1791</video:duration><video:publication_date>2026-06-09T22:30:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/exercise-problem</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5lqfRcmhZJs/hqdefault.jpg</video:thumbnail_loc><video:title>Exercise Problem | Top K from Sorted Structures Pattern | Concepts &amp; Questions - 2 | MIK</video:title><video:description>Exercise Problem | Top K from Sorted Structures Pattern | Concepts &amp; Questions - 2 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5lqfRcmhZJs</video:player_loc><video:duration>454</video:duration><video:publication_date>2026-06-09T22:45:23.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/merge-k-sorted-lists-leetcode-23</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/WtsbSJybOnM/hqdefault.jpg</video:thumbnail_loc><video:title>Merge k Sorted Lists | Leetcode 23 | Top K from Sorted Structures Pattern | Concepts &amp; Questions - 3</video:title><video:description>Merge k Sorted Lists | Leetcode 23 | Top K from Sorted Structures Pattern | Concepts &amp; Questions - 3. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/WtsbSJybOnM</video:player_loc><video:duration>1632</video:duration><video:publication_date>2026-06-09T23:30:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/maximum-total-subarray-value-ii-leetcode-3691</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/7L-0oxtqEGw/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Total Subarray Value II | Leetcode 3691 | Top K from Sorted Structures Pattern | Concepts 4</video:title><video:description>Maximum Total Subarray Value II | Leetcode 3691 | Top K from Sorted Structures Pattern | Concepts 4. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/7L-0oxtqEGw</video:player_loc><video:duration>3443</video:duration><video:publication_date>2026-06-10T08:13:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/find-median-from-data-stream-leetcode-295</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/jnj87BSi9Is/hqdefault.jpg</video:thumbnail_loc><video:title>Find Median from Data Stream | Detailed Explanation | Leetcode 295 | codestorywithMIK</video:title><video:description>Find Median from Data Stream | Detailed Explanation | Leetcode 295 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/jnj87BSi9Is</video:player_loc><video:duration>2204</video:duration><video:publication_date>2022-11-12T07:14:34.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/sort-characters-by-frequency-leetcode-451</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/HwCYa1_2vkU/hqdefault.jpg</video:thumbnail_loc><video:title>Sort Characters By Frequency | Heap | Leetcode 451</video:title><video:description>Sort Characters By Frequency | Heap | Leetcode 451. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/HwCYa1_2vkU</video:player_loc><video:duration>1013</video:duration><video:publication_date>2022-12-03T09:32:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/remove-stones-to-minimize-the-total-leetcode-1962</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/uodyPJ8zUVc/hqdefault.jpg</video:thumbnail_loc><video:title>Remove Stones to Minimize the Total (Google, Miscrosoft, Netflix, Meta) : Explanation ➕ Live Coding</video:title><video:description>Remove Stones to Minimize the Total (Google, Miscrosoft, Netflix, Meta) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/uodyPJ8zUVc</video:player_loc><video:duration>1010</video:duration><video:publication_date>2022-12-28T06:53:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/single-threaded-cpu-leetcode-1834</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9zRXNLbl0FI/hqdefault.jpg</video:thumbnail_loc><video:title>Single-Threaded CPU | Detailed Explanation | Google | Live Coding</video:title><video:description>Single-Threaded CPU | Detailed Explanation | Google | Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9zRXNLbl0FI</video:player_loc><video:duration>2341</video:duration><video:publication_date>2022-12-29T09:13:47.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/last-stone-weight-leetcode-1046</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/GBzie2ETYQg/hqdefault.jpg</video:thumbnail_loc><video:title>Last Stone Weight | 2 Approaches | GOOGLE | AMAZON | Leetcode 1046</video:title><video:description>Last Stone Weight | 2 Approaches | GOOGLE | AMAZON | Leetcode 1046. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/GBzie2ETYQg</video:player_loc><video:duration>951</video:duration><video:publication_date>2023-04-24T07:48:23.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/top-k-frequent-elements-leetcode-347</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/GLw4WbJdYLw/hqdefault.jpg</video:thumbnail_loc><video:title>Top K Frequent Elements | Heap | Bucket Sort | AMAZON | Leetcode 347 | Explanation | Live Coding</video:title><video:description>Top K Frequent Elements | Heap | Bucket Sort | AMAZON | Leetcode 347 | Explanation | Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/GLw4WbJdYLw</video:player_loc><video:duration>1637</video:duration><video:publication_date>2023-05-22T07:09:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/kth-largest-element-in-a-stream-leetcode-703</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/3Bge5OCcXUk/hqdefault.jpg</video:thumbnail_loc><video:title>Kth Largest Element in a Stream | Heap | AMAZON | Leetcode-703 | Explanation ➕ Live Coding 🧑🏻‍💻</video:title><video:description>Kth Largest Element in a Stream | Heap | AMAZON | Leetcode-703 | Explanation ➕ Live Coding 🧑🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/3Bge5OCcXUk</video:player_loc><video:duration>874</video:duration><video:publication_date>2023-05-23T11:42:56.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/maximum-subsequence-score-leetcode-2542</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/z9oUzKhEYJU/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Subsequence Score | Intuition | AMAZON | Leetcode-2542 | Explanation ➕ Live Coding</video:title><video:description>Maximum Subsequence Score | Intuition | AMAZON | Leetcode-2542 | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/z9oUzKhEYJU</video:player_loc><video:duration>2508</video:duration><video:publication_date>2023-05-24T13:17:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/total-cost-to-hire-k-workers-leetcode-2462</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ODuICq8exLo/hqdefault.jpg</video:thumbnail_loc><video:title>Total Cost to Hire K Workers | Using 2 Heap | Dry Run | META | Leetcode-2462 | Live Code</video:title><video:description>Total Cost to Hire K Workers | Using 2 Heap | Dry Run | META | Leetcode-2462 | Live Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ODuICq8exLo</video:player_loc><video:duration>1547</video:duration><video:publication_date>2023-06-26T10:13:53.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/find-k-pairs-with-smallest-sums-leetcode-373</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/eptC4nUL_2A/hqdefault.jpg</video:thumbnail_loc><video:title>Find K Pairs with Smallest Sums | BRUTE FORCE ACCEPTED | GOOGLE | Leetcode-373 | Live Code</video:title><video:description>Find K Pairs with Smallest Sums | BRUTE FORCE ACCEPTED | GOOGLE | Leetcode-373 | Live Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/eptC4nUL_2A</video:player_loc><video:duration>1523</video:duration><video:publication_date>2023-06-27T11:11:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/find-k-pairs-with-smallest-sums-leetcode-373-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/PiGYS7BbV_Q/hqdefault.jpg</video:thumbnail_loc><video:title>Find K Pairs with Smallest Sums | OPTIMAL | GOOGLE | Leetcode-373 | Live Code</video:title><video:description>Find K Pairs with Smallest Sums | OPTIMAL | GOOGLE | Leetcode-373 | Live Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/PiGYS7BbV_Q</video:player_loc><video:duration>1212</video:duration><video:publication_date>2023-06-27T16:48:52.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/kth-largest-element-in-an-array-leetcode-215</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/cI0shWNnB4o/hqdefault.jpg</video:thumbnail_loc><video:title>Kth Largest Element in an Array | Heap | Sorting | 2 Approaches | Time Complexity | Leetcode-215</video:title><video:description>Kth Largest Element in an Array | Heap | Sorting | 2 Approaches | Time Complexity | Leetcode-215. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/cI0shWNnB4o</video:player_loc><video:duration>558</video:duration><video:publication_date>2023-08-14T07:42:38.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/reorganize-string-leetcode-767</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/E3lJDtIHwg4/hqdefault.jpg</video:thumbnail_loc><video:title>Reorganize String | 2 Approaches | Time Complexity | Full Dry Run | TESLA | AMAZON | Leetcode-767</video:title><video:description>Reorganize String | 2 Approaches | Time Complexity | Full Dry Run | TESLA | AMAZON | Leetcode-767. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/E3lJDtIHwg4</video:player_loc><video:duration>2452</video:duration><video:publication_date>2023-08-23T04:56:39.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/task-scheduler-leetcode-621</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/rYh-Kkbzsnw/hqdefault.jpg</video:thumbnail_loc><video:title>Task Scheduler | Easy Intuition | Using Heap | Leetcode 621 | codestorywithMIK</video:title><video:description>Task Scheduler | Easy Intuition | Using Heap | Leetcode 621 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/rYh-Kkbzsnw</video:player_loc><video:duration>1706</video:duration><video:publication_date>2024-03-19T03:28:25.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/k-th-smallest-prime-fraction-leetcode-786</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/92SDuUKAR3s/hqdefault.jpg</video:thumbnail_loc><video:title>K-th Smallest Prime Fraction | Max Heap | Min Heap | Leetcode 786 | codestorywithMIK</video:title><video:description>K-th Smallest Prime Fraction | Max Heap | Min Heap | Leetcode 786 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/92SDuUKAR3s</video:player_loc><video:duration>2306</video:duration><video:publication_date>2024-05-10T06:17:53.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/minimum-cost-to-hire-k-workers-leetcode-857</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/kxR52OB_I8k/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Cost to Hire K Workers | Brute Force | Better | Optimal | Leetcode 857 | codestorywithMIK</video:title><video:description>Minimum Cost to Hire K Workers | Brute Force | Better | Optimal | Leetcode 857 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/kxR52OB_I8k</video:player_loc><video:duration>4335</video:duration><video:publication_date>2024-05-11T08:12:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/lexicographically-minimum-string-after-removing-stars-leetcode-3170</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/-0xkQYTP1I0/hqdefault.jpg</video:thumbnail_loc><video:title>Lexicographically Minimum String After Removing Stars | Easy | Leetcode 3170 | codestorywithMIK</video:title><video:description>Lexicographically Minimum String After Removing Stars | Easy | Leetcode 3170 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/-0xkQYTP1I0</video:player_loc><video:duration>1422</video:duration><video:publication_date>2024-06-02T06:52:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/ipo-leetcode-502</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/b12SZXrZF9I/hqdefault.jpg</video:thumbnail_loc><video:title>IPO | Easy Beginner Friendly | Story To Code | Leetcode 502 | codestorywithMIK</video:title><video:description>IPO | Easy Beginner Friendly | Story To Code | Leetcode 502 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/b12SZXrZF9I</video:player_loc><video:duration>1792</video:duration><video:publication_date>2024-06-15T03:05:21.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/range-sum-of-sorted-subarray-sums-leetcode-1508</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/oMHO5iti5_c/hqdefault.jpg</video:thumbnail_loc><video:title>Range Sum of Sorted Subarray Sums | Learning Something New | Leetcode 1508 | codestorywithMIK</video:title><video:description>Range Sum of Sorted Subarray Sums | Learning Something New | Leetcode 1508 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/oMHO5iti5_c</video:player_loc><video:duration>2131</video:duration><video:publication_date>2024-08-04T07:49:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/smallest-range-covering-elements-from-k-lists-leetcode-632</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/0IqFMBatlhU/hqdefault.jpg</video:thumbnail_loc><video:title>Smallest Range Covering Elements from K Lists | Multiple Ways | Leetcode 632 | codestorywithMIK</video:title><video:description>Smallest Range Covering Elements from K Lists | Multiple Ways | Leetcode 632 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/0IqFMBatlhU</video:player_loc><video:duration>3137</video:duration><video:publication_date>2024-10-13T10:45:18.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/maximal-score-after-applying-k-operations-leetcode-2530</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/t2tBCpzYl6w/hqdefault.jpg</video:thumbnail_loc><video:title>Maximal Score After Applying K Operations | Standard Heap Problem | Leetcode 2530 | codestorywithMIK</video:title><video:description>Maximal Score After Applying K Operations | Standard Heap Problem | Leetcode 2530 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/t2tBCpzYl6w</video:player_loc><video:duration>808</video:duration><video:publication_date>2024-10-14T02:28:45.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/longest-happy-string-leetcode-1405</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/tGzgghQEDdA/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Happy String | Simple Thought Process | Leetcode 1405 | codestorywithMIK</video:title><video:description>Longest Happy String | Simple Thought Process | Leetcode 1405 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/tGzgghQEDdA</video:player_loc><video:duration>1407</video:duration><video:publication_date>2024-10-16T03:26:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/find-score-of-an-array-after-marking-all-elements-leetcode-2593</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/VsMVlAPolXw/hqdefault.jpg</video:thumbnail_loc><video:title>Find Score of an Array After Marking All Elements | 2 Approaches | Leetcode 2593 | codestorywithMIK</video:title><video:description>Find Score of an Array After Marking All Elements | 2 Approaches | Leetcode 2593 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/VsMVlAPolXw</video:player_loc><video:duration>1696</video:duration><video:publication_date>2024-12-13T03:25:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/trapping-rain-water-ii-leetcode-407</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/TzsbIDtTlsQ/hqdefault.jpg</video:thumbnail_loc><video:title>Trapping Rain Water II | Deep Dive Explanation | What | Why | How | Leetcode 407 | codestorywithMIK</video:title><video:description>Trapping Rain Water II | Deep Dive Explanation | What | Why | How | Leetcode 407 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/TzsbIDtTlsQ</video:player_loc><video:duration>3557</video:duration><video:publication_date>2025-01-19T04:38:56.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/minimum-operations-to-exceed-threshold-value-ii-leetcode-3066</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/PVHJh8Gq3js/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Operations to Exceed Threshold Value II |Easy Explanation | Leetcode 3066 | codestorywithMIK</video:title><video:description>Minimum Operations to Exceed Threshold Value II |Easy Explanation | Leetcode 3066 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/PVHJh8Gq3js</video:player_loc><video:duration>930</video:duration><video:publication_date>2025-02-13T01:41:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/choose-k-elements-with-maximum-sum-leetcode-3478</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/c-hV30Ffj6o/hqdefault.jpg</video:thumbnail_loc><video:title>Choose K Elements With Maximum Sum | Brute Force | Optimal Leetcode 3478 | codestorywithMIK</video:title><video:description>Choose K Elements With Maximum Sum | Brute Force | Optimal Leetcode 3478 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/c-hV30Ffj6o</video:player_loc><video:duration>2457</video:duration><video:publication_date>2025-03-09T07:37:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/zero-array-transformation-iii-leetcode-3362</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/nJZ_Ob3VIQs/hqdefault.jpg</video:thumbnail_loc><video:title>Zero Array Transformation III | How to detect topic | How to detect Data Structure | Leetcode 3362</video:title><video:description>Zero Array Transformation III | How to detect topic | How to detect Data Structure | Leetcode 3362. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/nJZ_Ob3VIQs</video:player_loc><video:duration>2794</video:duration><video:publication_date>2025-05-22T14:28:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/minimum-difference-in-sums-after-removal-of-elements-leetcode-2163</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/uURBjheosXU/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Difference in Sums After Removal of Elements | Detailed Explanation | Leetcode 2163 | MIK</video:title><video:description>Minimum Difference in Sums After Removal of Elements | Detailed Explanation | Leetcode 2163 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/uURBjheosXU</video:player_loc><video:duration>2498</video:duration><video:publication_date>2025-07-18T12:08:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/take-gifts-from-the-richest-pile-leetcode-2558</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9uE3blNvJzk/hqdefault.jpg</video:thumbnail_loc><video:title>Take Gifts From the Richest Pile | Simple Explanation | Leetcode 2558 | codestorywithMIK</video:title><video:description>Take Gifts From the Richest Pile | Simple Explanation | Leetcode 2558 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9uE3blNvJzk</video:player_loc><video:duration>1062</video:duration><video:publication_date>2024-12-12T02:10:53.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/final-array-state-after-k-multiplication-operations-i-leetcode-3264</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/fwZcyneQvKE/hqdefault.jpg</video:thumbnail_loc><video:title>Final Array State After K Multiplication Operations I | Detailed | Leetcode 3264 | codestorywithMIK</video:title><video:description>Final Array State After K Multiplication Operations I | Detailed | Leetcode 3264 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/fwZcyneQvKE</video:player_loc><video:duration>1399</video:duration><video:publication_date>2024-12-16T03:24:13.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/heap-priority-queue/find-x-sum-of-all-k-long-subarrays-i-leetcode-3318</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/KCI7u_3iU-s/hqdefault.jpg</video:thumbnail_loc><video:title>Find X-Sum of All K-Long Subarrays I | Revise DSA Fundamentals | Dry Run | Leetcode 3318 | MIK</video:title><video:description>Find X-Sum of All K-Long Subarrays I | Revise DSA Fundamentals | Dry Run | Leetcode 3318 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/KCI7u_3iU-s</video:player_loc><video:duration>1146</video:duration><video:publication_date>2025-11-04T07:02:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/graph-concepts-and-qns-1-graph-will-no-more-be-a-nightmare</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5JGiZnr6B5w/hqdefault.jpg</video:thumbnail_loc><video:title>Graph Concepts &amp; Qns - 1 : Graph will no more be a Nightmare 😴😱🤯</video:title><video:description>Graph Concepts &amp; Qns - 1 : Graph will no more be a Nightmare 😴😱🤯. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5JGiZnr6B5w</video:player_loc><video:duration>441</video:duration><video:publication_date>2022-12-20T20:21:51.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/graph-concepts-and-qns-2-graph-representations</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/o9JvO7MGQPo/hqdefault.jpg</video:thumbnail_loc><video:title>Graph Concepts &amp; Qns - 2 : Graph Representations 😴😱🤯</video:title><video:description>Graph Concepts &amp; Qns - 2 : Graph Representations 😴😱🤯. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/o9JvO7MGQPo</video:player_loc><video:duration>1161</video:duration><video:publication_date>2022-12-22T03:30:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/graph-concepts-and-qns-3-dfs-and-bfs</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/V4xpJNgxMDY/hqdefault.jpg</video:thumbnail_loc><video:title>Graph Concepts &amp; Qns - 3 : DFS &amp; BFS</video:title><video:description>Graph Concepts &amp; Qns - 3 : DFS &amp; BFS. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/V4xpJNgxMDY</video:player_loc><video:duration>1488</video:duration><video:publication_date>2022-12-23T11:35:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/graph-concepts-and-qns-5-microsoft-amazon-flipkart-detect-cycle-in-undirected</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/HqIQmKKo5_I/hqdefault.jpg</video:thumbnail_loc><video:title>Graph Concepts &amp; Qns - 5 (Microsoft, Amazon, Flipkart.) : Detect Cycle in Undirected Graph using BFS</video:title><video:description>Graph Concepts &amp; Qns - 5 (Microsoft, Amazon, Flipkart.) : Detect Cycle in Undirected Graph using BFS. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/HqIQmKKo5_I</video:player_loc><video:duration>928</video:duration><video:publication_date>2022-12-27T07:08:17.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/graph-concepts-and-qns-6</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/K_LamGUvwUc/hqdefault.jpg</video:thumbnail_loc><video:title>Graph Concepts &amp; Qns - 6 | Flipkart, Amazon, Microsoft | Detect Cycle in Directed Graph using DFS</video:title><video:description>Graph Concepts &amp; Qns - 6 | Flipkart, Amazon, Microsoft | Detect Cycle in Directed Graph using DFS. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/K_LamGUvwUc</video:player_loc><video:duration>1393</video:duration><video:publication_date>2022-12-31T15:32:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/graph-concepts-and-qns-7-microsoft-accolite-amazon-flipkart-topological-sort</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/WbbYZRr4arw/hqdefault.jpg</video:thumbnail_loc><video:title>Graph Concepts &amp; Qns - 7 (Microsoft, Accolite, Amazon, Flipkart) : Topological Sort using DFS</video:title><video:description>Graph Concepts &amp; Qns - 7 (Microsoft, Accolite, Amazon, Flipkart) : Topological Sort using DFS. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/WbbYZRr4arw</video:player_loc><video:duration>1565</video:duration><video:publication_date>2023-01-02T14:07:47.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/graph-concepts-and-qns-8</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/uVl4ftleTes/hqdefault.jpg</video:thumbnail_loc><video:title>Graph Concepts &amp; Qns - 8 | Kahn&apos;s Algorithm | Topological Sort using BFS</video:title><video:description>Graph Concepts &amp; Qns - 8 | Kahn&apos;s Algorithm | Topological Sort using BFS. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/uVl4ftleTes</video:player_loc><video:duration>1476</video:duration><video:publication_date>2023-01-03T11:57:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/graph-concepts-and-qns-9-flipkart-amazon-microsoft-detect-cycle-in-directed</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/74suJP4bwf0/hqdefault.jpg</video:thumbnail_loc><video:title>Graph Concepts &amp; Qns - 9 (Flipkart, Amazon, Microsoft...) : Detect Cycle in Directed Graph using BFS</video:title><video:description>Graph Concepts &amp; Qns - 9 (Flipkart, Amazon, Microsoft...) : Detect Cycle in Directed Graph using BFS. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/74suJP4bwf0</video:player_loc><video:duration>707</video:duration><video:publication_date>2023-01-04T13:19:45.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/disjoint-set-union</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/AsAdKHkITBQ/hqdefault.jpg</video:thumbnail_loc><video:title>Disjoint Set Union | DSU | Graph Concepts &amp; Qns - 18 | Explanation+Coding</video:title><video:description>Disjoint Set Union | DSU | Graph Concepts &amp; Qns - 18 | Explanation+Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/AsAdKHkITBQ</video:player_loc><video:duration>1812</video:duration><video:publication_date>2023-01-15T10:37:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/disjoint-set-union-by-rank-and-path-compression</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/iH3XVIVzl7M/hqdefault.jpg</video:thumbnail_loc><video:title>Disjoint Set Union By Rank and Path Compression | DSU | Graph Concepts &amp; Qns -19| Explanation+Code</video:title><video:description>Disjoint Set Union By Rank and Path Compression | DSU | Graph Concepts &amp; Qns -19| Explanation+Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/iH3XVIVzl7M</video:player_loc><video:duration>1329</video:duration><video:publication_date>2023-01-15T14:28:47.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/satisfiability-of-equality-equations-google</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/0Z8lt7U_kiE/hqdefault.jpg</video:thumbnail_loc><video:title>Satisfiability of Equality Equations - (GOOGLE) | Graph Concepts &amp; Qns - 21 | Explanation+Coding</video:title><video:description>Satisfiability of Equality Equations - (GOOGLE) | Graph Concepts &amp; Qns - 21 | Explanation+Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/0Z8lt7U_kiE</video:player_loc><video:duration>1208</video:duration><video:publication_date>2023-03-13T15:43:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/number-of-operations-to-make-network-connected-amazon</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/q2xBd-D_1KQ/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Operations to Make Network Connected - (AMAZON) | Graph Concepts &amp; Qns - 22 | Coding Live</video:title><video:description>Number of Operations to Make Network Connected - (AMAZON) | Graph Concepts &amp; Qns - 22 | Coding Live. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/q2xBd-D_1KQ</video:player_loc><video:duration>1228</video:duration><video:publication_date>2023-03-23T11:49:41.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/minimum-spanning-tree</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/xxvY2UX7YPg/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Spanning Tree | Easy Theory Full Detail | Amazon, Microsoft | Graph Concepts &amp; Qns - 33</video:title><video:description>Minimum Spanning Tree | Easy Theory Full Detail | Amazon, Microsoft | Graph Concepts &amp; Qns - 33. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/xxvY2UX7YPg</video:player_loc><video:duration>541</video:duration><video:publication_date>2023-06-19T03:23:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/disjoint-set-union-by-size-and-path-compression</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/kGv33AiGhdc/hqdefault.jpg</video:thumbnail_loc><video:title>Disjoint Set Union By SIZE and Path Compression | DSU | Graph Concepts &amp; Qns -39 | Explanation+Code</video:title><video:description>Disjoint Set Union By SIZE and Path Compression | DSU | Graph Concepts &amp; Qns -39 | Explanation+Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/kGv33AiGhdc</video:player_loc><video:duration>1028</video:duration><video:publication_date>2023-08-30T12:51:13.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/euler-path</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/CeO0JEX4QAc/hqdefault.jpg</video:thumbnail_loc><video:title>Euler Path | Euler Circuit | PART-1 | Graph Concepts &amp; Qns - 40 | Explanation+Code</video:title><video:description>Euler Path | Euler Circuit | PART-1 | Graph Concepts &amp; Qns - 40 | Explanation+Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/CeO0JEX4QAc</video:player_loc><video:duration>2003</video:duration><video:publication_date>2023-09-16T14:18:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/euler-path-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/i8h_O6u3DSc/hqdefault.jpg</video:thumbnail_loc><video:title>Euler Path | Euler Circuit | PART-2 | Graph Concepts &amp; Qns - 41 | Explanation + Code</video:title><video:description>Euler Path | Euler Circuit | PART-2 | Graph Concepts &amp; Qns - 41 | Explanation + Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/i8h_O6u3DSc</video:player_loc><video:duration>1410</video:duration><video:publication_date>2023-10-29T15:21:18.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/euler-path-3</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/mw1mGKKR3QQ/hqdefault.jpg</video:thumbnail_loc><video:title>Euler Path | Euler Circuit | PART-3 | Graph Concepts &amp; Qns - 42 | Explanation + Code</video:title><video:description>Euler Path | Euler Circuit | PART-3 | Graph Concepts &amp; Qns - 42 | Explanation + Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/mw1mGKKR3QQ</video:player_loc><video:duration>1063</video:duration><video:publication_date>2024-11-30T04:50:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/multi-source-bfs</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/M7Lp0Uz-2xE/hqdefault.jpg</video:thumbnail_loc><video:title>Multi-Source BFS | What | Why | How | Detailed | Graph Concepts &amp; Qns - 46 | codestorywithMIK</video:title><video:description>Multi-Source BFS | What | Why | How | Detailed | Graph Concepts &amp; Qns - 46 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/M7Lp0Uz-2xE</video:player_loc><video:duration>1864</video:duration><video:publication_date>2025-01-16T17:05:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/0-1-bfs</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/U83oTSsjNqY/hqdefault.jpg</video:thumbnail_loc><video:title>0-1 BFS | What | Why | How | Detailed | Graph Concepts &amp; Qns - 49 | codestorywithMIK</video:title><video:description>0-1 BFS | What | Why | How | Detailed | Graph Concepts &amp; Qns - 49 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/U83oTSsjNqY</video:player_loc><video:duration>2118</video:duration><video:publication_date>2026-07-02T08:09:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/graph-concepts-and-qns-4-microsoft-amazon-flipkart-detect-cycle-in-undirected</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/UrQv5YMC060/hqdefault.jpg</video:thumbnail_loc><video:title>Graph Concepts &amp; Qns - 4 (Microsoft, Amazon, Flipkart) : Detect Cycle in Undirected Graph using DFS</video:title><video:description>Graph Concepts &amp; Qns - 4 (Microsoft, Amazon, Flipkart) : Detect Cycle in Undirected Graph using DFS. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/UrQv5YMC060</video:player_loc><video:duration>1194</video:duration><video:publication_date>2022-12-25T11:34:56.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/number-of-provinces-leetcode-547</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/70LNE8RMPNc/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Provinces - (Google, Microsoft ) | DFS | Graph Concepts &amp; Qns - 10 | Explanation-Code</video:title><video:description>Number of Provinces - (Google, Microsoft ) | DFS | Graph Concepts &amp; Qns - 10 | Explanation-Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/70LNE8RMPNc</video:player_loc><video:duration>1149</video:duration><video:publication_date>2023-01-05T15:30:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/number-of-provinces-leetcode-547-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YDMkSvNdB20/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Provinces - (Google, Microsoft,Amazon) | BFS | Graph Concepts &amp; Qns - 11 |Explanation-Code</video:title><video:description>Number of Provinces - (Google, Microsoft,Amazon) | BFS | Graph Concepts &amp; Qns - 11 |Explanation-Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YDMkSvNdB20</video:player_loc><video:duration>611</video:duration><video:publication_date>2023-01-06T15:30:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/course-schedule-leetcode-207</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/lqjlGGMjSMU/hqdefault.jpg</video:thumbnail_loc><video:title>Course Schedule | Apple | Microsoft | Amazon | BFS | Graph Concepts &amp; Qns - 12 | Leetcode 207</video:title><video:description>Course Schedule | Apple | Microsoft | Amazon | BFS | Graph Concepts &amp; Qns - 12 | Leetcode 207. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/lqjlGGMjSMU</video:player_loc><video:duration>854</video:duration><video:publication_date>2023-01-08T14:11:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/course-schedule-ii-leetcode-210</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/W1WhSN9wAw0/hqdefault.jpg</video:thumbnail_loc><video:title>Course Schedule-II | Apple | Microsoft | Amazon | BFS | Graph Concepts &amp; Qns - 13 | Leetcode 210</video:title><video:description>Course Schedule-II | Apple | Microsoft | Amazon | BFS | Graph Concepts &amp; Qns - 13 | Leetcode 210. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/W1WhSN9wAw0</video:player_loc><video:duration>627</video:duration><video:publication_date>2023-01-09T12:28:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/course-schedule-leetcode-207-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/X1TIkW4C254/hqdefault.jpg</video:thumbnail_loc><video:title>Course Schedule | Apple | Microsoft | Amazon | DFS | Graph Concepts &amp; Qns - 14 | Leetcode 207</video:title><video:description>Course Schedule | Apple | Microsoft | Amazon | DFS | Graph Concepts &amp; Qns - 14 | Leetcode 207. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/X1TIkW4C254</video:player_loc><video:duration>739</video:duration><video:publication_date>2023-01-10T17:18:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/course-schedule-ii-leetcode-210-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/yiR95dxinjs/hqdefault.jpg</video:thumbnail_loc><video:title>Course Schedule-II | Apple | Microsoft | Amazon | DFS | Graph Concepts &amp; Qns - 15 | Leetcode 210</video:title><video:description>Course Schedule-II | Apple | Microsoft | Amazon | DFS | Graph Concepts &amp; Qns - 15 | Leetcode 210. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/yiR95dxinjs</video:player_loc><video:duration>1037</video:duration><video:publication_date>2023-01-11T19:29:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/is-graph-bipartite-leetcode-785</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/NeU-C1PTWB8/hqdefault.jpg</video:thumbnail_loc><video:title>Is Graph Bipartite ? | DFS | Graph Concepts &amp; Qns - 16 | codestorywithMIK</video:title><video:description>Is Graph Bipartite ? | DFS | Graph Concepts &amp; Qns - 16 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/NeU-C1PTWB8</video:player_loc><video:duration>1900</video:duration><video:publication_date>2023-01-14T16:45:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/is-graph-bipartite-leetcode-785-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/cvhXZt66VhA/hqdefault.jpg</video:thumbnail_loc><video:title>Is Graph Bipartite ? | BFS | Graph Concepts &amp; Qns - 17 | codestorywithMIK</video:title><video:description>Is Graph Bipartite ? | BFS | Graph Concepts &amp; Qns - 17 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/cvhXZt66VhA</video:player_loc><video:duration>623</video:duration><video:publication_date>2023-01-15T07:42:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/detect-cycle-using-dsu-google-microsoft</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/0X0lEtTkk-8/hqdefault.jpg</video:thumbnail_loc><video:title>Detect Cycle using DSU - (Google, Microsoft) | Graph Concepts &amp; Qns - 20 | Explanation+Coding</video:title><video:description>Detect Cycle using DSU - (Google, Microsoft) | Graph Concepts &amp; Qns - 20 | Explanation+Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/0X0lEtTkk-8</video:player_loc><video:duration>1062</video:duration><video:publication_date>2023-01-22T17:55:56.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/count-unreachable-pairs-of-nodes-in-an-undirected-graph-leetcode-2316</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Hh_9ppxgzpo/hqdefault.jpg</video:thumbnail_loc><video:title>Count Unreachable Pairs of Nodes in an Undirected Graph |  DSU | Leetcode 2316  | Graph Concepts- 23</video:title><video:description>Count Unreachable Pairs of Nodes in an Undirected Graph |  DSU | Leetcode 2316  | Graph Concepts- 23. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Hh_9ppxgzpo</video:player_loc><video:duration>1396</video:duration><video:publication_date>2023-03-25T17:33:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/dijkstras-algorithm</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/xQ3vjWwFRuI/hqdefault.jpg</video:thumbnail_loc><video:title>Dijkstra&apos;s Algorithm | PART-1 | Graph Concepts &amp; Qns - 24 | Explanation+Coding</video:title><video:description>Dijkstra&apos;s Algorithm | PART-1 | Graph Concepts &amp; Qns - 24 | Explanation+Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/xQ3vjWwFRuI</video:player_loc><video:duration>1851</video:duration><video:publication_date>2023-04-05T14:08:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/dijkstras-algorithm-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/3qIoYIMidpc/hqdefault.jpg</video:thumbnail_loc><video:title>Dijkstra&apos;s Algorithm | PART-2 | (Microsoft) | Graph Concepts &amp; Qns - 25 | Explanation+Coding</video:title><video:description>Dijkstra&apos;s Algorithm | PART-2 | (Microsoft) | Graph Concepts &amp; Qns - 25 | Explanation+Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/3qIoYIMidpc</video:player_loc><video:duration>1052</video:duration><video:publication_date>2023-04-09T12:40:13.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/dijkstras-algorithm-3</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/l4cxEQnuH-U/hqdefault.jpg</video:thumbnail_loc><video:title>Dijkstra&apos;s Algorithm | PART-3 | Why not Queue ? | Microsoft | Graph Concepts &amp; Qns - 26 |Explanation</video:title><video:description>Dijkstra&apos;s Algorithm | PART-3 | Why not Queue ? | Microsoft | Graph Concepts &amp; Qns - 26 |Explanation. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/l4cxEQnuH-U</video:player_loc><video:duration>1186</video:duration><video:publication_date>2023-04-15T14:30:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/shortest-path-in-weighted-undirected-graph</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/icVJUN45f1E/hqdefault.jpg</video:thumbnail_loc><video:title>Shortest Path in Weighted undirected graph | Dijkstra&apos;s | Why not BFS ? | Graph Concepts &amp; Qns - 27</video:title><video:description>Shortest Path in Weighted undirected graph | Dijkstra&apos;s | Why not BFS ? | Graph Concepts &amp; Qns - 27. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/icVJUN45f1E</video:player_loc><video:duration>1818</video:duration><video:publication_date>2023-04-18T17:07:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/network-delay-time-leetcode-743</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/hptQEIpvaxM/hqdefault.jpg</video:thumbnail_loc><video:title>Network Delay Time | Leetcode 743 | GOOGLE | Graph Concepts &amp; Qns - 28 | Explanation+Coding</video:title><video:description>Network Delay Time | Leetcode 743 | GOOGLE | Graph Concepts &amp; Qns - 28 | Explanation+Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/hptQEIpvaxM</video:player_loc><video:duration>893</video:duration><video:publication_date>2023-05-08T15:29:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/shortest-path-in-binary-matrix-leetcode-1091</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/XsF-Xj_y5x8/hqdefault.jpg</video:thumbnail_loc><video:title>Shortest Path in Binary Matrix | Leetcode-1091 | Dijkstra in 2-D Matrix |Graph Concepts &amp; Qns - 29</video:title><video:description>Shortest Path in Binary Matrix | Leetcode-1091 | Dijkstra in 2-D Matrix |Graph Concepts &amp; Qns - 29. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/XsF-Xj_y5x8</video:player_loc><video:duration>2534</video:duration><video:publication_date>2023-05-11T17:44:38.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/path-with-minimum-effort-leetcode-1631</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QIu9HeyEjPc/hqdefault.jpg</video:thumbnail_loc><video:title>Path With Minimum Effort | Leetcode-1631 | Dijkstra in 2-D Matrix |GOOGLE |Graph Concepts &amp; Qns - 30</video:title><video:description>Path With Minimum Effort | Leetcode-1631 | Dijkstra in 2-D Matrix |GOOGLE |Graph Concepts &amp; Qns - 30. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QIu9HeyEjPc</video:player_loc><video:duration>2029</video:duration><video:publication_date>2023-05-16T18:37:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/bellman-ford-algorithm</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5yTkgeTqKK0/hqdefault.jpg</video:thumbnail_loc><video:title>Bellman-Ford Algorithm | Full Detail | Microsoft, Amazon | Graph Concepts &amp; Qns - 31 | Explanation</video:title><video:description>Bellman-Ford Algorithm | Full Detail | Microsoft, Amazon | Graph Concepts &amp; Qns - 31 | Explanation. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5yTkgeTqKK0</video:player_loc><video:duration>2602</video:duration><video:publication_date>2023-05-19T17:30:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/floyd-warshall-algorithm</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/DzfmJoFq1pc/hqdefault.jpg</video:thumbnail_loc><video:title>Floyd Warshall Algorithm | Full Detail | Samsung | Graph Concepts &amp; Qns - 32 | Explanation + Coding</video:title><video:description>Floyd Warshall Algorithm | Full Detail | Samsung | Graph Concepts &amp; Qns - 32 | Explanation + Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/DzfmJoFq1pc</video:player_loc><video:duration>1360</video:duration><video:publication_date>2023-06-04T06:58:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/prims-algorithm</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/V9gXzD7g8fw/hqdefault.jpg</video:thumbnail_loc><video:title>Prim&apos;s Algorithm | Minimum Spanning Tree | Full Dry Run | INTUITION | Graph Concepts &amp; Qns - 34</video:title><video:description>Prim&apos;s Algorithm | Minimum Spanning Tree | Full Dry Run | INTUITION | Graph Concepts &amp; Qns - 34. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/V9gXzD7g8fw</video:player_loc><video:duration>1894</video:duration><video:publication_date>2023-07-10T18:16:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/min-cost-to-connect-all-points-leetcode-1584</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/hsr7KolYDH0/hqdefault.jpg</video:thumbnail_loc><video:title>Min Cost to Connect All Points | Prim&apos;s Algorithm | META | Graph Concepts &amp; Qns - 35 | Leetcode-1584</video:title><video:description>Min Cost to Connect All Points | Prim&apos;s Algorithm | META | Graph Concepts &amp; Qns - 35 | Leetcode-1584. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/hsr7KolYDH0</video:player_loc><video:duration>1144</video:duration><video:publication_date>2023-07-16T18:49:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/kruskals-algorithm</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/3tgekNXWXsY/hqdefault.jpg</video:thumbnail_loc><video:title>Kruskal&apos;s Algorithm | Minimum Spanning Tree | Full Dry Run | INTUITION | Graph Concepts &amp; Qns - 36</video:title><video:description>Kruskal&apos;s Algorithm | Minimum Spanning Tree | Full Dry Run | INTUITION | Graph Concepts &amp; Qns - 36. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/3tgekNXWXsY</video:player_loc><video:duration>1441</video:duration><video:publication_date>2023-07-18T12:55:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/min-cost-to-connect-all-points-leetcode-1584-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/O6wQQtv71S0/hqdefault.jpg</video:thumbnail_loc><video:title>Min Cost to Connect All Points | Kruskal&apos;s Algorithm | Graph Concepts &amp; Qns - 37 | Leetcode-1584</video:title><video:description>Min Cost to Connect All Points | Kruskal&apos;s Algorithm | Graph Concepts &amp; Qns - 37 | Leetcode-1584. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/O6wQQtv71S0</video:player_loc><video:duration>692</video:duration><video:publication_date>2023-07-19T10:30:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/strongly-connected-components</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/E6DeC0Zpdns/hqdefault.jpg</video:thumbnail_loc><video:title>Strongly Connected Components | Kosaraju&apos;s Algorithm | Intuition | AMAZON | Graph Concepts &amp; Qns- 38</video:title><video:description>Strongly Connected Components | Kosaraju&apos;s Algorithm | Intuition | AMAZON | Graph Concepts &amp; Qns- 38. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/E6DeC0Zpdns</video:player_loc><video:duration>2325</video:duration><video:publication_date>2023-07-21T19:31:18.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/valid-arrangement-of-pairs-leetcode-2097</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ElXqjhZoUC0/hqdefault.jpg</video:thumbnail_loc><video:title>Hierholzer&apos;s Algorithm | Valid Arrangement of Pairs | Leetcode 2097 | Graph Concepts &amp; Qns - 43</video:title><video:description>Hierholzer&apos;s Algorithm | Valid Arrangement of Pairs | Leetcode 2097 | Graph Concepts &amp; Qns - 43. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ElXqjhZoUC0</video:player_loc><video:duration>1901</video:duration><video:publication_date>2024-11-30T07:14:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/tree-diameter-leetcode-1245</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/na3LE8CBYLo/hqdefault.jpg</video:thumbnail_loc><video:title>Diameter Of Undirected Graph | Tree Diameter | Leetcode 1245 | Graph Concepts &amp; Qns - 44 | MIK</video:title><video:description>Diameter Of Undirected Graph | Tree Diameter | Leetcode 1245 | Graph Concepts &amp; Qns - 44 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/na3LE8CBYLo</video:player_loc><video:duration>2179</video:duration><video:publication_date>2024-12-24T07:16:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/find-minimum-diameter-after-merging-two-trees-leetcode-3203</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/uz_WISpySFs/hqdefault.jpg</video:thumbnail_loc><video:title>Find Minimum Diameter After Merging Two Trees | Leetcode 3203 | Graph Concepts &amp; Qns - 45 | MIK</video:title><video:description>Find Minimum Diameter After Merging Two Trees | Leetcode 3203 | Graph Concepts &amp; Qns - 45 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/uz_WISpySFs</video:player_loc><video:duration>1792</video:duration><video:publication_date>2024-12-24T09:35:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/rotting-oranges-leetcode-994</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Jiu0jqm0mB0/hqdefault.jpg</video:thumbnail_loc><video:title>Rotting Oranges | Multi-Source BFS | Leetcode 994 | Graph Concepts &amp; Qns - 47 | codestorywithMIK</video:title><video:description>Rotting Oranges | Multi-Source BFS | Leetcode 994 | Graph Concepts &amp; Qns - 47 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Jiu0jqm0mB0</video:player_loc><video:duration>2916</video:duration><video:publication_date>2025-01-17T11:18:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/map-of-highest-peak-leetcode-1765</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/nQe5OBs0FgQ/hqdefault.jpg</video:thumbnail_loc><video:title>Map of Highest Peak | Multi-Source BFS | Leetcode 1765 | Graph Concepts &amp; Qns- 48 | codestorywithMIK</video:title><video:description>Map of Highest Peak | Multi-Source BFS | Leetcode 1765 | Graph Concepts &amp; Qns- 48 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/nQe5OBs0FgQ</video:player_loc><video:duration>2581</video:duration><video:publication_date>2025-01-18T00:01:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/find-a-safe-walk-through-a-grid-leetcode-3286</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ZIFAFLARoLs/hqdefault.jpg</video:thumbnail_loc><video:title>Find a Safe Walk Through a Grid | Leetcode 3286 | Made Easy | Graph Concepts &amp; Qns - 50 | MIK</video:title><video:description>Find a Safe Walk Through a Grid | Leetcode 3286 | Made Easy | Graph Concepts &amp; Qns - 50 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ZIFAFLARoLs</video:player_loc><video:duration>1487</video:duration><video:publication_date>2026-07-02T09:49:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/minimum-genetic-mutation-leetcode-433</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/H3kSFSv-t30/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Genetic Mutation -(Asked by Twitter) : Explanation ➕ Live Coding</video:title><video:description>Minimum Genetic Mutation -(Asked by Twitter) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/H3kSFSv-t30</video:player_loc><video:duration>1814</video:duration><video:publication_date>2022-11-02T13:00:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/most-stones-removed-with-same-row-or-column-leetcode-947</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ZsGTpXm966E/hqdefault.jpg</video:thumbnail_loc><video:title>Most Stones Removed with Same Row or Column | Leetcode 947 | Made Easy | codestorywithMIK</video:title><video:description>Most Stones Removed with Same Row or Column | Leetcode 947 | Made Easy | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ZsGTpXm966E</video:player_loc><video:duration>1970</video:duration><video:publication_date>2022-11-14T14:59:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/nearest-exit-from-entrance-in-maze-leetcode-1926</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Q4bqto_yG6I/hqdefault.jpg</video:thumbnail_loc><video:title>Nearest Exit from Entrance in Maze -(Samsung) : Explanation ➕ Live Coding</video:title><video:description>Nearest Exit from Entrance in Maze -(Samsung) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Q4bqto_yG6I</video:player_loc><video:duration>1125</video:duration><video:publication_date>2022-11-21T14:01:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/find-if-path-exists-in-graph-leetcode-1971</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/mbR1XSXidEE/hqdefault.jpg</video:thumbnail_loc><video:title>Find if Path Exists in Graph | Easiest Explanation | Microsoft | Leetcode 1971 | codestorywithMIK</video:title><video:description>Find if Path Exists in Graph | Easiest Explanation | Microsoft | Leetcode 1971 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/mbR1XSXidEE</video:player_loc><video:duration>1480</video:duration><video:publication_date>2022-12-19T04:14:34.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/keys-and-rooms-leetcode-841</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/qDHd9n_XGQ8/hqdefault.jpg</video:thumbnail_loc><video:title>Keys and Rooms - (GOOGLE) : Explanation ➕ Live Coding 👩🏻‍💻🧑🏻‍💻🤯😱</video:title><video:description>Keys and Rooms - (GOOGLE) : Explanation ➕ Live Coding 👩🏻‍💻🧑🏻‍💻🤯😱. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/qDHd9n_XGQ8</video:player_loc><video:duration>731</video:duration><video:publication_date>2022-12-20T03:49:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/possible-bipartition-leetcode-886</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/yYBKsu27f2s/hqdefault.jpg</video:thumbnail_loc><video:title>Possible Bipartition - (Microsoft, Flipkart, Samsung) : Explanation ➕ Live Coding 🧑🏻‍💻👩🏻‍💻</video:title><video:description>Possible Bipartition - (Microsoft, Flipkart, Samsung) : Explanation ➕ Live Coding 🧑🏻‍💻👩🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/yYBKsu27f2s</video:player_loc><video:duration>1569</video:duration><video:publication_date>2022-12-21T07:39:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/sum-of-distances-in-tree-leetcode-834</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/b6DrMMHFiL0/hqdefault.jpg</video:thumbnail_loc><video:title>Sum of Distances in Tree | Google | Leetcode 834 | codestorywithMIK</video:title><video:description>Sum of Distances in Tree | Google | Leetcode 834 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/b6DrMMHFiL0</video:player_loc><video:duration>2686</video:duration><video:publication_date>2022-12-23T18:32:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/all-paths-from-source-to-target-leetcode-797</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9qWMS8GLvdI/hqdefault.jpg</video:thumbnail_loc><video:title>All Paths From Source to Target - (Amazon, Microsoft) : Explanation ➕ Live Coding</video:title><video:description>All Paths From Source to Target - (Amazon, Microsoft) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9qWMS8GLvdI</video:player_loc><video:duration>821</video:duration><video:publication_date>2022-12-30T08:26:47.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/minimum-time-to-collect-all-apples-in-a-tree-leetcode-1443</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/qSBvKlUq0xo/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Time to Collect All Apples in a Tree - (Microsoft) : Explanation ➕ Live Coding</video:title><video:description>Minimum Time to Collect All Apples in a Tree - (Microsoft) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/qSBvKlUq0xo</video:player_loc><video:duration>1561</video:duration><video:publication_date>2023-01-11T06:17:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/number-of-nodes-in-the-sub-tree-with-the-same-label-leetcode-1519</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/yZ6IM8Q-0Ac/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Nodes in the Sub-Tree With the Same Label : (Better Approach) | Explanation ➕ Live Coding</video:title><video:description>Number of Nodes in the Sub-Tree With the Same Label : (Better Approach) | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/yZ6IM8Q-0Ac</video:player_loc><video:duration>1658</video:duration><video:publication_date>2023-01-12T19:26:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/longest-path-with-different-adjacent-characters-leetcode-2246</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/EA8dP63iVPk/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Path With Different Adjacent Characters : (Microsoft) | Explanation ➕ Live Coding</video:title><video:description>Longest Path With Different Adjacent Characters : (Microsoft) | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/EA8dP63iVPk</video:player_loc><video:duration>1424</video:duration><video:publication_date>2023-01-13T04:43:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/lexicographically-smallest-equivalent-string-leetcode-1061</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/DsAIuJmiT1c/hqdefault.jpg</video:thumbnail_loc><video:title>Lexicographically Smallest Equivalent String | Using DFS | Leetcode 1061 | codestorywithMIK</video:title><video:description>Lexicographically Smallest Equivalent String | Using DFS | Leetcode 1061 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/DsAIuJmiT1c</video:player_loc><video:duration>1105</video:duration><video:publication_date>2023-01-14T09:13:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/number-of-good-paths-leetcode-2421</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Y02Muq_xoCg/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Good Paths | GOOGLE | DSU | Explanation ➕ Live Coding</video:title><video:description>Number of Good Paths | GOOGLE | DSU | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Y02Muq_xoCg</video:player_loc><video:duration>2667</video:duration><video:publication_date>2023-01-15T17:56:38.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/find-closest-node-to-given-two-nodes-leetcode-2359</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Vn-voe1XNtQ/hqdefault.jpg</video:thumbnail_loc><video:title>Find Closest Node to Given Two Nodes | BFS | DFS | Leetcode 2359 | codestorywithMIK</video:title><video:description>Find Closest Node to Given Two Nodes | BFS | DFS | Leetcode 2359 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Vn-voe1XNtQ</video:player_loc><video:duration>1116</video:duration><video:publication_date>2023-01-25T09:21:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/cheapest-flights-within-k-stops-leetcode-787</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/VmUpydhNmuw/hqdefault.jpg</video:thumbnail_loc><video:title>Cheapest Flights Within K Stops | GOOGLE | BFS | Explanation ➕ Live Coding</video:title><video:description>Cheapest Flights Within K Stops | GOOGLE | BFS | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/VmUpydhNmuw</video:player_loc><video:duration>1914</video:duration><video:publication_date>2023-01-26T08:05:58.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/minimum-score-of-a-path-between-two-cities-leetcode-2492</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/blUPwDof-r4/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Score of a Path Between Two Cities | Leetcode - 2492 | GOOGLE | codestorywithMIK</video:title><video:description>Minimum Score of a Path Between Two Cities | Leetcode - 2492 | GOOGLE | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/blUPwDof-r4</video:player_loc><video:duration>885</video:duration><video:publication_date>2023-03-22T14:59:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/reorder-routes-to-make-all-paths-lead-to-the-city-zero-leetcode-1466</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/42Z0eaopoZ8/hqdefault.jpg</video:thumbnail_loc><video:title>Reorder Routes to Make All Paths Lead to the City Zero | Leetcode - 1466 | META | DFS | Live Coding</video:title><video:description>Reorder Routes to Make All Paths Lead to the City Zero | Leetcode - 1466 | META | DFS | Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/42Z0eaopoZ8</video:player_loc><video:duration>1895</video:duration><video:publication_date>2023-03-24T11:11:51.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/count-unreachable-pairs-of-nodes-in-an-undirected-graph-leetcode-2316-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/kOt2VNsU0FE/hqdefault.jpg</video:thumbnail_loc><video:title>Count Unreachable Pairs of Nodes in an Undirected Graph | Leetcode - 2316 | MICROSOFT | Live Coding</video:title><video:description>Count Unreachable Pairs of Nodes in an Undirected Graph | Leetcode - 2316 | MICROSOFT | Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/kOt2VNsU0FE</video:player_loc><video:duration>1704</video:duration><video:publication_date>2023-03-25T11:21:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/longest-cycle-in-a-graph-leetcode-2360</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/m6cp4eHWLak/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Cycle in a Graph | Leetcode - 2360 | DFS | Explanation ➕ Live Coding Trash</video:title><video:description>Longest Cycle in a Graph | Leetcode - 2360 | DFS | Explanation ➕ Live Coding Trash. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/m6cp4eHWLak</video:player_loc><video:duration>1946</video:duration><video:publication_date>2023-03-26T10:06:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/clone-graph-leetcode-133</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/z7mPg_xT5xk/hqdefault.jpg</video:thumbnail_loc><video:title>Clone Graph | Leetcode - 133 | Google, Facebook, Amazon | DFS+BFS | Explanation ➕ Live Coding🧑🏻‍💻</video:title><video:description>Clone Graph | Leetcode - 133 | Google, Facebook, Amazon | DFS+BFS | Explanation ➕ Live Coding🧑🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/z7mPg_xT5xk</video:player_loc><video:duration>2485</video:duration><video:publication_date>2023-04-08T08:37:48.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/largest-color-value-in-a-directed-graph-leetcode-1857</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/V6LnZaX7zpk/hqdefault.jpg</video:thumbnail_loc><video:title>Largest Color Value in a Directed Graph | Detailed | Leetcode 1857 | META | codestorywithMIK</video:title><video:description>Largest Color Value in a Directed Graph | Detailed | Leetcode 1857 | META | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/V6LnZaX7zpk</video:player_loc><video:duration>2655</video:duration><video:publication_date>2023-04-09T05:41:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/similar-string-groups-leetcode-839</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/CMTlE0W01Pk/hqdefault.jpg</video:thumbnail_loc><video:title>Similar String Groups | Leetcode - 839 | DFS &amp; BFS | AMAZON | Explanation ➕ Live Coding</video:title><video:description>Similar String Groups | Leetcode - 839 | DFS &amp; BFS | AMAZON | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/CMTlE0W01Pk</video:player_loc><video:duration>910</video:duration><video:publication_date>2023-04-28T12:03:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/similar-string-groups-leetcode-839-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Xw6lpWDh82E/hqdefault.jpg</video:thumbnail_loc><video:title>Similar String Groups | Leetcode - 839 | DSU | AMAZON | Explanation ➕ Live Coding</video:title><video:description>Similar String Groups | Leetcode - 839 | DSU | AMAZON | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Xw6lpWDh82E</video:player_loc><video:duration>705</video:duration><video:publication_date>2023-04-28T15:49:39.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/checking-existence-of-edge-length-limited-paths-leetcode-1697</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/WYBpATWlXWA/hqdefault.jpg</video:thumbnail_loc><video:title>Checking Existence of Edge Length Limited Paths | Leetcode - 1697 | DSU | GOOGLE | Explanation</video:title><video:description>Checking Existence of Edge Length Limited Paths | Leetcode - 1697 | DSU | GOOGLE | Explanation. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/WYBpATWlXWA</video:player_loc><video:duration>1937</video:duration><video:publication_date>2023-04-29T15:42:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/remove-max-number-of-edges-to-keep-graph-fully-traversable-leetcode-1579</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8S5jpVM3kWw/hqdefault.jpg</video:thumbnail_loc><video:title>Remove Max Number Of Edges To Keep Graph Fully Traversable | Leetcode - 1579 | DSU | GOOGLE | Live</video:title><video:description>Remove Max Number Of Edges To Keep Graph Fully Traversable | Leetcode - 1579 | DSU | GOOGLE | Live. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8S5jpVM3kWw</video:player_loc><video:duration>1674</video:duration><video:publication_date>2023-04-30T16:28:47.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/minimum-number-of-vertices-to-reach-all-nodes-leetcode-1557</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/7wGJ1nevpnc/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Number of Vertices to Reach All Nodes | With INTUITION | GOOGLE | Leetcode-1557 | Live Code</video:title><video:description>Minimum Number of Vertices to Reach All Nodes | With INTUITION | GOOGLE | Leetcode-1557 | Live Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/7wGJ1nevpnc</video:player_loc><video:duration>986</video:duration><video:publication_date>2023-05-18T03:26:41.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/evaluate-division-leetcode-399</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/C6cm6IvqmyA/hqdefault.jpg</video:thumbnail_loc><video:title>Evaluate Division | With INTUITION | META, AMAZON | Leetcode-399 | Live Code 🧑🏻‍💻👩🏻‍💻</video:title><video:description>Evaluate Division | With INTUITION | META, AMAZON | Leetcode-399 | Live Code 🧑🏻‍💻👩🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/C6cm6IvqmyA</video:player_loc><video:duration>1504</video:duration><video:publication_date>2023-05-20T10:17:43.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/shortest-path-in-binary-matrix-leetcode-1091-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/tULxO0OCkvg/hqdefault.jpg</video:thumbnail_loc><video:title>Shortest Path in Binary Matrix | BFS | Dijkstra&apos;s | Google, Amazon | Leetcode-1091 | Live Code</video:title><video:description>Shortest Path in Binary Matrix | BFS | Dijkstra&apos;s | Google, Amazon | Leetcode-1091 | Live Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/tULxO0OCkvg</video:player_loc><video:duration>6</video:duration><video:publication_date>2023-06-01T03:26:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/detonate-the-maximum-bombs-leetcode-2101</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/fGSPLQ1la90/hqdefault.jpg</video:thumbnail_loc><video:title>Detonate the Maximum Bombs | DFS | BFS | GOOGLE | Leetcode-2101 | Live Code + Explanation 🧑🏻‍💻</video:title><video:description>Detonate the Maximum Bombs | DFS | BFS | GOOGLE | Leetcode-2101 | Live Code + Explanation 🧑🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/fGSPLQ1la90</video:player_loc><video:duration>1549</video:duration><video:publication_date>2023-06-02T07:12:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/path-with-maximum-probability-leetcode-1514</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/zTM9k6jqpXI/hqdefault.jpg</video:thumbnail_loc><video:title>Path with Maximum Probability | Using Dijkstra&apos;s | GOOGLE | Leetcode-1514 | Live Code</video:title><video:description>Path with Maximum Probability | Using Dijkstra&apos;s | GOOGLE | Leetcode-1514 | Live Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/zTM9k6jqpXI</video:player_loc><video:duration>1368</video:duration><video:publication_date>2023-06-28T03:46:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/find-eventual-safe-states-leetcode-802</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/k8LBJqGLLQE/hqdefault.jpg</video:thumbnail_loc><video:title>Find Eventual Safe States | 2 Approaches | Intuition | Leetcode 802 | MICROSOFT | codestorywithMIK</video:title><video:description>Find Eventual Safe States | 2 Approaches | Intuition | Leetcode 802 | MICROSOFT | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/k8LBJqGLLQE</video:player_loc><video:duration>2034</video:duration><video:publication_date>2023-07-12T10:38:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/maximal-network-rank-leetcode-1615</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/R2sjm5jfwYY/hqdefault.jpg</video:thumbnail_loc><video:title>Maximal Network Rank | Simple and Straight | 2 Ways | MICROSOFT | Leetcode 1615 | codestorywithMIK</video:title><video:description>Maximal Network Rank | Simple and Straight | 2 Ways | MICROSOFT | Leetcode 1615 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/R2sjm5jfwYY</video:player_loc><video:duration>1322</video:duration><video:publication_date>2023-08-18T03:45:56.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/find-critical-and-pseudo-critical-edges-in-minimum-spanning-leetcode-1489</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/gDPh7gsK3F8/hqdefault.jpg</video:thumbnail_loc><video:title>Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Broken in Steps | Leetcode-1489</video:title><video:description>Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Broken in Steps | Leetcode-1489. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/gDPh7gsK3F8</video:player_loc><video:duration>2950</video:duration><video:publication_date>2023-08-19T09:31:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/sort-items-by-groups-respecting-dependencies-leetcode-1203</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Uu03ktYBWMY/hqdefault.jpg</video:thumbnail_loc><video:title>Sort Items by Groups Respecting Dependencies | Broken into Simple Steps | Intuition | Leetcode-1203</video:title><video:description>Sort Items by Groups Respecting Dependencies | Broken into Simple Steps | Intuition | Leetcode-1203. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Uu03ktYBWMY</video:player_loc><video:duration>2304</video:duration><video:publication_date>2023-08-20T11:39:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/reconstruct-itinerary-leetcode-332</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/6zq1BBMAam0/hqdefault.jpg</video:thumbnail_loc><video:title>Reconstruct Itinerary | Clean | Simple | Intuitive | GOOGLE | Leetcode-332 | Live Code</video:title><video:description>Reconstruct Itinerary | Clean | Simple | Intuitive | GOOGLE | Leetcode-332 | Live Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/6zq1BBMAam0</video:player_loc><video:duration>1750</video:duration><video:publication_date>2023-09-14T04:03:59.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/shortest-path-visiting-all-nodes-leetcode-847</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/m73DRkEo8Ko/hqdefault.jpg</video:thumbnail_loc><video:title>Shortest Path Visiting All Nodes | Clean | Simple | Intuitive | BFS | GOOGLE | Leetcode-847 |</video:title><video:description>Shortest Path Visiting All Nodes | Clean | Simple | Intuitive | BFS | GOOGLE | Leetcode-847 |. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/m73DRkEo8Ko</video:player_loc><video:duration>2916</video:duration><video:publication_date>2023-09-17T07:19:43.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/validate-binary-tree-nodes-leetcode-1361</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/FfA-2CrWVJw/hqdefault.jpg</video:thumbnail_loc><video:title>Validate Binary Tree Nodes | Using DSU | Intuitive | META | Leetcode - 1361</video:title><video:description>Validate Binary Tree Nodes | Using DSU | Intuitive | META | Leetcode - 1361. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/FfA-2CrWVJw</video:player_loc><video:duration>1273</video:duration><video:publication_date>2023-10-17T13:25:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/parallel-courses-iii-leetcode-2050</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/743cYtf3DJI/hqdefault.jpg</video:thumbnail_loc><video:title>Parallel Courses III | Topological Sorting | Intuition | Dry Run | UBER | Leetcode - 2050</video:title><video:description>Parallel Courses III | Topological Sorting | Intuition | Dry Run | UBER | Leetcode - 2050. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/743cYtf3DJI</video:player_loc><video:duration>1840</video:duration><video:publication_date>2023-10-18T09:41:53.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/restore-the-array-from-adjacent-pairs-leetcode-2642</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/EPvZsimuqwM/hqdefault.jpg</video:thumbnail_loc><video:title>Design Graph With Shortest Path Calculator | Dijkstra’s | Floyd Warshall | Leetcode-2642</video:title><video:description>Design Graph With Shortest Path Calculator | Dijkstra’s | Floyd Warshall | Leetcode-2642. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/EPvZsimuqwM</video:player_loc><video:duration>1481</video:duration><video:publication_date>2023-11-11T03:22:47.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/bus-routes-leetcode-815</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/uDbr-6svYKw/hqdefault.jpg</video:thumbnail_loc><video:title>Bus Routes | Dry Run | Intuition | UBER | Leetcode 815 | codestorywithMIK</video:title><video:description>Bus Routes | Dry Run | Intuition | UBER | Leetcode 815 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/uDbr-6svYKw</video:player_loc><video:duration>1281</video:duration><video:publication_date>2023-11-12T08:18:49.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/number-of-possible-sets-of-closing-branches-leetcode-2959</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/80pGUfUcBwQ/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Possible Sets of Closing Branches | Intuition | Leetcode-2959 | Bi-Weekly Contest 119</video:title><video:description>Number of Possible Sets of Closing Branches | Intuition | Leetcode-2959 | Bi-Weekly Contest 119. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/80pGUfUcBwQ</video:player_loc><video:duration>3571</video:duration><video:publication_date>2023-12-15T06:15:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/minimum-cost-to-convert-string-i-leetcode-2976</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/M8WnAIhTjmQ/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Cost to Convert String I | Weekly Contest 377 | 2 Approaches | Leetcode 2976</video:title><video:description>Minimum Cost to Convert String I | Weekly Contest 377 | 2 Approaches | Leetcode 2976. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/M8WnAIhTjmQ</video:player_loc><video:duration>2891</video:duration><video:publication_date>2023-12-25T16:03:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/count-the-number-of-houses-at-a-certain-distance-i-leetcode-3015</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Uhy8lnno7hE/hqdefault.jpg</video:thumbnail_loc><video:title>Count the Number of Houses at a Certain Distance I | Why Graph | Leetcode 3015 | Weekly Contest</video:title><video:description>Count the Number of Houses at a Certain Distance I | Why Graph | Leetcode 3015 | Weekly Contest. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Uhy8lnno7hE</video:player_loc><video:duration>1912</video:duration><video:publication_date>2024-01-21T14:47:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/find-all-people-with-secret-leetcode-2092</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/hxEWwnJJKcY/hqdefault.jpg</video:thumbnail_loc><video:title>Find All People With Secret | 4 Approaches | Google | Leetcode 2092 | codestorywithMIK</video:title><video:description>Find All People With Secret | 4 Approaches | Google | Leetcode 2092 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/hxEWwnJJKcY</video:player_loc><video:duration>5032</video:duration><video:publication_date>2024-02-24T10:00:41.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/minimum-cost-walk-in-weighted-graph-leetcode-3108</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/B3Wgf-g6i-k/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Cost Walk in Weighted Graph | Thought Process | DSU | Leetcode 3108 | codestorywithMIK</video:title><video:description>Minimum Cost Walk in Weighted Graph | Thought Process | DSU | Leetcode 3108 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/B3Wgf-g6i-k</video:player_loc><video:duration>2643</video:duration><video:publication_date>2024-04-07T10:51:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/find-edges-in-shortest-paths-leetcode-3123</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/O61WbSqXTgk/hqdefault.jpg</video:thumbnail_loc><video:title>Find Edges in Shortest Paths | Dijkstra&apos;s Algo | Full Intuition | Leetcode 3123 | codestorywithMIK</video:title><video:description>Find Edges in Shortest Paths | Dijkstra&apos;s Algo | Full Intuition | Leetcode 3123 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/O61WbSqXTgk</video:player_loc><video:duration>2311</video:duration><video:publication_date>2024-04-21T07:33:35.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/open-the-lock-leetcode-752</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QHRlC7O-lis/hqdefault.jpg</video:thumbnail_loc><video:title>Open the Lock | Why BFS | Similar Pattern Problems | META | Leetcode 752 | codestorywithMIK</video:title><video:description>Open the Lock | Why BFS | Similar Pattern Problems | META | Leetcode 752 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QHRlC7O-lis</video:player_loc><video:duration>2166</video:duration><video:publication_date>2024-04-22T03:43:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/minimum-height-trees-leetcode-310</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ZXANlaEuYvQ/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Height Trees | Know Every Detail | Why BFS | GOOGLE | Leetcode 310 | codestorywithMIK</video:title><video:description>Minimum Height Trees | Know Every Detail | Why BFS | GOOGLE | Leetcode 310 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ZXANlaEuYvQ</video:player_loc><video:duration>2663</video:duration><video:publication_date>2024-04-23T04:37:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/freedom-trail-leetcode-514</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/yUNjMFE1tGo/hqdefault.jpg</video:thumbnail_loc><video:title>Freedom Trail | Using Shortest Path in Graph | Modified Dijkstra | Leetcode 514 | codestorywithMIK</video:title><video:description>Freedom Trail | Using Shortest Path in Graph | Modified Dijkstra | Leetcode 514 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/yUNjMFE1tGo</video:player_loc><video:duration>2418</video:duration><video:publication_date>2024-04-27T18:42:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/maximum-total-importance-of-roads-leetcode-2285</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/p4y_rQeB2mg/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Total Importance of Roads | Thought Process | Leetcode 2285 | codestorywithMIK</video:title><video:description>Maximum Total Importance of Roads | Thought Process | Leetcode 2285 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/p4y_rQeB2mg</video:player_loc><video:duration>1320</video:duration><video:publication_date>2024-06-28T03:53:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/all-ancestors-of-a-node-in-a-directed-acyclic-graph-leetcode-2192</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/zdGouql8XKs/hqdefault.jpg</video:thumbnail_loc><video:title>All Ancestors of a Node in a Directed Acyclic Graph | 3 Approaches | Leetcode 2192 |codestorywithMIK</video:title><video:description>All Ancestors of a Node in a Directed Acyclic Graph | 3 Approaches | Leetcode 2192 |codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/zdGouql8XKs</video:player_loc><video:duration>2576</video:duration><video:publication_date>2024-06-29T06:56:51.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/build-a-matrix-with-conditions-leetcode-2392</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QyrmIu4Vo8A/hqdefault.jpg</video:thumbnail_loc><video:title>Build a Matrix With Conditions | BFS | DFS | Detailed Explanation | Leetcode 2392 | codestorywithMIK</video:title><video:description>Build a Matrix With Conditions | BFS | DFS | Detailed Explanation | Leetcode 2392 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QyrmIu4Vo8A</video:player_loc><video:duration>2450</video:duration><video:publication_date>2024-07-21T04:45:35.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/find-the-city-with-the-smallest-number-of-neighbors-at-a-leetcode-1334</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8YdqvOKViWA/hqdefault.jpg</video:thumbnail_loc><video:title>Find the City With the Smallest Number of Neighbors at a Threshold Distance | 3 Ways | Leetcode 1334</video:title><video:description>Find the City With the Smallest Number of Neighbors at a Threshold Distance | 3 Ways | Leetcode 1334. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8YdqvOKViWA</video:player_loc><video:duration>2339</video:duration><video:publication_date>2024-07-26T04:59:49.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/second-minimum-time-to-reach-destination-leetcode-2045</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/_rnQKrA9xzA/hqdefault.jpg</video:thumbnail_loc><video:title>Second Minimum Time to Reach Destination | 2 Approaches | FULL DRY RUN | Leetcode 2045</video:title><video:description>Second Minimum Time to Reach Destination | 2 Approaches | FULL DRY RUN | Leetcode 2045. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/_rnQKrA9xzA</video:player_loc><video:duration>3958</video:duration><video:publication_date>2024-07-28T06:26:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/most-stones-removed-with-same-row-or-column-leetcode-947-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/cmqIeBFx01w/hqdefault.jpg</video:thumbnail_loc><video:title>Most Stones Removed with Same Row or Column | Using DSU | DRY RUN | Leetcode 947 | codestorywithMIK</video:title><video:description>Most Stones Removed with Same Row or Column | Using DSU | DRY RUN | Leetcode 947 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/cmqIeBFx01w</video:player_loc><video:duration>2063</video:duration><video:publication_date>2024-08-29T07:32:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/modify-graph-edge-weights-leetcode-2699</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/F6sRIQKslwA/hqdefault.jpg</video:thumbnail_loc><video:title>Modify Graph Edge Weights | Using Dijkstra | Thought Process | Leetcode 2699 | codestorywithMIK</video:title><video:description>Modify Graph Edge Weights | Using Dijkstra | Thought Process | Leetcode 2699 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/F6sRIQKslwA</video:player_loc><video:duration>2805</video:duration><video:publication_date>2024-08-30T09:52:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/find-champion-ii-leetcode-2924</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/1tsmqSn-O_0/hqdefault.jpg</video:thumbnail_loc><video:title>Find Champion II | Easy Explanation | Leetcode 2924 | codestorywithMIK</video:title><video:description>Find Champion II | Easy Explanation | Leetcode 2924 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/1tsmqSn-O_0</video:player_loc><video:duration>684</video:duration><video:publication_date>2024-11-26T01:41:25.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/shortest-distance-after-road-addition-queries-i-leetcode-3243</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/INUZt6li__c/hqdefault.jpg</video:thumbnail_loc><video:title>Shortest Distance After Road Addition Queries I | Easy Explanation | Leetcode 3243 |codestorywithMIK</video:title><video:description>Shortest Distance After Road Addition Queries I | Easy Explanation | Leetcode 3243 |codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/INUZt6li__c</video:player_loc><video:duration>1520</video:duration><video:publication_date>2024-11-27T02:24:59.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/minimum-obstacle-removal-to-reach-corner-leetcode-2290</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/UQogvDBoHe4/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Obstacle Removal to Reach Corner I | Using Studied Concept | Leetcode 2290 |codestorywithMIK</video:title><video:description>Minimum Obstacle Removal to Reach Corner I | Using Studied Concept | Leetcode 2290 |codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/UQogvDBoHe4</video:player_loc><video:duration>1558</video:duration><video:publication_date>2024-11-28T02:54:49.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/minimum-time-to-visit-a-cell-in-a-grid-leetcode-2577</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/2H9CVEmmMUM/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Time to Visit a Cell In a Grid | Using Studied Concept | Leetcode 2577 | codestorywithMIK</video:title><video:description>Minimum Time to Visit a Cell In a Grid | Using Studied Concept | Leetcode 2577 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/2H9CVEmmMUM</video:player_loc><video:duration>2200</video:duration><video:publication_date>2024-11-29T04:27:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/minimize-the-maximum-edge-weight-of-graph-leetcode-3419</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/B5aIqLq50_8/hqdefault.jpg</video:thumbnail_loc><video:title>Minimize the Maximum Edge Weight of Graph | Detailed Intuition | BFS | DFS | Leetcode 3419 | MIK</video:title><video:description>Minimize the Maximum Edge Weight of Graph | Detailed Intuition | BFS | DFS | Leetcode 3419 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/B5aIqLq50_8</video:player_loc><video:duration>2898</video:duration><video:publication_date>2025-01-12T11:27:56.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/minimum-cost-to-make-at-least-one-valid-path-in-a-grid-leetcode-1368</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/NS3C4W_jJJM/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Cost to Make at Least One Valid Path in a Grid | 2 Detailed Approaches | Leetcode 1368 | MIK</video:title><video:description>Minimum Cost to Make at Least One Valid Path in a Grid | 2 Detailed Approaches | Leetcode 1368 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/NS3C4W_jJJM</video:player_loc><video:duration>3341</video:duration><video:publication_date>2025-01-18T05:01:51.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/course-schedule-iv-leetcode-1462</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ScJNPlYz1J4/hqdefault.jpg</video:thumbnail_loc><video:title>Course Schedule IV | 3 Detailed Approaches | Leetcode 1462 | codestorywithMIK</video:title><video:description>Course Schedule IV | 3 Detailed Approaches | Leetcode 1462 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ScJNPlYz1J4</video:player_loc><video:duration>2853</video:duration><video:publication_date>2025-01-26T01:26:59.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/maximum-number-of-fish-in-a-grid-leetcode-2658</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/kfs9vzv7kHc/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Number of Fish in a Grid | DSU | DFS | BFS | Leetcode 2658 | codestorywithMIK</video:title><video:description>Maximum Number of Fish in a Grid | DSU | DFS | BFS | Leetcode 2658 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/kfs9vzv7kHc</video:player_loc><video:duration>3145</video:duration><video:publication_date>2025-01-28T02:39:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/maximum-employees-to-be-invited-to-a-meeting-leetcode-2127</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/LVV5_MOzdq4/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Employees to Be Invited to a Meeting | Super Detailed | Leetcode 2127 | codestorywithMIK</video:title><video:description>Maximum Employees to Be Invited to a Meeting | Super Detailed | Leetcode 2127 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/LVV5_MOzdq4</video:player_loc><video:duration>4401</video:duration><video:publication_date>2025-01-26T07:56:55.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/redundant-connection-leetcode-684</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/EawxDEOxeIk/hqdefault.jpg</video:thumbnail_loc><video:title>Redundant Connection | DSU | DFS | BFS | Leetcode 684 | codestorywithMIK</video:title><video:description>Redundant Connection | DSU | DFS | BFS | Leetcode 684 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/EawxDEOxeIk</video:player_loc><video:duration>1958</video:duration><video:publication_date>2025-01-29T02:46:56.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/divide-nodes-into-the-maximum-number-of-groups-leetcode-2493</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Iku-NBN2jRE/hqdefault.jpg</video:thumbnail_loc><video:title>Divide Nodes Into the Maximum Number of Groups | Super Detailed | Leetcode 2493 | codestorywithMIK</video:title><video:description>Divide Nodes Into the Maximum Number of Groups | Super Detailed | Leetcode 2493 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Iku-NBN2jRE</video:player_loc><video:duration>3528</video:duration><video:publication_date>2025-01-30T05:50:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/making-a-large-island-leetcode-827</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/iCAC-QrQ-4A/hqdefault.jpg</video:thumbnail_loc><video:title>Making A Large Island | Brute Force | Better | Optimal | Dry Run | Leetcode 827 | codestorywithMIK</video:title><video:description>Making A Large Island | Brute Force | Better | Optimal | Dry Run | Leetcode 827 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/iCAC-QrQ-4A</video:player_loc><video:duration>3768</video:duration><video:publication_date>2025-01-31T02:57:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/most-profitable-path-in-a-tree-leetcode-2467</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/uJiDHHChF58/hqdefault.jpg</video:thumbnail_loc><video:title>Most Profitable Path in a Tree | BFS | DFS | Detailed | Leetcode 2467 | codestorywithMIK</video:title><video:description>Most Profitable Path in a Tree | BFS | DFS | Detailed | Leetcode 2467 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/uJiDHHChF58</video:player_loc><video:duration>2685</video:duration><video:publication_date>2025-02-24T06:37:53.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/find-all-possible-recipes-from-given-supplies-leetcode-2115</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/4Tixc5mU-Pk/hqdefault.jpg</video:thumbnail_loc><video:title>Find All Possible Recipes from Given Supplies | Brute Force | Optimal | Leetcode 2115</video:title><video:description>Find All Possible Recipes from Given Supplies | Brute Force | Optimal | Leetcode 2115. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/4Tixc5mU-Pk</video:player_loc><video:duration>2242</video:duration><video:publication_date>2025-03-21T07:26:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/count-the-number-of-complete-components-leetcode-2685</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/7b7GbuFMWRw/hqdefault.jpg</video:thumbnail_loc><video:title>Count the Number of Complete Components | Multiple Approaches | Leetcode 2685 | codestorywithMIK</video:title><video:description>Count the Number of Complete Components | Multiple Approaches | Leetcode 2685 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/7b7GbuFMWRw</video:player_loc><video:duration>2917</video:duration><video:publication_date>2025-03-22T04:47:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/number-of-ways-to-arrive-at-destination-leetcode-1976</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/F_jnqx14idY/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Ways to Arrive at Destination | Straight Forward Simple | Leetcode 1976 | codestorywithMIK</video:title><video:description>Number of Ways to Arrive at Destination | Straight Forward Simple | Leetcode 1976 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/F_jnqx14idY</video:player_loc><video:duration>1834</video:duration><video:publication_date>2025-03-23T04:50:57.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/find-minimum-time-to-reach-last-room-i-leetcode-3341</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/bvfBnQo5qiY/hqdefault.jpg</video:thumbnail_loc><video:title>Find Minimum Time to Reach Last Room I | Detailed Explanation | Leetcode 3341 | codestorywithMIK</video:title><video:description>Find Minimum Time to Reach Last Room I | Detailed Explanation | Leetcode 3341 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/bvfBnQo5qiY</video:player_loc><video:duration>2250</video:duration><video:publication_date>2025-05-07T02:23:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/find-minimum-time-to-reach-last-room-ii-leetcode-3342</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/SVTezUTAKMk/hqdefault.jpg</video:thumbnail_loc><video:title>Find Minimum Time to Reach Last Room II | Using Same Code | Leetcode 3342 | codestorywithMIK</video:title><video:description>Find Minimum Time to Reach Last Room II | Using Same Code | Leetcode 3342 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/SVTezUTAKMk</video:player_loc><video:duration>1119</video:duration><video:publication_date>2025-05-08T01:56:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/maximize-the-number-of-target-nodes-after-connecting-trees-i-leetcode-3372</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/tGtXUkUbYfo/hqdefault.jpg</video:thumbnail_loc><video:title>Maximize the Number of Target Nodes After Connecting Trees I | BFS | DFS | Leetcode 3372 | MIK</video:title><video:description>Maximize the Number of Target Nodes After Connecting Trees I | BFS | DFS | Leetcode 3372 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/tGtXUkUbYfo</video:player_loc><video:duration>2853</video:duration><video:publication_date>2025-05-28T04:59:25.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/maximize-the-number-of-target-nodes-after-connecting-trees-leetcode-3373</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/W1xTqEcoSkI/hqdefault.jpg</video:thumbnail_loc><video:title>Maximize the Number of Target Nodes After Connecting Trees II | Full Dry Run | Leetcode 3373 | MIK</video:title><video:description>Maximize the Number of Target Nodes After Connecting Trees II | Full Dry Run | Leetcode 3373 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/W1xTqEcoSkI</video:player_loc><video:duration>2900</video:duration><video:publication_date>2025-05-29T12:16:41.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/maximum-candies-you-can-get-from-boxes-leetcode-1298</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/fGa9jczRS2o/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Candies You Can Get from Boxes | 2 Ways | Simple Intuition | Leetcode 1298 |codestorywithMIK</video:title><video:description>Maximum Candies You Can Get from Boxes | 2 Ways | Simple Intuition | Leetcode 1298 |codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/fGa9jczRS2o</video:player_loc><video:duration>2341</video:duration><video:publication_date>2025-06-03T02:44:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/minimum-score-after-removals-on-a-tree-leetcode-2322</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/3IomMslYOOY/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Score After Removals on a Tree | Detailed Explanation | Leetcode 2322 | codestorywithMIK</video:title><video:description>Minimum Score After Removals on a Tree | Detailed Explanation | Leetcode 2322 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/3IomMslYOOY</video:player_loc><video:duration>3190</video:duration><video:publication_date>2025-07-24T12:06:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/swim-in-rising-water-leetcode-778</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9WYhuzn8hd8/hqdefault.jpg</video:thumbnail_loc><video:title>Swim in Rising Water | Different Ways To Think | Intuitive | Leetcode 778 | codestorywithMIK</video:title><video:description>Swim in Rising Water | Different Ways To Think | Intuitive | Leetcode 778 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9WYhuzn8hd8</video:player_loc><video:duration>1641</video:duration><video:publication_date>2025-10-06T09:27:56.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/lexicographically-smallest-string-after-applying-operations-leetcode-1625</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/SUkbctHiREI/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode 1625 | Lexicographically Smallest String After Applying Operations | Common Pattern | MIK</video:title><video:description>Leetcode 1625 | Lexicographically Smallest String After Applying Operations | Common Pattern | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/SUkbctHiREI</video:player_loc><video:duration>1848</video:duration><video:publication_date>2025-10-19T06:12:13.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/power-grid-maintenance-leetcode-3607</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ylJ2lDHUBZA/hqdefault.jpg</video:thumbnail_loc><video:title>Power Grid Maintenance | Simplest Solution | Intuition | Dry Run | Leetcode 3607 | codestorywithMIK</video:title><video:description>Power Grid Maintenance | Simplest Solution | Intuition | Dry Run | Leetcode 3607 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ylJ2lDHUBZA</video:player_loc><video:duration>2701</video:duration><video:publication_date>2025-11-06T13:35:58.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/power-grid-maintenance-leetcode-3607-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/R85fl-ku9WQ/hqdefault.jpg</video:thumbnail_loc><video:title>Power Grid Maintenance | Using DSU | Simplest Explanation | Leetcode 3607 | codestorywithMIK</video:title><video:description>Power Grid Maintenance | Using DSU | Simplest Explanation | Leetcode 3607 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/R85fl-ku9WQ</video:player_loc><video:duration>1843</video:duration><video:publication_date>2025-11-07T12:50:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/maximum-number-of-k-divisible-components-leetcode-2872</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/RnFCrjkkIUE/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Number of K-Divisible Components | Easiest Explanation | Dry Run | Leetcode 2872 | MIK</video:title><video:description>Maximum Number of K-Divisible Components | Easiest Explanation | Dry Run | Leetcode 2872 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/RnFCrjkkIUE</video:player_loc><video:duration>1615</video:duration><video:publication_date>2025-11-28T11:18:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/minimum-cost-path-with-edge-reversals-leetcode-3650</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/3jFf14bG2JU/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Cost Path with Edge Reversals | Easiest Explanation | Leetcode 3650 | codestorywithMIK</video:title><video:description>Minimum Cost Path with Edge Reversals | Easiest Explanation | Leetcode 3650 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/3jFf14bG2JU</video:player_loc><video:duration>957</video:duration><video:publication_date>2026-01-27T07:01:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/minimum-cost-to-convert-string-ii-leetcode-2977</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/wiJaMH1CMhw/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Cost to Convert String II | Simplified Explanation | Intuition | Leetcode 2977 | MIK</video:title><video:description>Minimum Cost to Convert String II | Simplified Explanation | Intuition | Leetcode 2977 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/wiJaMH1CMhw</video:player_loc><video:duration>2983</video:duration><video:publication_date>2026-01-30T06:55:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/minimum-operations-to-equalize-binary-string-leetcode-3666</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/cH6VFgRaRW0/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Operations to Equalize Binary String | Brute Force | Optimal | Intuition | Leetcode 3666</video:title><video:description>Minimum Operations to Equalize Binary String | Brute Force | Optimal | Intuition | Leetcode 3666. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/cH6VFgRaRW0</video:player_loc><video:duration>4384</video:duration><video:publication_date>2026-02-27T02:30:52.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/maximize-spanning-tree-stability-with-upgrades-leetcode-3600</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/BZ-dn_2oupQ/hqdefault.jpg</video:thumbnail_loc><video:title>Maximize Spanning Tree Stability with Upgrades | Detailed | Broken Down | Leetcode 3600 | MIK</video:title><video:description>Maximize Spanning Tree Stability with Upgrades | Detailed | Broken Down | Leetcode 3600 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/BZ-dn_2oupQ</video:player_loc><video:duration>2554</video:duration><video:publication_date>2026-03-12T03:45:49.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/minimize-hamming-distance-after-swap-operations-leetcode-1722</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/r0s0BtmTxWk/hqdefault.jpg</video:thumbnail_loc><video:title>Minimize Hamming Distance After Swap Operations | Detailed | Simple Steps | Leetcode 1722 | MIK</video:title><video:description>Minimize Hamming Distance After Swap Operations | Detailed | Simple Steps | Leetcode 1722 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/r0s0BtmTxWk</video:player_loc><video:duration>2248</video:duration><video:publication_date>2026-04-21T12:54:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/detect-cycles-in-2d-grid-leetcode-1559</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/gpHzIs3xXkU/hqdefault.jpg</video:thumbnail_loc><video:title>Detect Cycles in 2D Grid | Multiple Ways to Solve | Simplified Explanation | Leetcode 1559 | MIK</video:title><video:description>Detect Cycles in 2D Grid | Multiple Ways to Solve | Simplified Explanation | Leetcode 1559 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/gpHzIs3xXkU</video:player_loc><video:duration>1560</video:duration><video:publication_date>2026-04-26T06:14:41.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/check-if-there-is-a-valid-path-in-a-grid-leetcode-1391</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/KVm0XBHxQtQ/hqdefault.jpg</video:thumbnail_loc><video:title>Check if There is a Valid Path in a Grid | Simplified to Easy | Leetcode 1391 | codestorywithMIK</video:title><video:description>Check if There is a Valid Path in a Grid | Simplified to Easy | Leetcode 1391 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/KVm0XBHxQtQ</video:player_loc><video:duration>1385</video:duration><video:publication_date>2026-04-27T03:10:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/minimum-jumps-to-reach-end-via-prime-teleportation-leetcode-3629</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/lP3TWBQv1zs/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Jumps to Reach End via Prime Teleportation | Simplified | Leetcode 3629 | codestorywithMIK</video:title><video:description>Minimum Jumps to Reach End via Prime Teleportation | Simplified | Leetcode 3629 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/lP3TWBQv1zs</video:player_loc><video:duration>1734</video:duration><video:publication_date>2026-05-08T04:47:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/network-recovery-pathways-leetcode-3620</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/sDdQ1-9TNP0/hqdefault.jpg</video:thumbnail_loc><video:title>Network Recovery Pathways | Detailed Explanation | Simplified | Leetcode 3620 | codestorywithMIK</video:title><video:description>Network Recovery Pathways | Detailed Explanation | Simplified | Leetcode 3620 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/sDdQ1-9TNP0</video:player_loc><video:duration>2592</video:duration><video:publication_date>2026-07-03T07:54:49.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/path-existence-queries-in-a-graph-i-leetcode-3532</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/jMCxNXLHKGE/hqdefault.jpg</video:thumbnail_loc><video:title>Path Existence Queries in a Graph I | Multiple Approaches | Simplified | Leetcode 3532 | MIK</video:title><video:description>Path Existence Queries in a Graph I | Multiple Approaches | Simplified | Leetcode 3532 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/jMCxNXLHKGE</video:player_loc><video:duration>1636</video:duration><video:publication_date>2026-07-09T14:54:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/remove-methods-from-project-leetcode-3310</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/2D13j9J62g4/hqdefault.jpg</video:thumbnail_loc><video:title>Remove Methods From Project | Simple Approach | Dry Run | Leetcode 3310 | codestorywithMIK</video:title><video:description>Remove Methods From Project | Simple Approach | Dry Run | Leetcode 3310 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/2D13j9J62g4</video:player_loc><video:duration>1398</video:duration><video:publication_date>2026-08-05T06:33:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/graphs/find-center-of-star-graph-leetcode-1791</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Sp9kcIX0Ep0/hqdefault.jpg</video:thumbnail_loc><video:title>Find Center of Star Graph | 2 Simple Approaches | Leetcode 1791 | codestorywithMIK</video:title><video:description>Find Center of Star Graph | 2 Simple Approaches | Leetcode 1791 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Sp9kcIX0Ep0</video:player_loc><video:duration>711</video:duration><video:publication_date>2024-06-27T01:22:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/introduction</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/WTtuOj6FXE8/hqdefault.jpg</video:thumbnail_loc><video:title>Introduction | Binary Lifting | DP On Trees | Concepts &amp; Questions - 1 | codestorywithMIK</video:title><video:description>Introduction | Binary Lifting | DP On Trees | Concepts &amp; Questions - 1 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/WTtuOj6FXE8</video:player_loc><video:duration>2475</video:duration><video:publication_date>2026-06-12T05:57:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/lowest-common-ancestor</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/k5tS37rLCBs/hqdefault.jpg</video:thumbnail_loc><video:title>Lowest Common Ancestor | Reusable Template | Binary Lifting | Concepts &amp; Questions - 3 | MIK</video:title><video:description>Lowest Common Ancestor | Reusable Template | Binary Lifting | Concepts &amp; Questions - 3 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/k5tS37rLCBs</video:player_loc><video:duration>1543</video:duration><video:publication_date>2026-06-12T14:11:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/roadmap-for-dp</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/7eLMOE1jnls/hqdefault.jpg</video:thumbnail_loc><video:title>Roadmap for DP | How to Start DP ? | Topics in DP | DP Concepts &amp; Qns - 1</video:title><video:description>Roadmap for DP | How to Start DP ? | Topics in DP | DP Concepts &amp; Qns - 1. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/7eLMOE1jnls</video:player_loc><video:duration>366</video:duration><video:publication_date>2023-05-21T15:25:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/introduction-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5LbcUNIy2mw/hqdefault.jpg</video:thumbnail_loc><video:title>Introduction | DP On Grids | Part 1 | DP Concepts &amp; Qns-29 | codestorywithMIK</video:title><video:description>Introduction | DP On Grids | Part 1 | DP Concepts &amp; Qns-29 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5LbcUNIy2mw</video:player_loc><video:duration>893</video:duration><video:publication_date>2024-12-15T23:30:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/introduction-3</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/-B8hWstTp20/hqdefault.jpg</video:thumbnail_loc><video:title>Introduction | DP On Grids | Part 2 | DP Concepts &amp; Qns-30 | codestorywithMIK</video:title><video:description>Introduction | DP On Grids | Part 2 | DP Concepts &amp; Qns-30 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/-B8hWstTp20</video:player_loc><video:duration>403</video:duration><video:publication_date>2024-12-16T23:30:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/introduction-4</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/_lHjhqJNoIQ/hqdefault.jpg</video:thumbnail_loc><video:title>Introduction | Knapsack Series | Introduction | Video 1 | DP Concepts &amp; Qns-36 | codestorywithMIK</video:title><video:description>Introduction | Knapsack Series | Introduction | Video 1 | DP Concepts &amp; Qns-36 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/_lHjhqJNoIQ</video:player_loc><video:duration>642</video:duration><video:publication_date>2025-08-23T15:07:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/kth-ancestor-of-a-tree-node-leetcode-1483</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/uYe-t4NWyLo/hqdefault.jpg</video:thumbnail_loc><video:title>Kth Ancestor of a Tree Node | Leetcode 1483 | Binary Lifting | Concepts &amp; Questions - 2 | MIK</video:title><video:description>Kth Ancestor of a Tree Node | Leetcode 1483 | Binary Lifting | Concepts &amp; Questions - 2 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/uYe-t4NWyLo</video:player_loc><video:duration>1545</video:duration><video:publication_date>2026-06-12T10:40:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/number-of-ways-to-assign-edge-weights-ii-leetcode-3559</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Ba72TfSC0Dw/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Ways to Assign Edge Weights II | Leetcode 3559 | Binary Lifting | Concepts &amp; Questions - 4</video:title><video:description>Number of Ways to Assign Edge Weights II | Leetcode 3559 | Binary Lifting | Concepts &amp; Questions - 4. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Ba72TfSC0Dw</video:player_loc><video:duration>2333</video:duration><video:publication_date>2026-06-12T15:46:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/path-existence-queries-in-a-graph-ii-leetcode-3534</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QL8ZNyBOzp0/hqdefault.jpg</video:thumbnail_loc><video:title>Path Existence Queries in a Graph II | Leetcode 3534 | Binary Lifting | Concepts &amp; Questions - 5</video:title><video:description>Path Existence Queries in a Graph II | Leetcode 3534 | Binary Lifting | Concepts &amp; Questions - 5. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QL8ZNyBOzp0</video:player_loc><video:duration>4256</video:duration><video:publication_date>2026-07-10T15:55:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/fibonacci-number-leetcode-509</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/UhxNiImCzdY/hqdefault.jpg</video:thumbnail_loc><video:title>Fibonacci Number  | Recur + Memo | Bottom Up | DP Concepts &amp; Qns - 2 | Leetcode-509</video:title><video:description>Fibonacci Number  | Recur + Memo | Bottom Up | DP Concepts &amp; Qns - 2 | Leetcode-509. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/UhxNiImCzdY</video:player_loc><video:duration>2278</video:duration><video:publication_date>2023-05-23T18:07:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/climbing-stairs-leetcode-70</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/L8-f-sebdx4/hqdefault.jpg</video:thumbnail_loc><video:title>Climbing Stairs | Recur + Memo | Bottom Up | DP Concepts &amp; Qns - 3 | Leetcode-70</video:title><video:description>Climbing Stairs | Recur + Memo | Bottom Up | DP Concepts &amp; Qns - 3 | Leetcode-70. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/L8-f-sebdx4</video:player_loc><video:duration>6</video:duration><video:publication_date>2023-05-28T19:23:52.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/house-robber-leetcode-198</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/N7KkHUhqEew/hqdefault.jpg</video:thumbnail_loc><video:title>House Robber | Recur + Memo | Bottom Up | DP Concepts &amp; Qns - 4 | Leetcode-198</video:title><video:description>House Robber | Recur + Memo | Bottom Up | DP Concepts &amp; Qns - 4 | Leetcode-198. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/N7KkHUhqEew</video:player_loc><video:duration>6</video:duration><video:publication_date>2023-05-28T19:33:52.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/house-robber-ii-leetcode-213</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5AxMZBirNKo/hqdefault.jpg</video:thumbnail_loc><video:title>House Robber II | Recur + Memo | DP Concepts &amp; Qns - 5 | Leetcode-213</video:title><video:description>House Robber II | Recur + Memo | DP Concepts &amp; Qns - 5 | Leetcode-213. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5AxMZBirNKo</video:player_loc><video:duration>903</video:duration><video:publication_date>2023-06-04T17:15:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/house-robber-ii-leetcode-213-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Sobml7FprQ0/hqdefault.jpg</video:thumbnail_loc><video:title>House Robber II | BOTTOM UP | DP Concepts &amp; Qns - 6 | Leetcode-213</video:title><video:description>House Robber II | BOTTOM UP | DP Concepts &amp; Qns - 6 | Leetcode-213. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Sobml7FprQ0</video:player_loc><video:duration>990</video:duration><video:publication_date>2023-06-13T18:32:38.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/house-robber-leetcode-198-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/oeYLF-u2DIA/hqdefault.jpg</video:thumbnail_loc><video:title>House Robber I | Constant Space | DP Concepts &amp; Qns - 7 | Leetcode 198</video:title><video:description>House Robber I | Constant Space | DP Concepts &amp; Qns - 7 | Leetcode 198. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/oeYLF-u2DIA</video:player_loc><video:duration>723</video:duration><video:publication_date>2023-06-21T01:04:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/house-robber-ii-leetcode-213-3</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/OyX8uPu7LvU/hqdefault.jpg</video:thumbnail_loc><video:title>House Robber II | Constant Space | DP Concepts &amp; Qns - 8 | Leetcode-213</video:title><video:description>House Robber II | Constant Space | DP Concepts &amp; Qns - 8 | Leetcode-213. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/OyX8uPu7LvU</video:player_loc><video:duration>590</video:duration><video:publication_date>2023-06-26T13:44:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/maximum-alternating-subsequence-sum-leetcode-1911</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/bRk0n5JyXSc/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Alternating Subsequence Sum |Recursion &amp; Memo|Tree Diagram|DP Concepts &amp; Qns-9|Leetcode-1911</video:title><video:description>Maximum Alternating Subsequence Sum |Recursion &amp; Memo|Tree Diagram|DP Concepts &amp; Qns-9|Leetcode-1911. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/bRk0n5JyXSc</video:player_loc><video:duration>1604</video:duration><video:publication_date>2023-07-13T18:15:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/maximum-alternating-subsequence-sum-leetcode-1911-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/eKo0TzMDeEo/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Alternating Subsequence Sum | BOTTOM UP | INTUITION | DP Concepts &amp; Qns - 10 | Leetcode-1911</video:title><video:description>Maximum Alternating Subsequence Sum | BOTTOM UP | INTUITION | DP Concepts &amp; Qns - 10 | Leetcode-1911. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/eKo0TzMDeEo</video:player_loc><video:duration>1558</video:duration><video:publication_date>2023-07-17T19:52:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/longest-increasing-subsequence-leetcode-300</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/DG50PJIx2SM/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Increasing Subsequence | Recursion &amp; Memo |Tree Diagram |DP Concepts &amp; Qns-11 | Leetcode-300</video:title><video:description>Longest Increasing Subsequence | Recursion &amp; Memo |Tree Diagram |DP Concepts &amp; Qns-11 | Leetcode-300. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/DG50PJIx2SM</video:player_loc><video:duration>1947</video:duration><video:publication_date>2023-08-08T15:25:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/longest-increasing-subsequence-leetcode-300-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/h9rm4N8XbL0/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Increasing Subsequence | BOTTOM UP | FULL INTUITION | DP Concepts &amp; Qns - 12 | Leetcode-300</video:title><video:description>Longest Increasing Subsequence | BOTTOM UP | FULL INTUITION | DP Concepts &amp; Qns - 12 | Leetcode-300. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/h9rm4N8XbL0</video:player_loc><video:duration>1882</video:duration><video:publication_date>2023-08-12T17:30:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/maximum-length-of-pair-chain-leetcode-646</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/DlgGx8GRo9M/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Length of Pair Chain | Same as LIS | FULL INTUITION | DP Concepts &amp; Qns - 13 | Leetcode-646</video:title><video:description>Maximum Length of Pair Chain | Same as LIS | FULL INTUITION | DP Concepts &amp; Qns - 13 | Leetcode-646. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/DlgGx8GRo9M</video:player_loc><video:duration>1364</video:duration><video:publication_date>2023-08-26T04:05:48.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/longest-string-chain-leetcode-1048</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/HtTVSgs5ViE/hqdefault.jpg</video:thumbnail_loc><video:title>Longest String Chain | Same as LIS | FULL INTUITION | DP Concepts &amp; Qns - 14 | Leetcode-1048</video:title><video:description>Longest String Chain | Same as LIS | FULL INTUITION | DP Concepts &amp; Qns - 14 | Leetcode-1048. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/HtTVSgs5ViE</video:player_loc><video:duration>1793</video:duration><video:publication_date>2023-09-23T05:47:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/build-array-where-you-can-find-the-maximum-exactly-k-leetcode-1420</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YU9IGG5PB2Y/hqdefault.jpg</video:thumbnail_loc><video:title>Build Array Where You Can Find The Maximum Exactly K Comparisons | DP Concepts 15 |Leetcode 1420</video:title><video:description>Build Array Where You Can Find The Maximum Exactly K Comparisons | DP Concepts 15 |Leetcode 1420. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YU9IGG5PB2Y</video:player_loc><video:duration>1933</video:duration><video:publication_date>2023-10-07T11:41:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/maximum-balanced-subsequence-sum-leetcode-2926</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/JrG4tbq6efg/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Balanced Subsequence Sum | Super Detailed Video | DP Concepts &amp; Qns-16 | Leetcode-2926</video:title><video:description>Maximum Balanced Subsequence Sum | Super Detailed Video | DP Concepts &amp; Qns-16 | Leetcode-2926. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/JrG4tbq6efg</video:player_loc><video:duration>4741</video:duration><video:publication_date>2023-11-09T17:27:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/longest-increasing-subsequence-leetcode-300-3</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/dWmh3O8uX8A/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Increasing Subsequence | Patience Sorting | DP Concepts &amp; Qns-17 | Leetcode 300</video:title><video:description>Longest Increasing Subsequence | Patience Sorting | DP Concepts &amp; Qns-17 | Leetcode 300. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/dWmh3O8uX8A</video:player_loc><video:duration>1243</video:duration><video:publication_date>2024-01-05T07:10:45.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/largest-divisible-subset-leetcode-368</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/T-Fk9185a68/hqdefault.jpg</video:thumbnail_loc><video:title>Largest Divisible Subset | LIS Variant | DP Concepts &amp; Qns-18 | Leetcode-368</video:title><video:description>Largest Divisible Subset | LIS Variant | DP Concepts &amp; Qns-18 | Leetcode-368. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/T-Fk9185a68</video:player_loc><video:duration>2741</video:duration><video:publication_date>2024-02-09T05:13:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/print-longest-common-subsequence</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/cVIOzjfxdbU/hqdefault.jpg</video:thumbnail_loc><video:title>Print Longest Common Subsequence | DP On Strings | DP Concepts &amp; Qns-19</video:title><video:description>Print Longest Common Subsequence | DP On Strings | DP Concepts &amp; Qns-19. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/cVIOzjfxdbU</video:player_loc><video:duration>1986</video:duration><video:publication_date>2024-02-29T10:53:25.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/shortest-common-supersequence</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/MTCvNG4Zfd8/hqdefault.jpg</video:thumbnail_loc><video:title>Shortest Common Supersequence  | 3 Approaches | DP On Strings |DP Concepts &amp; Qns 20|codestorywithMIK</video:title><video:description>Shortest Common Supersequence  | 3 Approaches | DP On Strings |DP Concepts &amp; Qns 20|codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/MTCvNG4Zfd8</video:player_loc><video:duration>3186</video:duration><video:publication_date>2024-03-16T13:46:34.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/shortest-common-supersequence-leetcode-1092</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/fGKk7DtQAmM/hqdefault.jpg</video:thumbnail_loc><video:title>Print Shortest Common Supersequence | DP On Strings | Leetcode 1092 | DP Concepts &amp; Qns-21</video:title><video:description>Print Shortest Common Supersequence | DP On Strings | Leetcode 1092 | DP Concepts &amp; Qns-21. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/fGKk7DtQAmM</video:player_loc><video:duration>1596</video:duration><video:publication_date>2024-04-06T13:22:35.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/edit-distance-leetcode-72</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/oqfqPEqrKo8/hqdefault.jpg</video:thumbnail_loc><video:title>Edit Distance | Recursion | Memo | Bottom Up | DP On Strings | Leetcode 72 | DP Concepts &amp; Qns-22</video:title><video:description>Edit Distance | Recursion | Memo | Bottom Up | DP On Strings | Leetcode 72 | DP Concepts &amp; Qns-22. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/oqfqPEqrKo8</video:player_loc><video:duration>3492</video:duration><video:publication_date>2024-04-15T02:20:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/palindromic-substrings-leetcode-647</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/jCK_y0h8VVE/hqdefault.jpg</video:thumbnail_loc><video:title>Palindromic Substrings | Recursion | Memo | Bottom Up | DP On Strings | Leetcode 647 |DP Concepts-23</video:title><video:description>Palindromic Substrings | Recursion | Memo | Bottom Up | DP On Strings | Leetcode 647 |DP Concepts-23. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/jCK_y0h8VVE</video:player_loc><video:duration>2724</video:duration><video:publication_date>2024-05-11T18:17:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/longest-palindromic-substring-leetcode-5</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ij3X5SAhf_0/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Palindromic Substring | Recursion Memo | Bottom Up | DP On Strings | Leetcode 5</video:title><video:description>Longest Palindromic Substring | Recursion Memo | Bottom Up | DP On Strings | Leetcode 5. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ij3X5SAhf_0</video:player_loc><video:duration>2852</video:duration><video:publication_date>2024-06-29T17:48:59.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/longest-palindromic-subsequence-leetcode-516</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/WIhQ5NOzCKM/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Palindromic Subsequence | Using Blue Print | DP On Strings | Leetcode 516 | DP Concepts - 25</video:title><video:description>Longest Palindromic Subsequence | Using Blue Print | DP On Strings | Leetcode 516 | DP Concepts - 25. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/WIhQ5NOzCKM</video:player_loc><video:duration>1025</video:duration><video:publication_date>2024-07-01T05:25:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/minimum-insertion-steps-to-make-a-string-palindrome-leetcode-1312</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/jEDPdAwnxV0/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Insertion Steps to Make a String Palindrome | Blue Print | DP On Strings | Leetcode 1312</video:title><video:description>Minimum Insertion Steps to Make a String Palindrome | Blue Print | DP On Strings | Leetcode 1312. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/jEDPdAwnxV0</video:player_loc><video:duration>1623</video:duration><video:publication_date>2024-07-13T14:14:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/palindrome-partitioning-leetcode-131</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/pxaqbkMxdBA/hqdefault.jpg</video:thumbnail_loc><video:title>Palindrome Partitioning | Using Blue Print | DP On Strings | Leetcode 131 | DP Concepts &amp; Qns-27</video:title><video:description>Palindrome Partitioning | Using Blue Print | DP On Strings | Leetcode 131 | DP Concepts &amp; Qns-27. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/pxaqbkMxdBA</video:player_loc><video:duration>2156</video:duration><video:publication_date>2024-07-20T11:24:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/palindrome-partitioning-ii-leetcode-132</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/XSe1_koFPzo/hqdefault.jpg</video:thumbnail_loc><video:title>Palindrome Partitioning II | Using Blue Print | DP On Strings | Leetcode 132 | DP Concepts &amp; Qns-28</video:title><video:description>Palindrome Partitioning II | Using Blue Print | DP On Strings | Leetcode 132 | DP Concepts &amp; Qns-28. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/XSe1_koFPzo</video:player_loc><video:duration>3426</video:duration><video:publication_date>2024-08-31T01:39:39.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/unique-paths-leetcode-62</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QDVxAf_hqRQ/hqdefault.jpg</video:thumbnail_loc><video:title>Unique Paths | Recursion | Memo | Bottom Up | Leetcode 62 | DP On Grids | codestorywithMIK</video:title><video:description>Unique Paths | Recursion | Memo | Bottom Up | Leetcode 62 | DP On Grids | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QDVxAf_hqRQ</video:player_loc><video:duration>2310</video:duration><video:publication_date>2024-12-17T23:30:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/unique-paths-ii-leetcode-63</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9RUpue4oMx4/hqdefault.jpg</video:thumbnail_loc><video:title>Unique Paths II | Recursion | Memo | Bottom Up | Leetcode 63 | DP On Grids | codestorywithMIK</video:title><video:description>Unique Paths II | Recursion | Memo | Bottom Up | Leetcode 63 | DP On Grids | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9RUpue4oMx4</video:player_loc><video:duration>2742</video:duration><video:publication_date>2024-12-26T11:11:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/maximum-non-negative-product-in-a-matrix-leetcode-1594</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/l2_da8_l1jw/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Non Negative Product in a Matrix | Recursion | Memo | Bottom Up | Leetcode 1594 |DP On Grids</video:title><video:description>Maximum Non Negative Product in a Matrix | Recursion | Memo | Bottom Up | Leetcode 1594 |DP On Grids. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/l2_da8_l1jw</video:player_loc><video:duration>4062</video:duration><video:publication_date>2025-01-02T11:30:34.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/dungeon-game-leetcode-174</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Mlcy-9hB6Jc/hqdefault.jpg</video:thumbnail_loc><video:title>Dungeon Game | Brute Force | Recursion | Memo | Bottom Up | Leetcode 174 | DP On Grids | MIK</video:title><video:description>Dungeon Game | Brute Force | Recursion | Memo | Bottom Up | Leetcode 174 | DP On Grids | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Mlcy-9hB6Jc</video:player_loc><video:duration>4530</video:duration><video:publication_date>2025-05-10T22:30:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/find-the-maximum-number-of-fruits-collected-leetcode-3363</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/K9-ZV-_UJ0Q/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Maximum Number of Fruits Collected | Recursion | Bottom Up | Leetcode 3363 | DP On Grids</video:title><video:description>Find the Maximum Number of Fruits Collected | Recursion | Bottom Up | Leetcode 3363 | DP On Grids. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/K9-ZV-_UJ0Q</video:player_loc><video:duration>4158</video:duration><video:publication_date>2025-08-07T12:39:56.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/fractional-knapsack</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/TGzyArbMu7w/hqdefault.jpg</video:thumbnail_loc><video:title>Fractional Knapsack | Knapsack Series | Video 2 | DP Concepts &amp; Qns-37 | codestorywithMIK</video:title><video:description>Fractional Knapsack | Knapsack Series | Video 2 | DP Concepts &amp; Qns-37 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/TGzyArbMu7w</video:player_loc><video:duration>1301</video:duration><video:publication_date>2025-08-31T14:39:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/0-1-knapsack</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/97ogFz0NkAo/hqdefault.jpg</video:thumbnail_loc><video:title>0/1 Knapsack | Recursion | Two Ways To Code | Knapsack Series | DP Concepts &amp; Qns-38 |  MIK</video:title><video:description>0/1 Knapsack | Recursion | Two Ways To Code | Knapsack Series | DP Concepts &amp; Qns-38 |  MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/97ogFz0NkAo</video:player_loc><video:duration>1413</video:duration><video:publication_date>2026-03-19T03:49:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/0-1-knapsack-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/XCLN0RgwH0E/hqdefault.jpg</video:thumbnail_loc><video:title>0/1 Knapsack | Bottom Up | Easiest Way | Knapsack Series | DP Concepts &amp; Qns-39 | codestorywithMIK</video:title><video:description>0/1 Knapsack | Bottom Up | Easiest Way | Knapsack Series | DP Concepts &amp; Qns-39 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/XCLN0RgwH0E</video:player_loc><video:duration>1330</video:duration><video:publication_date>2026-03-20T15:29:57.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/0-1-knapsack-3</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ztTME5yhYCw/hqdefault.jpg</video:thumbnail_loc><video:title>0/1 Knapsack | Space Optimized Bottom Up | Knapsack Series | DP Concepts &amp; Qns-40 | codestorywithMIK</video:title><video:description>0/1 Knapsack | Space Optimized Bottom Up | Knapsack Series | DP Concepts &amp; Qns-40 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ztTME5yhYCw</video:player_loc><video:duration>696</video:duration><video:publication_date>2026-03-29T10:02:58.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/subset-sum-problem</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Ni9RwDZdzrU/hqdefault.jpg</video:thumbnail_loc><video:title>Subset Sum Problem | Multiple Approaches | Knapsack Series | DP Concepts &amp; Qns-41 | codestorywithMIK</video:title><video:description>Subset Sum Problem | Multiple Approaches | Knapsack Series | DP Concepts &amp; Qns-41 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Ni9RwDZdzrU</video:player_loc><video:duration>1989</video:duration><video:publication_date>2026-04-06T05:05:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/partition-equal-subset-sum-leetcode-416</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/vzMvYxo1AO4/hqdefault.jpg</video:thumbnail_loc><video:title>Partition Equal Subset Sum | Knapsack Series | DP Concepts &amp; Qns-42 | codestorywithMIK</video:title><video:description>Partition Equal Subset Sum | Knapsack Series | DP Concepts &amp; Qns-42 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/vzMvYxo1AO4</video:player_loc><video:duration>1008</video:duration><video:publication_date>2026-04-18T06:27:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/count-subsets-with-sum</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9mN6Te6Tuj0/hqdefault.jpg</video:thumbnail_loc><video:title>Count Subsets with Sum | Knapsack Series | DP Concepts &amp; Qns-43 | codestorywithMIK</video:title><video:description>Count Subsets with Sum | Knapsack Series | DP Concepts &amp; Qns-43 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9mN6Te6Tuj0</video:player_loc><video:duration>2002</video:duration><video:publication_date>2026-08-25T11:55:43.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/partitions-with-given-difference-leetcode</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/nqQ2FOLC_rk/hqdefault.jpg</video:thumbnail_loc><video:title>Partitions with Given Difference leetcode | Knapsack Series | DP Concepts &amp; Qns-44 | MIK</video:title><video:description>Partitions with Given Difference leetcode | Knapsack Series | DP Concepts &amp; Qns-44 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/nqQ2FOLC_rk</video:player_loc><video:duration>809</video:duration><video:publication_date>2026-08-30T14:56:35.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/target-sum-leetcode-494</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/j1rQ10I2YLA/hqdefault.jpg</video:thumbnail_loc><video:title>Target Sum | Leetcode 494 | Knapsack Series | DP Concepts &amp; Qns-45 | codestorywithMIK</video:title><video:description>Target Sum | Leetcode 494 | Knapsack Series | DP Concepts &amp; Qns-45 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/j1rQ10I2YLA</video:player_loc><video:duration>1107</video:duration><video:publication_date>2026-09-27T10:21:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/minimum-difficulty-of-a-job-schedule-leetcode-1335</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/smTnSl6UKi0/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Difficulty of a Job Schedule | Recursion | Memoization | Amazon | Leetcode 1335</video:title><video:description>Minimum Difficulty of a Job Schedule | Recursion | Memoization | Amazon | Leetcode 1335. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/smTnSl6UKi0</video:player_loc><video:duration>1852</video:duration><video:publication_date>2022-10-16T04:51:48.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/maximum-length-of-a-concatenated-string-with-unique-leetcode-1239</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/MqMvkrkerIY/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Length of a Concatenated String with Unique Characters | Amazon | Leetcode 1239</video:title><video:description>Maximum Length of a Concatenated String with Unique Characters | Amazon | Leetcode 1239. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/MqMvkrkerIY</video:player_loc><video:duration>1430</video:duration><video:publication_date>2022-10-24T06:35:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/ugly-number-ii-leetcode-264</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/jRacRh6x4go/hqdefault.jpg</video:thumbnail_loc><video:title>Ugly Number II | Simple Explanation | Dry Run | codestorywithMIK</video:title><video:description>Ugly Number II | Simple Explanation | Dry Run | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/jRacRh6x4go</video:player_loc><video:duration>1869</video:duration><video:publication_date>2022-11-20T01:30:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/perfect-squares-leetcode-279</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Zbn8in7hpXY/hqdefault.jpg</video:thumbnail_loc><video:title>Perfect Squares | Why not Greedy | Recursion | Memo | Leetcode 279</video:title><video:description>Perfect Squares | Why not Greedy | Recursion | Memo | Leetcode 279. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Zbn8in7hpXY</video:player_loc><video:duration>1057</video:duration><video:publication_date>2022-11-22T04:50:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/maximum-profit-in-job-scheduling-leetcode-1235</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/LL0tVxlAeV4/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Profit in Job Scheduling | Recursion | Memoization | Leetcode 1235</video:title><video:description>Maximum Profit in Job Scheduling | Recursion | Memoization | Leetcode 1235. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/LL0tVxlAeV4</video:player_loc><video:duration>1670</video:duration><video:publication_date>2022-11-26T05:57:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/arithmetic-slices-ii-subsequence-leetcode-446</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/cau0JE1q_ZA/hqdefault.jpg</video:thumbnail_loc><video:title>Arithmetic Slices II - Subsequence | Hard Made Easy | Intuition | Leetcode 446</video:title><video:description>Arithmetic Slices II - Subsequence | Hard Made Easy | Intuition | Leetcode 446. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/cau0JE1q_ZA</video:player_loc><video:duration>1764</video:duration><video:publication_date>2022-11-27T08:08:45.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/climbing-stairs-leetcode-70-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/6OjGE04Kx_M/hqdefault.jpg</video:thumbnail_loc><video:title>Climbing Stairs | 3 Approaches | Leetcode 70</video:title><video:description>Climbing Stairs | 3 Approaches | Leetcode 70. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/6OjGE04Kx_M</video:player_loc><video:duration>1729</video:duration><video:publication_date>2022-12-12T04:13:23.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/minimum-falling-path-sum-leetcode-931</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/EQC0ckOyEGs/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Falling Path Sum | Recursion | Memo | Bottom Up | Leetcode 931</video:title><video:description>Minimum Falling Path Sum | Recursion | Memo | Bottom Up | Leetcode 931. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/EQC0ckOyEGs</video:player_loc><video:duration>2936</video:duration><video:publication_date>2022-12-13T08:39:13.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/house-robber-leetcode-198-3</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/SI6Pm8AKqnQ/hqdefault.jpg</video:thumbnail_loc><video:title>House Robber | Recursion | Memo | Bottom Up | Leetcode 198</video:title><video:description>House Robber | Recursion | Memo | Bottom Up | Leetcode 198. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/SI6Pm8AKqnQ</video:player_loc><video:duration>1791</video:duration><video:publication_date>2022-12-14T06:33:56.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/longest-common-subsequence-leetcode-1143</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/aJNu_DLyOxY/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Common Subsequence | Recursion | Memo | Optimal | Leetcode 1143</video:title><video:description>Longest Common Subsequence | Recursion | Memo | Optimal | Leetcode 1143. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/aJNu_DLyOxY</video:player_loc><video:duration>2358</video:duration><video:publication_date>2022-12-15T06:11:17.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/best-time-to-buy-and-sell-stock-with-cooldown-leetcode-309</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/iTvEXpOAyHY/hqdefault.jpg</video:thumbnail_loc><video:title>Best Time to Buy and Sell Stock with Cooldown | Google | Microsoft | Amazon | codestorywithMIK</video:title><video:description>Best Time to Buy and Sell Stock with Cooldown | Google | Microsoft | Amazon | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/iTvEXpOAyHY</video:player_loc><video:duration>3118</video:duration><video:publication_date>2022-12-23T05:48:47.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/domino-and-tromino-tiling-leetcode-790</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Iwmn-gFL3c0/hqdefault.jpg</video:thumbnail_loc><video:title>Domino and Tromino Tiling | Detailed Explanations | Leetcode 790 | codestorywithMIK</video:title><video:description>Domino and Tromino Tiling | Detailed Explanations | Leetcode 790 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Iwmn-gFL3c0</video:player_loc><video:duration>2582</video:duration><video:publication_date>2022-12-24T13:44:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/jump-game-leetcode-55</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/pvg0yrD-E5w/hqdefault.jpg</video:thumbnail_loc><video:title>Jump Game - (Google, Microsoft, Amazon, Ebay, Meta) : Explanation ➕ Live Coding</video:title><video:description>Jump Game - (Google, Microsoft, Amazon, Ebay, Meta) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/pvg0yrD-E5w</video:player_loc><video:duration>2166</video:duration><video:publication_date>2022-12-26T07:20:17.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/flip-string-to-monotone-increasing-leetcode-926</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/mLfcUysjj6I/hqdefault.jpg</video:thumbnail_loc><video:title>Flip String to Monotone Increasing - (GOOGLE) | Recursion+Memo | Explanation ➕ Live Coding</video:title><video:description>Flip String to Monotone Increasing - (GOOGLE) | Recursion+Memo | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/mLfcUysjj6I</video:player_loc><video:duration>1992</video:duration><video:publication_date>2023-01-17T09:17:23.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/flip-string-to-monotone-increasing-leetcode-926-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/NlTjorKsn-Y/hqdefault.jpg</video:thumbnail_loc><video:title>Flip String to Monotone Increasing - (GOOGLE) | Optimal | Explanation ➕ Live Coding</video:title><video:description>Flip String to Monotone Increasing - (GOOGLE) | Optimal | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/NlTjorKsn-Y</video:player_loc><video:duration>957</video:duration><video:publication_date>2023-01-17T13:58:45.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/minimum-path-sum-leetcode-64</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/6aML2-rJJik/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Path Sum | Recursion | Bottom Up | Leetcode 64 | codestorywithMIK</video:title><video:description>Minimum Path Sum | Recursion | Bottom Up | Leetcode 64 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/6aML2-rJJik</video:player_loc><video:duration>2074</video:duration><video:publication_date>2023-03-27T12:11:34.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/minimum-cost-for-tickets-leetcode-983</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YrCTd8p5-bY/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Cost For Tickets | Recursion | Memo | Bottom Up | Leetcode-983 | codestorywithMIK</video:title><video:description>Minimum Cost For Tickets | Recursion | Memo | Bottom Up | Leetcode-983 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YrCTd8p5-bY</video:player_loc><video:duration>2787</video:duration><video:publication_date>2023-03-28T12:08:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/reducing-dishes-leetcode-1402</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/JIdXXP9VjDE/hqdefault.jpg</video:thumbnail_loc><video:title>Reducing Dishes - (MICROSOFT) | Leetcode-1402 | 2 Approaches | Explanation ➕ Live Coding</video:title><video:description>Reducing Dishes - (MICROSOFT) | Leetcode-1402 | 2 Approaches | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/JIdXXP9VjDE</video:player_loc><video:duration>2106</video:duration><video:publication_date>2023-03-29T11:38:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/scramble-string-leetcode-87</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Fx96uB9EIDQ/hqdefault.jpg</video:thumbnail_loc><video:title>Scramble String - (GOOGLE) | Leetcode-87 | Explanation ➕ Live Coding</video:title><video:description>Scramble String - (GOOGLE) | Leetcode-87 | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Fx96uB9EIDQ</video:player_loc><video:duration>2076</video:duration><video:publication_date>2023-03-30T15:46:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/number-of-ways-of-cutting-a-pizza-leetcode-1444</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YZzJrQQP-Pk/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Ways of Cutting a Pizza - (Google, TikTok) | Leetcode-1444 | Explanation ➕ Live Coding</video:title><video:description>Number of Ways of Cutting a Pizza - (Google, TikTok) | Leetcode-1444 | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YZzJrQQP-Pk</video:player_loc><video:duration>3983</video:duration><video:publication_date>2023-03-31T09:49:43.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/longest-palindromic-subsequence-leetcode-516-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/M4pfB3G-YQc/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Palindromic Subsequence | Recursion | Memo | Bottom Up | Leetcode 516</video:title><video:description>Longest Palindromic Subsequence | Recursion | Memo | Bottom Up | Leetcode 516. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/M4pfB3G-YQc</video:player_loc><video:duration>1000</video:duration><video:publication_date>2023-04-14T06:46:43.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/maximum-value-of-k-coins-from-piles-leetcode-2218</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/sH276uTmZ80/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Value of K Coins From Piles | META | Leetcode-2218 | codestorywithMIK</video:title><video:description>Maximum Value of K Coins From Piles | META | Leetcode-2218 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/sH276uTmZ80</video:player_loc><video:duration>1980</video:duration><video:publication_date>2023-04-15T07:15:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/number-of-ways-to-form-a-target-string-given-a-dictionary-leetcode-1639</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/w0mB7tEv17k/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Ways to Form a Target String Given a Dictionary | Recur | Memo | Leetcode 1639 | MIK</video:title><video:description>Number of Ways to Form a Target String Given a Dictionary | Recur | Memo | Leetcode 1639 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/w0mB7tEv17k</video:player_loc><video:duration>1755</video:duration><video:publication_date>2023-04-16T07:07:38.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/number-of-ways-to-form-a-target-string-given-a-dictionary-leetcode-1639-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/EtbCd9iETno/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Ways to Form a Target String Given a Dictionary | Bottom Up | Leetcode 1639 | MIK</video:title><video:description>Number of Ways to Form a Target String Given a Dictionary | Bottom Up | Leetcode 1639 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/EtbCd9iETno</video:player_loc><video:duration>1076</video:duration><video:publication_date>2023-04-16T12:13:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/profitable-schemes-leetcode-879</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ay3MHrS7YbQ/hqdefault.jpg</video:thumbnail_loc><video:title>Profitable Schemes - (AMAZON) | Recur+Memo | Leetcode-879 | Live Code + Explanation</video:title><video:description>Profitable Schemes - (AMAZON) | Recur+Memo | Leetcode-879 | Live Code + Explanation. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ay3MHrS7YbQ</video:player_loc><video:duration>1445</video:duration><video:publication_date>2023-04-21T15:12:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/restore-the-array-leetcode-1416</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8FZo3dcConU/hqdefault.jpg</video:thumbnail_loc><video:title>Restore The Array - (GOOGLE, MICROSOFT) | Recur+Memo | Leetcode-1416 | Live Code + Explanation</video:title><video:description>Restore The Array - (GOOGLE, MICROSOFT) | Recur+Memo | Leetcode-1416 | Live Code + Explanation. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8FZo3dcConU</video:player_loc><video:duration>1240</video:duration><video:publication_date>2023-04-23T07:09:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/minimum-insertion-steps-to-make-a-string-palindrome-leetcode-1312-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/99S-xuAbwoc/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Insertion Steps to Make a String Palindrome | Recur+Memo | GOOGLE | Leetcode-1312 🧑🏻‍💻</video:title><video:description>Minimum Insertion Steps to Make a String Palindrome | Recur+Memo | GOOGLE | Leetcode-1312 🧑🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/99S-xuAbwoc</video:player_loc><video:duration>996</video:duration><video:publication_date>2023-04-24T11:54:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/find-the-longest-valid-obstacle-course-at-each-position-leetcode-1964</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/sUtUgMW2kMY/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Longest Valid Obstacle Course at Each Position | META  | Leetcode-1964 | Live Coding</video:title><video:description>Find the Longest Valid Obstacle Course at Each Position | META  | Leetcode-1964 | Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/sUtUgMW2kMY</video:player_loc><video:duration>2422</video:duration><video:publication_date>2023-05-07T14:52:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/uncrossed-lines-leetcode-1035</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/eCNwbEznRZE/hqdefault.jpg</video:thumbnail_loc><video:title>Uncrossed Lines | Microsoft, Amazon, Meta | Leetcode-1035 | Live Code + Explanation</video:title><video:description>Uncrossed Lines | Microsoft, Amazon, Meta | Leetcode-1035 | Live Code + Explanation. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/eCNwbEznRZE</video:player_loc><video:duration>1329</video:duration><video:publication_date>2023-05-11T05:40:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/solving-questions-with-brainpower-leetcode-2140</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/NcC8lo7nLCE/hqdefault.jpg</video:thumbnail_loc><video:title>Solving Questions With Brainpower | GOOGLE | Leetcode 2140 | codestorywithMIK</video:title><video:description>Solving Questions With Brainpower | GOOGLE | Leetcode 2140 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/NcC8lo7nLCE</video:player_loc><video:duration>1636</video:duration><video:publication_date>2023-05-12T09:11:41.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/count-ways-to-build-good-strings-leetcode-2466</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/G-i4CveBSYI/hqdefault.jpg</video:thumbnail_loc><video:title>Count Ways To Build Good Strings | Recursion | Memo | Leetcode 2466 | codestorywithMIK</video:title><video:description>Count Ways To Build Good Strings | Recursion | Memo | Leetcode 2466 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/G-i4CveBSYI</video:player_loc><video:duration>1319</video:duration><video:publication_date>2023-05-13T05:49:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/count-ways-to-build-good-strings-leetcode-2466-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/SbB8tKCMtTE/hqdefault.jpg</video:thumbnail_loc><video:title>Count Ways To Build Good Strings | Bottom Up | Leetcode 2466 | codestorywithMIK</video:title><video:description>Count Ways To Build Good Strings | Bottom Up | Leetcode 2466 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/SbB8tKCMtTE</video:player_loc><video:duration>1623</video:duration><video:publication_date>2023-05-13T10:35:21.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/maximize-score-after-n-operations-leetcode-1799</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/CTYIzzT9agE/hqdefault.jpg</video:thumbnail_loc><video:title>Maximize Score After N Operations | BRUTE FORCE To OPTIMAL | META | Leetcode-1799 | Live Code</video:title><video:description>Maximize Score After N Operations | BRUTE FORCE To OPTIMAL | META | Leetcode-1799 | Live Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/CTYIzzT9agE</video:player_loc><video:duration>2494</video:duration><video:publication_date>2023-05-14T11:17:52.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/stone-game-ii-leetcode-1140</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9f1vzDFVnGA/hqdefault.jpg</video:thumbnail_loc><video:title>Stone Game II | Game Strategy | EASIEST Explanation | META | Leetcode 1140 | codestorywithMIK</video:title><video:description>Stone Game II | Game Strategy | EASIEST Explanation | META | Leetcode 1140 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9f1vzDFVnGA</video:player_loc><video:duration>2282</video:duration><video:publication_date>2023-05-26T15:38:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/stone-game-iii-leetcode-1406</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/KI8suf35r38/hqdefault.jpg</video:thumbnail_loc><video:title>Stone Game III | Basic to Optimal | EASIEST Explanation | META, GOOGLE | Leetcode-1406 | Live Code</video:title><video:description>Stone Game III | Basic to Optimal | EASIEST Explanation | META, GOOGLE | Leetcode-1406 | Live Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/KI8suf35r38</video:player_loc><video:duration>1834</video:duration><video:publication_date>2023-05-27T07:30:53.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/minimum-cost-to-cut-a-stick-leetcode-1547</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/x4cRwVEFwHc/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Cost to Cut a Stick | Recur + Memo | Time Complexity | GOOGLE | Leetcode-1547 | Live Code</video:title><video:description>Minimum Cost to Cut a Stick | Recur + Memo | Time Complexity | GOOGLE | Leetcode-1547 | Live Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/x4cRwVEFwHc</video:player_loc><video:duration>2307</video:duration><video:publication_date>2023-05-28T09:24:34.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/make-array-strictly-increasing-leetcode-1187</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ct036xxMtT8/hqdefault.jpg</video:thumbnail_loc><video:title>Make Array Strictly Increasing | Recur + Memo | Time Complexity | GOOGLE | Leetcode-1187 | Live Code</video:title><video:description>Make Array Strictly Increasing | Recur + Memo | Time Complexity | GOOGLE | Leetcode-1187 | Live Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ct036xxMtT8</video:player_loc><video:duration>1782</video:duration><video:publication_date>2023-06-17T07:54:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/number-of-increasing-paths-in-a-grid-leetcode-2328</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/s-dQjzykhVA/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Increasing Paths in a Grid | DFS + Memo | ADOBE, MICROSOFT | Leetcode-2328 | Live Code</video:title><video:description>Number of Increasing Paths in a Grid | DFS + Memo | ADOBE, MICROSOFT | Leetcode-2328 | Live Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/s-dQjzykhVA</video:player_loc><video:duration>1478</video:duration><video:publication_date>2023-06-18T07:17:17.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/best-time-to-buy-and-sell-stock-with-transaction-fee-leetcode-714</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/yN5K5T3aw8M/hqdefault.jpg</video:thumbnail_loc><video:title>Best Time to Buy and Sell Stock with Transaction Fee | Recur + Memo | META | Leetcode-714</video:title><video:description>Best Time to Buy and Sell Stock with Transaction Fee | Recur + Memo | META | Leetcode-714. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/yN5K5T3aw8M</video:player_loc><video:duration>974</video:duration><video:publication_date>2023-06-22T03:46:17.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/longest-arithmetic-subsequence-leetcode-1027</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/S3ocpdBL-7Y/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Arithmetic Subsequence | Recur + Memo | Bottom Up | GOOGLE | Leetcode-1027 | Live Code</video:title><video:description>Longest Arithmetic Subsequence | Recur + Memo | Bottom Up | GOOGLE | Leetcode-1027 | Live Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/S3ocpdBL-7Y</video:player_loc><video:duration>3037</video:duration><video:publication_date>2023-06-23T15:57:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/tallest-billboard-leetcode-956</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Zyzs3AuqPRw/hqdefault.jpg</video:thumbnail_loc><video:title>Tallest Billboard | Recur + Memo | Tree Diagram | GOOGLE | Leetcode 956 | codestorywithMIK</video:title><video:description>Tallest Billboard | Recur + Memo | Tree Diagram | GOOGLE | Leetcode 956 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Zyzs3AuqPRw</video:player_loc><video:duration>1970</video:duration><video:publication_date>2023-06-24T12:34:49.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/count-all-possible-routes-leetcode-1575</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/qppd8vx0vK4/hqdefault.jpg</video:thumbnail_loc><video:title>Count All Possible Routes | Recur + Memo | Tree Diagram | ZOHO | Leetcode-1575 | Live Code</video:title><video:description>Count All Possible Routes | Recur + Memo | Tree Diagram | ZOHO | Leetcode-1575 | Live Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/qppd8vx0vK4</video:player_loc><video:duration>1288</video:duration><video:publication_date>2023-06-25T10:53:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/longest-arithmetic-subsequence-of-given-difference-leetcode-1218</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/OHxwaAbO1A8/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Arithmetic Subsequence of Given Difference | Recur + Memo | Optimal | META | Leetcode-1218</video:title><video:description>Longest Arithmetic Subsequence of Given Difference | Recur + Memo | Optimal | META | Leetcode-1218. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/OHxwaAbO1A8</video:player_loc><video:duration>1948</video:duration><video:publication_date>2023-07-14T06:18:48.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/maximum-number-of-events-that-can-be-attended-ii-leetcode-1751</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9ykgLt25X9c/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Number of Events That Can Be Attended II | Recur | Memo | Leetcode 1751 | codestorywithMIK</video:title><video:description>Maximum Number of Events That Can Be Attended II | Recur | Memo | Leetcode 1751 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9ykgLt25X9c</video:player_loc><video:duration>1572</video:duration><video:publication_date>2023-07-15T08:41:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/smallest-sufficient-team-leetcode-1125</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/CAoBD84G2gI/hqdefault.jpg</video:thumbnail_loc><video:title>Smallest Sufficient Team | Recur + Memo | Bit Manipulation Made Easy | AMAZON | Leetcode-1125</video:title><video:description>Smallest Sufficient Team | Recur + Memo | Bit Manipulation Made Easy | AMAZON | Leetcode-1125. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/CAoBD84G2gI</video:player_loc><video:duration>2653</video:duration><video:publication_date>2023-07-16T10:08:21.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/number-of-longest-increasing-subsequence-leetcode-673</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ZoSVDi7lk-4/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Longest Increasing Subsequence | Using LIS | Full Dry Run | META | Leetcode-673</video:title><video:description>Number of Longest Increasing Subsequence | Using LIS | Full Dry Run | META | Leetcode-673. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ZoSVDi7lk-4</video:player_loc><video:duration>2029</video:duration><video:publication_date>2023-07-21T06:06:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/knight-probability-in-chessboard-leetcode-688</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ETA-5CD0z7Q/hqdefault.jpg</video:thumbnail_loc><video:title>Knight Probability in Chessboard | Recursion | Memoization | AMAZON | DIRECTi | Leetcode-688</video:title><video:description>Knight Probability in Chessboard | Recursion | Memoization | AMAZON | DIRECTi | Leetcode-688. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ETA-5CD0z7Q</video:player_loc><video:duration>1111</video:duration><video:publication_date>2023-07-22T01:54:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/unique-binary-search-trees-ii-leetcode-894</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/lNEI25uT3WM/hqdefault.jpg</video:thumbnail_loc><video:title>All Possible Full Binary Trees | Recursion Tree | Memoization | GOOGLE | AMAZON | Leetcode-894</video:title><video:description>All Possible Full Binary Trees | Recursion Tree | Memoization | GOOGLE | AMAZON | Leetcode-894. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/lNEI25uT3WM</video:player_loc><video:duration>1703</video:duration><video:publication_date>2023-07-23T14:10:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/predict-the-winner-leetcode-486</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ak3DkeUBo-c/hqdefault.jpg</video:thumbnail_loc><video:title>Predict the Winner | Two Recursive Approaches | Memoization | Game Strategy | Leetcode-486 | MIK</video:title><video:description>Predict the Winner | Two Recursive Approaches | Memoization | Game Strategy | Leetcode-486 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ak3DkeUBo-c</video:player_loc><video:duration>1655</video:duration><video:publication_date>2023-07-28T03:33:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/soup-servings-leetcode-808</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/BiA4x5Gj7io/hqdefault.jpg</video:thumbnail_loc><video:title>Soup Servings | INTUITIVE | Recursion | Memoization | GOOGLE | Leetcode-808</video:title><video:description>Soup Servings | INTUITIVE | Recursion | Memoization | GOOGLE | Leetcode-808. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/BiA4x5Gj7io</video:player_loc><video:duration>1551</video:duration><video:publication_date>2023-07-29T06:14:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/strange-printer-leetcode-664</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/pV3arpA0TzY/hqdefault.jpg</video:thumbnail_loc><video:title>Strange Printer | INTUITIVE | Recursion | Memoization | NetEase | Leetcode-664</video:title><video:description>Strange Printer | INTUITIVE | Recursion | Memoization | NetEase | Leetcode-664. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/pV3arpA0TzY</video:player_loc><video:duration>1860</video:duration><video:publication_date>2023-07-30T12:24:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/edit-distance-leetcode-712</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Hstr9Wpa5Sc/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum ASCII Delete Sum for Two Strings | Intuition | Similar Problems | Leetcode 712 | MIK</video:title><video:description>Minimum ASCII Delete Sum for Two Strings | Intuition | Similar Problems | Leetcode 712 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Hstr9Wpa5Sc</video:player_loc><video:duration>1315</video:duration><video:publication_date>2023-07-31T03:30:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/extra-characters-in-a-string-leetcode-139</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/oBUpyPZ08zU/hqdefault.jpg</video:thumbnail_loc><video:title>Word Break | Tree Diagram | Recursion | Memoization | Similar Problems | Leetcode-139</video:title><video:description>Word Break | Tree Diagram | Recursion | Memoization | Similar Problems | Leetcode-139. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/oBUpyPZ08zU</video:player_loc><video:duration>1649</video:duration><video:publication_date>2023-08-04T04:33:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/all-possible-full-binary-trees-leetcode-95</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/SXU--MPoUe8/hqdefault.jpg</video:thumbnail_loc><video:title>Unique Binary Search Trees II | Similar Problem | Recursion | Memoization | Amazon | Leetcode-95</video:title><video:description>Unique Binary Search Trees II | Similar Problem | Recursion | Memoization | Amazon | Leetcode-95. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/SXU--MPoUe8</video:player_loc><video:duration>1298</video:duration><video:publication_date>2023-08-05T08:59:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/number-of-music-playlists-leetcode-920</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/2H0zU6v-xck/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Music Playlists | Made Super Easy | Recursion | Memoization | META | Leetcode-920</video:title><video:description>Number of Music Playlists | Made Super Easy | Recursion | Memoization | META | Leetcode-920. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/2H0zU6v-xck</video:player_loc><video:duration>1831</video:duration><video:publication_date>2023-08-06T09:35:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/coin-change-ii-leetcode-518</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/HhSZQkdJZok/hqdefault.jpg</video:thumbnail_loc><video:title>Coin Change II | Made Super Easy | Recursion | Memoization | AMAZON | Leetcode-518</video:title><video:description>Coin Change II | Made Super Easy | Recursion | Memoization | AMAZON | Leetcode-518. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/HhSZQkdJZok</video:player_loc><video:duration>1472</video:duration><video:publication_date>2023-08-11T03:47:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/unique-paths-ii-leetcode-63-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/JC1fSPdJjMc/hqdefault.jpg</video:thumbnail_loc><video:title>Unique Paths II | Made Super Easy | Recursion | Memoization | 2D Array | AMAZON | Leetcode-63</video:title><video:description>Unique Paths II | Made Super Easy | Recursion | Memoization | 2D Array | AMAZON | Leetcode-63. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/JC1fSPdJjMc</video:player_loc><video:duration>1184</video:duration><video:publication_date>2023-08-12T03:57:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/check-if-there-is-a-valid-partition-for-the-array-leetcode-2369</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/tofpb5rIwRk/hqdefault.jpg</video:thumbnail_loc><video:title>Check if There is a Valid Partition For The Array | Recursion | Memoization | GOOGLE | Leetcode-2369</video:title><video:description>Check if There is a Valid Partition For The Array | Recursion | Memoization | GOOGLE | Leetcode-2369. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/tofpb5rIwRk</video:player_loc><video:duration>1539</video:duration><video:publication_date>2023-08-13T04:24:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/interleaving-string-leetcode-97</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/CfzP4oXxZTI/hqdefault.jpg</video:thumbnail_loc><video:title>Interleaving String | Khandaani Tareeka | Memoization | GOOGLE | Leetcode-97</video:title><video:description>Interleaving String | Khandaani Tareeka | Memoization | GOOGLE | Leetcode-97. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/CfzP4oXxZTI</video:player_loc><video:duration>1775</video:duration><video:publication_date>2023-08-25T05:58:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/frog-jump-leetcode-403</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/l9E-ZcbFhDg/hqdefault.jpg</video:thumbnail_loc><video:title>Frog Jump | Khandaani Tareeka | Memoization | GOOGLE | AMAZON | META | Leetcode 403 | MIK</video:title><video:description>Frog Jump | Khandaani Tareeka | Memoization | GOOGLE | AMAZON | META | Leetcode 403 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/l9E-ZcbFhDg</video:player_loc><video:duration>2112</video:duration><video:publication_date>2023-08-27T09:31:51.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/minimum-number-of-taps-to-open-to-water-a-garden-leetcode-1326</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/zClcHFT9X8E/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Number of Taps to Open to Water a Garden | Recursion | Memoization | Leetcode - 1326</video:title><video:description>Minimum Number of Taps to Open to Water a Garden | Recursion | Memoization | Leetcode - 1326. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/zClcHFT9X8E</video:player_loc><video:duration>1611</video:duration><video:publication_date>2023-08-31T17:38:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/extra-characters-in-a-string-leetcode-2707</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/uQuSzPKtoVU/hqdefault.jpg</video:thumbnail_loc><video:title>Extra Characters in a String | Tree Diagram | Recursion | Memoization | MADE EASY | Leetcode - 2707</video:title><video:description>Extra Characters in a String | Tree Diagram | Recursion | Memoization | MADE EASY | Leetcode - 2707. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/uQuSzPKtoVU</video:player_loc><video:duration>1350</video:duration><video:publication_date>2023-09-02T03:08:58.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/unique-paths-leetcode-62-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/DaakAKiCkyc/hqdefault.jpg</video:thumbnail_loc><video:title>Unique Paths | Recursion | Memoization | AMAZON | CISCO | PAYTM | OLA | LINKEDIN | Leetcode - 62</video:title><video:description>Unique Paths | Recursion | Memoization | AMAZON | CISCO | PAYTM | OLA | LINKEDIN | Leetcode - 62. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/DaakAKiCkyc</video:player_loc><video:duration>511</video:duration><video:publication_date>2023-09-03T05:09:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/champagne-tower-leetcode-799</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/-RwOEYcsQU0/hqdefault.jpg</video:thumbnail_loc><video:title>Champagne Tower | Recursion | Memoization | GOOGLE | Leetcode - 799</video:title><video:description>Champagne Tower | Recursion | Memoization | GOOGLE | Leetcode - 799. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/-RwOEYcsQU0</video:player_loc><video:duration>1768</video:duration><video:publication_date>2023-09-24T06:37:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/champagne-tower-leetcode-799-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Emv0Q2N-3n4/hqdefault.jpg</video:thumbnail_loc><video:title>Champagne Tower | Intuitive | Bottom Up | GOOGLE | Leetcode - 799</video:title><video:description>Champagne Tower | Intuitive | Bottom Up | GOOGLE | Leetcode - 799. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Emv0Q2N-3n4</video:player_loc><video:duration>1072</video:duration><video:publication_date>2023-09-24T08:07:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/integer-break-leetcode-343</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/iXtqfIrWMZg/hqdefault.jpg</video:thumbnail_loc><video:title>Integer Break | Tree Diagram | Recursion | Memoization | AMAZON | Leetcode - 343</video:title><video:description>Integer Break | Tree Diagram | Recursion | Memoization | AMAZON | Leetcode - 343. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/iXtqfIrWMZg</video:player_loc><video:duration>1214</video:duration><video:publication_date>2023-10-06T08:29:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/max-dot-product-of-two-subsequences-leetcode-1458</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Tk70PLqbYH4/hqdefault.jpg</video:thumbnail_loc><video:title>Max Dot Product of Two Subsequences | Detailed | simplified | Leetcode 1458 | codestorywithMIK</video:title><video:description>Max Dot Product of Two Subsequences | Detailed | simplified | Leetcode 1458 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Tk70PLqbYH4</video:player_loc><video:duration>1351</video:duration><video:publication_date>2023-10-08T17:17:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/min-cost-climbing-stairs-leetcode-746</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/_59HE5lVuLg/hqdefault.jpg</video:thumbnail_loc><video:title>Min Cost Climbing Stairs | Bottom Up | Recursion | Memoization | GOOGLE | Leetcode - 746</video:title><video:description>Min Cost Climbing Stairs | Bottom Up | Recursion | Memoization | GOOGLE | Leetcode - 746. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/_59HE5lVuLg</video:player_loc><video:duration>1438</video:duration><video:publication_date>2023-10-13T09:38:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/painting-the-walls-leetcode-2742</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/FkJ2_hr6DRo/hqdefault.jpg</video:thumbnail_loc><video:title>Painting the Walls | Why Greedy Fails | Recursion | Memoization | GOOGLE | Leetcode - 2742</video:title><video:description>Painting the Walls | Why Greedy Fails | Recursion | Memoization | GOOGLE | Leetcode - 2742. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/FkJ2_hr6DRo</video:player_loc><video:duration>1692</video:duration><video:publication_date>2023-10-14T10:38:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/number-of-ways-to-stay-in-the-same-place-after-some-steps-leetcode-1269</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/NqhmQQlVhTE/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Ways to Stay in the Same Place After Some Steps | Recursion | Memoization | Leetcode- 1269</video:title><video:description>Number of Ways to Stay in the Same Place After Some Steps | Recursion | Memoization | Leetcode- 1269. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/NqhmQQlVhTE</video:player_loc><video:duration>1678</video:duration><video:publication_date>2023-10-15T10:32:57.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/constrained-subsequence-sum-leetcode-1425</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/tWhboGihflM/hqdefault.jpg</video:thumbnail_loc><video:title>Constrained Subsequence Sum | Recursion | Memoization | Sliding Window | GOOGLE | Leetcode - 1425</video:title><video:description>Constrained Subsequence Sum | Recursion | Memoization | Sliding Window | GOOGLE | Leetcode - 1425. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/tWhboGihflM</video:player_loc><video:duration>3530</video:duration><video:publication_date>2023-10-21T08:50:34.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/longest-palindromic-substring-leetcode-5-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/n_kL8BkURVA/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Palindromic Substring | Recursion | Memoization | Microsoft | Leetcode 5 | codestorywithMIK</video:title><video:description>Longest Palindromic Substring | Recursion | Memoization | Microsoft | Leetcode 5 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/n_kL8BkURVA</video:player_loc><video:duration>1426</video:duration><video:publication_date>2023-10-27T04:09:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/maximum-points-after-collecting-coins-from-all-nodes-leetcode-2920</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/kJUhjb0K4_M/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Points After Collecting Coins From All Nodes | Memoization | Optimisations | Leetcode - 2920</video:title><video:description>Maximum Points After Collecting Coins From All Nodes | Memoization | Optimisations | Leetcode - 2920. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/kJUhjb0K4_M</video:player_loc><video:duration>3075</video:duration><video:publication_date>2023-11-02T13:54:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/knight-dialer-leetcode-935</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/pOmSGFPcMjQ/hqdefault.jpg</video:thumbnail_loc><video:title>Knight Dialer | Recursion Memoization | Bottom Up DP | Google | Dropbox | Leetcode 935</video:title><video:description>Knight Dialer | Recursion Memoization | Bottom Up DP | Google | Dropbox | Leetcode 935. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/pOmSGFPcMjQ</video:player_loc><video:duration>2027</video:duration><video:publication_date>2023-11-27T04:28:34.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/decode-ways-leetcode-91</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/HW-y3gvQTVQ/hqdefault.jpg</video:thumbnail_loc><video:title>Decode Ways | Recursion | Memo | Bottom Up | Leetcode 91</video:title><video:description>Decode Ways | Recursion | Memo | Bottom Up | Leetcode 91. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/HW-y3gvQTVQ</video:player_loc><video:duration>2404</video:duration><video:publication_date>2023-12-25T04:22:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/number-of-dice-rolls-with-target-sum-leetcode-1155</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/nQw9gVaIjGo/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Dice Rolls With Target Sum | Recursion | Memo | Bottom Up | Leetcode 1155</video:title><video:description>Number of Dice Rolls With Target Sum | Recursion | Memo | Bottom Up | Leetcode 1155. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/nQw9gVaIjGo</video:player_loc><video:duration>1720</video:duration><video:publication_date>2023-12-26T07:34:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/string-compression-ii-leetcode-1531</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/6rgO0obJG0k/hqdefault.jpg</video:thumbnail_loc><video:title>String Compression II | Recursion | Memo | Leetcode 1531</video:title><video:description>String Compression II | Recursion | Memo | Leetcode 1531. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/6rgO0obJG0k</video:player_loc><video:duration>2513</video:duration><video:publication_date>2023-12-28T08:27:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/string-compression-ii-leetcode-1531-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Br3MiKmZRnc/hqdefault.jpg</video:thumbnail_loc><video:title>String Compression II | Recursion | 2-D Memoization |  Leetcode 1531</video:title><video:description>String Compression II | Recursion | 2-D Memoization |  Leetcode 1531. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Br3MiKmZRnc</video:player_loc><video:duration>1910</video:duration><video:publication_date>2023-12-28T15:28:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/minimum-difficulty-of-a-job-schedule-leetcode-1335-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/TjyYTng3f5A/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Difficulty of a Job Schedule | Bottom Up | Amazon | Leetcode 1335</video:title><video:description>Minimum Difficulty of a Job Schedule | Bottom Up | Amazon | Leetcode 1335. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/TjyYTng3f5A</video:player_loc><video:duration>1708</video:duration><video:publication_date>2023-12-29T07:22:51.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/count-possible-ways-to-construct-buildings</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/VQAp7AQ8JcM/hqdefault.jpg</video:thumbnail_loc><video:title>Count possible ways to construct buildings | Recursion | Memoization | Bottom UP | GFG POTD</video:title><video:description>Count possible ways to construct buildings | Recursion | Memoization | Bottom UP | GFG POTD. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/VQAp7AQ8JcM</video:player_loc><video:duration>2257</video:duration><video:publication_date>2024-01-05T16:36:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/maximize-the-number-of-partitions-after-operations-leetcode-3003</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/SWNIGaOpV0U/hqdefault.jpg</video:thumbnail_loc><video:title>Maximize the Number of Partitions After Operations | Intuition From Scratch | Leetcode 3003 | MIK</video:title><video:description>Maximize the Number of Partitions After Operations | Intuition From Scratch | Leetcode 3003 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/SWNIGaOpV0U</video:player_loc><video:duration>3738</video:duration><video:publication_date>2024-01-07T14:02:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/out-of-boundary-paths-leetcode-576</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YH-ZG0q--DQ/hqdefault.jpg</video:thumbnail_loc><video:title>Out of Boundary Paths | Recursion | Memoization | Bottom Up | Optimal Bottom Up | Leetcode 576</video:title><video:description>Out of Boundary Paths | Recursion | Memoization | Bottom Up | Optimal Bottom Up | Leetcode 576. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YH-ZG0q--DQ</video:player_loc><video:duration>3407</video:duration><video:publication_date>2024-01-26T08:33:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/k-inverse-pairs-array-leetcode-629</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/y9yo1kyW7Bg/hqdefault.jpg</video:thumbnail_loc><video:title>K Inverse Pairs Array | Recursion | Memoization | Bottom Up | Optimal Bottom Up | Leetcode 629</video:title><video:description>K Inverse Pairs Array | Recursion | Memoization | Bottom Up | Optimal Bottom Up | Leetcode 629. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/y9yo1kyW7Bg</video:player_loc><video:duration>3588</video:duration><video:publication_date>2024-01-27T07:09:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/count-digit-groupings-of-a-number</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/AT_A8IcjRSg/hqdefault.jpg</video:thumbnail_loc><video:title>Count digit groupings of a number | Recursion | Memoization | GFG POTD</video:title><video:description>Count digit groupings of a number | Recursion | Memoization | GFG POTD. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/AT_A8IcjRSg</video:player_loc><video:duration>1629</video:duration><video:publication_date>2024-01-29T15:35:21.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/partition-array-for-maximum-sum-leetcode-1043</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/LvvIcZWtuoY/hqdefault.jpg</video:thumbnail_loc><video:title>Partition Array for Maximum Sum | Why DP | Recursion | Memo | Bottom Up | Leetcode 1043</video:title><video:description>Partition Array for Maximum Sum | Why DP | Recursion | Memo | Bottom Up | Leetcode 1043. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/LvvIcZWtuoY</video:player_loc><video:duration>1701</video:duration><video:publication_date>2024-02-03T05:35:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/perfect-squares-leetcode-279-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/7zfmLa6vzaA/hqdefault.jpg</video:thumbnail_loc><video:title>Perfect Squares | Bottom UP | Made Easy | Google | Leetcode 279</video:title><video:description>Perfect Squares | Bottom UP | Made Easy | Google | Leetcode 279. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/7zfmLa6vzaA</video:player_loc><video:duration>662</video:duration><video:publication_date>2024-02-08T02:41:53.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/palindromic-substrings-leetcode-647-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/tGAMyZxlwuA/hqdefault.jpg</video:thumbnail_loc><video:title>Palindromic Substrings | Blueprint | Palindrome Problems | 4 Approaches | Leetcode 647</video:title><video:description>Palindromic Substrings | Blueprint | Palindrome Problems | 4 Approaches | Leetcode 647. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/tGAMyZxlwuA</video:player_loc><video:duration>3450</video:duration><video:publication_date>2024-02-10T05:42:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/cherry-pickup-ii-leetcode-1463</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Pd9wdXe8S6I/hqdefault.jpg</video:thumbnail_loc><video:title>Cherry Pickup II | 3 Approaches | Super Detailed | Leetcode 1463</video:title><video:description>Cherry Pickup II | 3 Approaches | Super Detailed | Leetcode 1463. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Pd9wdXe8S6I</video:player_loc><video:duration>4072</video:duration><video:publication_date>2024-02-11T09:08:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/maximum-strength-of-k-disjoint-subarrays-leetcode-3077</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/vGI75BQhDVI/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Strength of K Disjoint Subarrays | Recursion | Memoization | Leetcode 3077 | Contest 388</video:title><video:description>Maximum Strength of K Disjoint Subarrays | Recursion | Memoization | Leetcode 3077 | Contest 388. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/vGI75BQhDVI</video:player_loc><video:duration>2727</video:duration><video:publication_date>2024-03-10T13:18:53.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/valid-parenthesis-string-leetcode-678</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Pno2hATcwHA/hqdefault.jpg</video:thumbnail_loc><video:title>Valid Parenthesis String | 4 Detailed Approaches | Leetcode 678 | codestorywithMIK</video:title><video:description>Valid Parenthesis String | 4 Detailed Approaches | Leetcode 678 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Pno2hATcwHA</video:player_loc><video:duration>4403</video:duration><video:publication_date>2024-04-07T07:16:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/minimum-sum-of-values-by-dividing-array-leetcode-3117</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/JToq_-hQxv8/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Sum of Values by Dividing Array | Recursion | Memoization | Leetcode 3117 | codestorywithMIK</video:title><video:description>Minimum Sum of Values by Dividing Array | Recursion | Memoization | Leetcode 3117 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/JToq_-hQxv8</video:player_loc><video:duration>3600</video:duration><video:publication_date>2024-04-14T12:54:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/longest-ideal-subsequence-leetcode-2370</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/01nYV8eqxm8/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Ideal Subsequence | LIS Variant | Bottom Up | Optimal | Leetcode 2370 | codestorywithMIK</video:title><video:description>Longest Ideal Subsequence | LIS Variant | Bottom Up | Optimal | Leetcode 2370 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/01nYV8eqxm8</video:player_loc><video:duration>2613</video:duration><video:publication_date>2024-04-25T02:37:25.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/minimum-falling-path-sum-ii-leetcode-1289</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/rpW1qKAs4V4/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Falling Path Sum II | 4 Approaches | Detailed Dry Run | Leetcode 1289 | codestorywithMIK</video:title><video:description>Minimum Falling Path Sum II | 4 Approaches | Detailed Dry Run | Leetcode 1289 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/rpW1qKAs4V4</video:player_loc><video:duration>3923</video:duration><video:publication_date>2024-04-26T07:42:39.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/freedom-trail-leetcode-514</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/rkAvrFycfIs/hqdefault.jpg</video:thumbnail_loc><video:title>Freedom Trail | Recursion | Memoization | Bottom Up | Detailed | Leetcode 514 | codestorywithMIK</video:title><video:description>Freedom Trail | Recursion | Memoization | Bottom Up | Detailed | Leetcode 514 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/rkAvrFycfIs</video:player_loc><video:duration>3688</video:duration><video:publication_date>2024-04-27T07:56:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/find-number-of-ways-to-reach-the-k-th-stair-leetcode-3154</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/1lLmo2aC29o/hqdefault.jpg</video:thumbnail_loc><video:title>Find Number of Ways to Reach the K-th Stair | Recursion+Memo  | Leetcode 3154 | codestorywithMIK</video:title><video:description>Find Number of Ways to Reach the K-th Stair | Recursion+Memo  | Leetcode 3154 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/1lLmo2aC29o</video:player_loc><video:duration>2203</video:duration><video:publication_date>2024-05-19T11:44:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/student-attendance-record-ii-leetcode-552</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/4IsxZd3BRJA/hqdefault.jpg</video:thumbnail_loc><video:title>Student Attendance Record II | Recursion | Memoization | Bottom Up | Leetcode 552 | codestorywithMIK</video:title><video:description>Student Attendance Record II | Recursion | Memoization | Bottom Up | Leetcode 552 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/4IsxZd3BRJA</video:player_loc><video:duration>2454</video:duration><video:publication_date>2024-05-26T06:19:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/filling-bookcase-shelves-leetcode-1105</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/pOtAvGIW8kQ/hqdefault.jpg</video:thumbnail_loc><video:title>Filling Bookcase Shelves | Recursion Memoization | Why not Greedy | Leetcode 1105 | codestorywithMIK</video:title><video:description>Filling Bookcase Shelves | Recursion Memoization | Why not Greedy | Leetcode 1105 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/pOtAvGIW8kQ</video:player_loc><video:duration>1789</video:duration><video:publication_date>2024-07-31T03:00:34.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/maximum-number-of-points-with-cost-leetcode-1937</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/0AlKD9rZfm4/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Number of Points with Cost | Detailed Explanation | Leetcode 1937 | codestorywithMIK</video:title><video:description>Maximum Number of Points with Cost | Detailed Explanation | Leetcode 1937 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/0AlKD9rZfm4</video:player_loc><video:duration>2858</video:duration><video:publication_date>2024-08-17T07:22:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/2-keys-keyboard-leetcode-650</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/zELBK8_vB7Y/hqdefault.jpg</video:thumbnail_loc><video:title>2 Keys Keyboard | Detailed Explanations | Leetcode 650 | codestorywithMIK</video:title><video:description>2 Keys Keyboard | Detailed Explanations | Leetcode 650 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/zELBK8_vB7Y</video:player_loc><video:duration>2074</video:duration><video:publication_date>2024-08-19T06:56:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/maximum-number-of-moves-to-kill-all-pawns-leetcode-3283</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/pz_slLUY7z0/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Number of Moves to Kill All Pawns | Step By Step Detailed | Leetcode 3283 | codestorywithMIK</video:title><video:description>Maximum Number of Moves to Kill All Pawns | Step By Step Detailed | Leetcode 3283 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/pz_slLUY7z0</video:player_loc><video:duration>4270</video:duration><video:publication_date>2024-09-08T12:30:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/extra-characters-in-a-string-leetcode-2707-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8l76FiMqYHg/hqdefault.jpg</video:thumbnail_loc><video:title>Extra Characters in a String | Recursion | Bottom Up | Easy | Leetcode 2707 | codestorywithMIK</video:title><video:description>Extra Characters in a String | Recursion | Bottom Up | Easy | Leetcode 2707 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8l76FiMqYHg</video:player_loc><video:duration>1533</video:duration><video:publication_date>2024-09-23T02:57:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/maximal-square-leetcode-1277</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/y3kdowdyNMM/hqdefault.jpg</video:thumbnail_loc><video:title>Count Square Submatrices with All Ones | Recursion | Bottom Up | Leetcode 1277 | codestorywithMIK</video:title><video:description>Count Square Submatrices with All Ones | Recursion | Bottom Up | Leetcode 1277 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/y3kdowdyNMM</video:player_loc><video:duration>2521</video:duration><video:publication_date>2024-10-27T04:45:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/minimum-total-distance-traveled-leetcode-2463</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/6fBEjFKQhhs/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Total Distance Traveled | Detailed Thought Process | Leetcode 2463 | codestorywithMIK</video:title><video:description>Minimum Total Distance Traveled | Detailed Thought Process | Leetcode 2463 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/6fBEjFKQhhs</video:player_loc><video:duration>1918</video:duration><video:publication_date>2024-10-31T17:50:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/minimum-array-sum-leetcode-3366</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/A5QMNb2868I/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Array Sum | Detailed for Beginners | Contest Problem | Leetcode 3366 | codestorywithMIK</video:title><video:description>Minimum Array Sum | Detailed for Beginners | Contest Problem | Leetcode 3366 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/A5QMNb2868I</video:player_loc><video:duration>1741</video:duration><video:publication_date>2024-11-24T06:57:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/target-sum-leetcode-494-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/zHKfpI5c0_I/hqdefault.jpg</video:thumbnail_loc><video:title>Target Sum | Two Ways Of Memoization | Detailed | Leetcode 494 | Explanation + Code</video:title><video:description>Target Sum | Two Ways Of Memoization | Detailed | Leetcode 494 | Explanation + Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/zHKfpI5c0_I</video:player_loc><video:duration>1994</video:duration><video:publication_date>2024-12-26T05:06:59.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/maximum-sum-of-3-non-overlapping-subarrays-leetcode-689</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/aGmHF7Rs0R8/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Sum of 3 Non-Overlapping Subarrays | Detailed For Beginners | Leetcode 689 | codstorywithMIK</video:title><video:description>Maximum Sum of 3 Non-Overlapping Subarrays | Detailed For Beginners | Leetcode 689 | codstorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/aGmHF7Rs0R8</video:player_loc><video:duration>2925</video:duration><video:publication_date>2024-12-28T05:35:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/length-of-longest-fibonacci-subsequence-leetcode-873</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Ut9cr6Ut4wY/hqdefault.jpg</video:thumbnail_loc><video:title>Length of Longest Fibonacci Subsequence | Recursion Memo | Bottom Up |Leetcode 873| codestorywithMIK</video:title><video:description>Length of Longest Fibonacci Subsequence | Recursion Memo | Bottom Up |Leetcode 873| codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Ut9cr6Ut4wY</video:player_loc><video:duration>2906</video:duration><video:publication_date>2025-02-27T04:52:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/partition-equal-subset-sum-leetcode-416-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/G5BGAEYGnWU/hqdefault.jpg</video:thumbnail_loc><video:title>Partition Equal Subset Sum | Recursion | Memo | Tree Diagram | Leetcode 416 | codestorywithMIK</video:title><video:description>Partition Equal Subset Sum | Recursion | Memo | Tree Diagram | Leetcode 416 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/G5BGAEYGnWU</video:player_loc><video:duration>1344</video:duration><video:publication_date>2025-04-07T07:56:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/merge-operations-for-minimum-travel-time-leetcode-3538</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8hLbLBVnsz8/hqdefault.jpg</video:thumbnail_loc><video:title>Merge Operations for Minimum Travel Time | Thought Process | Leetcode 3538 | codestorywithMIK</video:title><video:description>Merge Operations for Minimum Travel Time | Thought Process | Leetcode 3538 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8hLbLBVnsz8</video:player_loc><video:duration>3913</video:duration><video:publication_date>2025-05-04T11:25:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/count-number-of-balanced-permutations-leetcode-3343</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/_9YlLoFT8JQ/hqdefault.jpg</video:thumbnail_loc><video:title>Count Number of Balanced Permutations | Super Detailed Explanation | Leetcode 3343 |codestorywithMIK</video:title><video:description>Count Number of Balanced Permutations | Super Detailed Explanation | Leetcode 3343 |codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/_9YlLoFT8JQ</video:player_loc><video:duration>4619</video:duration><video:publication_date>2025-05-09T12:27:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/print-longest-increasing-subsequence</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/rYuLUjRSTeo/hqdefault.jpg</video:thumbnail_loc><video:title>Print Longest Increasing Subsequence | LIS | Detailed Dry Run | Why It is Special  |codestorywithMIK</video:title><video:description>Print Longest Increasing Subsequence | LIS | Detailed Dry Run | Why It is Special  |codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/rYuLUjRSTeo</video:player_loc><video:duration>2196</video:duration><video:publication_date>2025-05-16T00:29:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/longest-unequal-adjacent-groups-subsequence-ii-leetcode-2901</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/geXrFFZXQTc/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Unequal Adjacent Groups Subsequence II | Why Greedy Fails | Leetcode 2901 | codestorywithMIK</video:title><video:description>Longest Unequal Adjacent Groups Subsequence II | Why Greedy Fails | Leetcode 2901 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/geXrFFZXQTc</video:player_loc><video:duration>1316</video:duration><video:publication_date>2025-05-16T01:59:43.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/number-of-ways-to-paint-n-3-grid-leetcode-1931</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Qz8F-nC8oxQ/hqdefault.jpg</video:thumbnail_loc><video:title>Painting a Grid With Three Different Colors | Thought Process | Leetcode 1931 | codestorywithMIK</video:title><video:description>Painting a Grid With Three Different Colors | Thought Process | Leetcode 1931 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Qz8F-nC8oxQ</video:player_loc><video:duration>3052</video:duration><video:publication_date>2025-05-18T08:30:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/find-the-original-typed-string-ii-leetcode-3333</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Rfmhi6krtJU/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Original Typed String II | Multiple Approaches | Detailed | Leetcode 3333 |codestorywithMIK</video:title><video:description>Find the Original Typed String II | Multiple Approaches | Detailed | Leetcode 3333 |codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Rfmhi6krtJU</video:player_loc><video:duration>4325</video:duration><video:publication_date>2025-07-02T12:34:56.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/find-the-maximum-length-of-valid-subsequence-i-leetcode-3201</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/g38YHwee1Yo/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Maximum Length of Valid Subsequence | Part I | Part II | Leetcode 3201 | 3202 | MIK</video:title><video:description>Find the Maximum Length of Valid Subsequence | Part I | Part II | Leetcode 3201 | 3202 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/g38YHwee1Yo</video:player_loc><video:duration>2723</video:duration><video:publication_date>2025-07-17T06:58:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/ways-to-express-an-integer-as-sum-of-powers-leetcode-2787</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/yA0DVkXhueg/hqdefault.jpg</video:thumbnail_loc><video:title>Ways to Express an Integer as Sum of Powers | Recursion Memo | Leetcode 2787 | codestorywithMIK</video:title><video:description>Ways to Express an Integer as Sum of Powers | Recursion Memo | Leetcode 2787 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/yA0DVkXhueg</video:player_loc><video:duration>1280</video:duration><video:publication_date>2025-08-12T01:39:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/length-of-longest-v-shaped-diagonal-segment-leetcode-3459</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/tIEUAD4tWcw/hqdefault.jpg</video:thumbnail_loc><video:title>Length of Longest V-Shaped Diagonal Segment | Made Easy | Leetcode 3459 | codestorywithMIK</video:title><video:description>Length of Longest V-Shaped Diagonal Segment | Made Easy | Leetcode 3459 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/tIEUAD4tWcw</video:player_loc><video:duration>2616</video:duration><video:publication_date>2025-08-27T12:25:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/number-of-people-aware-of-a-secret-leetcode-2327</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/qSHfpqtuWBY/hqdefault.jpg</video:thumbnail_loc><video:title>Number of People Aware of a Secret | Recursion Memo | Bottom Up | Leetcode 2327 | codestorywithMIK</video:title><video:description>Number of People Aware of a Secret | Recursion Memo | Bottom Up | Leetcode 2327 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/qSHfpqtuWBY</video:player_loc><video:duration>2715</video:duration><video:publication_date>2025-09-09T07:18:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/triangle-leetcode-120</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/zABL4mxtlj0/hqdefault.jpg</video:thumbnail_loc><video:title>Triangle | 4 Approaches | Detailed | Leetcode 120 | codestorywithMIK</video:title><video:description>Triangle | 4 Approaches | Detailed | Leetcode 120 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/zABL4mxtlj0</video:player_loc><video:duration>2740</video:duration><video:publication_date>2025-09-25T07:17:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/minimum-score-triangulation-of-polygon-leetcode-1039</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/2r2qr0-NZFc/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Score Triangulation of Polygon | Simplified for Beginners | Leetcode 1039 | codestorywithMIK</video:title><video:description>Minimum Score Triangulation of Polygon | Simplified for Beginners | Leetcode 1039 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/2r2qr0-NZFc</video:player_loc><video:duration>1462</video:duration><video:publication_date>2025-09-29T08:10:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/taking-maximum-energy-from-the-mystic-dungeon-leetcode-3147</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/zJFP_vzSIEY/hqdefault.jpg</video:thumbnail_loc><video:title>Taking Maximum Energy From the Mystic Dungeon | 2 Approaches | Leetcode 3147 | codestorywithMIK</video:title><video:description>Taking Maximum Energy From the Mystic Dungeon | 2 Approaches | Leetcode 3147 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/zJFP_vzSIEY</video:player_loc><video:duration>1110</video:duration><video:publication_date>2025-10-10T17:21:41.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/maximum-total-damage-with-spell-casting-leetcode-3186</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/i0hOOfgEJaU/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Total Damage With Spell Casting | 2 Approaches | Detailed | Leetcode 3186 | codestorywithMIK</video:title><video:description>Maximum Total Damage With Spell Casting | 2 Approaches | Detailed | Leetcode 3186 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/i0hOOfgEJaU</video:player_loc><video:duration>2441</video:duration><video:publication_date>2025-10-11T08:49:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/find-sum-of-array-product-of-magical-sequences-leetcode-3539</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/tC698np8o6s/hqdefault.jpg</video:thumbnail_loc><video:title>Find Sum of Array Product of Magical Sequences | Super Detailed | Leetcode 3539 | codestorywithMIK</video:title><video:description>Find Sum of Array Product of Magical Sequences | Super Detailed | Leetcode 3539 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/tC698np8o6s</video:player_loc><video:duration>4894</video:duration><video:publication_date>2025-10-12T15:52:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/ones-and-zeroes-leetcode-474</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/P_mC0wOTNV4/hqdefault.jpg</video:thumbnail_loc><video:title>Ones and Zeroes | Think From Scratch | Will Greedy Work | Leetcode 474 | codestorywithMIK</video:title><video:description>Ones and Zeroes | Think From Scratch | Will Greedy Work | Leetcode 474 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/P_mC0wOTNV4</video:player_loc><video:duration>1509</video:duration><video:publication_date>2025-11-11T07:02:38.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/paths-in-matrix-whose-sum-is-divisible-by-k-leetcode-2435</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/k-9LZZEB1sI/hqdefault.jpg</video:thumbnail_loc><video:title>Paths in Matrix Whose Sum Is Divisible by K | Simplest Approaches | Leetcode 2435 | codestorywithMIK</video:title><video:description>Paths in Matrix Whose Sum Is Divisible by K | Simplest Approaches | Leetcode 2435 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/k-9LZZEB1sI</video:player_loc><video:duration>1519</video:duration><video:publication_date>2025-11-26T04:30:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/count-partitions-with-max-min-difference-at-most-k-leetcode-3578</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/0mRKXFfXHQU/hqdefault.jpg</video:thumbnail_loc><video:title>Count Partitions With Max-Min Difference at Most K | Multiple Approaches | Leetcode 3578 | MIK</video:title><video:description>Count Partitions With Max-Min Difference at Most K | Multiple Approaches | Leetcode 3578 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/0mRKXFfXHQU</video:player_loc><video:duration>3427</video:duration><video:publication_date>2025-12-06T17:58:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/maximum-profit-from-trading-stocks-with-discounts-leetcode-3562</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/S-kmwk0PqOU/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Profit from Trading Stocks with Discounts | Super Detailed | Beginner | Leetcode 3562 | MIK</video:title><video:description>Maximum Profit from Trading Stocks with Discounts | Super Detailed | Beginner | Leetcode 3562 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/S-kmwk0PqOU</video:player_loc><video:duration>4145</video:duration><video:publication_date>2025-12-16T15:05:41.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/best-time-to-buy-and-sell-stock-v-leetcode-3573</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/nJwH8mNvyDY/hqdefault.jpg</video:thumbnail_loc><video:title>Best Time to Buy and Sell Stock V | Made Simple | Detailed | Leetcode 3573 | codestorywithMIK</video:title><video:description>Best Time to Buy and Sell Stock V | Made Simple | Detailed | Leetcode 3573 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/nJwH8mNvyDY</video:player_loc><video:duration>2425</video:duration><video:publication_date>2025-12-17T07:23:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/delete-columns-to-make-sorted-iii-leetcode-960</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/mKFqKaD7g34/hqdefault.jpg</video:thumbnail_loc><video:title>Delete Columns to Make Sorted III | Hard Made Easy | Dry Run | Leetcode 960 | codestorywithMIK</video:title><video:description>Delete Columns to Make Sorted III | Hard Made Easy | Dry Run | Leetcode 960 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/mKFqKaD7g34</video:player_loc><video:duration>2132</video:duration><video:publication_date>2025-12-22T07:38:47.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/number-of-ways-to-paint-n-3-grid-leetcode-1411</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/WXdLIuRhiRg/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Ways to Paint N × 3 Grid | Hard Made Easy | Simple Story To Code | Leetcode 1411 | MIK</video:title><video:description>Number of Ways to Paint N × 3 Grid | Hard Made Easy | Simple Story To Code | Leetcode 1411 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/WXdLIuRhiRg</video:player_loc><video:duration>1455</video:duration><video:publication_date>2026-01-03T08:54:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/minimum-cost-path-with-teleportations-leetcode-3651</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/KySBrz1lk4I/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Cost Path with Teleportations | 3 Approaches | Postmortem | Leetcode 3651 | codestorywithMIK</video:title><video:description>Minimum Cost Path with Teleportations | 3 Approaches | Postmortem | Leetcode 3651 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/KySBrz1lk4I</video:player_loc><video:duration>4940</video:duration><video:publication_date>2026-01-29T13:52:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/trionic-array-ii-leetcode-3640</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/c0xdRaDFZJk/hqdefault.jpg</video:thumbnail_loc><video:title>Trionic Array II | Simplest Approach | Detailed Intuition | Leetcode 3640 | codestorywithMIK</video:title><video:description>Trionic Array II | Simplest Approach | Detailed Intuition | Leetcode 3640 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/c0xdRaDFZJk</video:player_loc><video:duration>2205</video:duration><video:publication_date>2026-02-04T01:23:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/find-all-possible-stable-binary-arrays-i-leetcode-3129</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/siYxju3TZdY/hqdefault.jpg</video:thumbnail_loc><video:title>Find All Possible Stable Binary Arrays I | 2 Approaches | Detailed Intuition | Leetcode 3129 | MIK</video:title><video:description>Find All Possible Stable Binary Arrays I | 2 Approaches | Detailed Intuition | Leetcode 3129 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/siYxju3TZdY</video:player_loc><video:duration>2818</video:duration><video:publication_date>2026-03-09T00:50:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/find-all-possible-stable-binary-arrays-ii-leetcode-3130</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8JpKkXEO0hU/hqdefault.jpg</video:thumbnail_loc><video:title>Find All Possible Stable Binary Arrays II | Derive From Part I | Detailed | Leetcode 3130 | MIK</video:title><video:description>Find All Possible Stable Binary Arrays II | Derive From Part I | Detailed | Leetcode 3130 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8JpKkXEO0hU</video:player_loc><video:duration>1533</video:duration><video:publication_date>2026-03-09T18:31:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/find-the-string-with-lcp-leetcode-2573</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/LBeyZTNybMQ/hqdefault.jpg</video:thumbnail_loc><video:title>Find the String with LCP | Deep Dive | Dry Runs | 2 Ways | Leetcode 2573 | codestorywithMIK</video:title><video:description>Find the String with LCP | Deep Dive | Dry Runs | 2 Ways | Leetcode 2573 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/LBeyZTNybMQ</video:player_loc><video:duration>3140</video:duration><video:publication_date>2026-03-28T02:51:56.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/maximum-amount-of-money-robot-can-earn-leetcode-3418</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/4X3B07RFNW8/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Amount of Money Robot Can Earn | Simple Straight Forward | Leetcode 3418 | codestorywithMIK</video:title><video:description>Maximum Amount of Money Robot Can Earn | Simple Straight Forward | Leetcode 3418 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/4X3B07RFNW8</video:player_loc><video:duration>952</video:duration><video:publication_date>2026-04-02T02:10:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/maximum-walls-destroyed-by-robots-leetcode-3661</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/niOPy-UHahQ/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Walls Destroyed by Robots | Detailed | Build Intuition | Leetcode 3661 | codestorywithMIK</video:title><video:description>Maximum Walls Destroyed by Robots | Detailed | Build Intuition | Leetcode 3661 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/niOPy-UHahQ</video:player_loc><video:duration>2845</video:duration><video:publication_date>2026-04-03T10:41:21.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/minimum-distance-to-type-a-word-using-two-fingers-leetcode-1320</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/26jlH4R9cf8/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Distance to Type a Word Using Two Fingers | Detailed | Intuition | Leetcode 1320 | MIK</video:title><video:description>Minimum Distance to Type a Word Using Two Fingers | Detailed | Intuition | Leetcode 1320 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/26jlH4R9cf8</video:player_loc><video:duration>2795</video:duration><video:publication_date>2026-04-12T10:37:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/maximum-score-from-grid-operations-leetcode-3225</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/f81qWxDkj0Q/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Score From Grid Operations | Super Detailed For Beginners | Leetcode 3225 | codestorywithMIK</video:title><video:description>Maximum Score From Grid Operations | Super Detailed For Beginners | Leetcode 3225 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/f81qWxDkj0Q</video:player_loc><video:duration>4174</video:duration><video:publication_date>2026-04-29T15:58:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/maximum-path-score-in-a-grid-leetcode-3742</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/S8ETOX9njRQ/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Path Score in a Grid | Detailed | Simplified | Leetcode 3742 | codestorywithMIK</video:title><video:description>Maximum Path Score in a Grid | Detailed | Simplified | Leetcode 3742 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/S8ETOX9njRQ</video:player_loc><video:duration>1461</video:duration><video:publication_date>2026-04-30T06:09:49.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/rotated-digits-leetcode-788</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ezPJaeToxsQ/hqdefault.jpg</video:thumbnail_loc><video:title>Rotated Digits | 3 Approached | Simplified | Detailed | Leetcode 788 | codestorywithMIK</video:title><video:description>Rotated Digits | 3 Approached | Simplified | Detailed | Leetcode 788 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ezPJaeToxsQ</video:player_loc><video:duration>1730</video:duration><video:publication_date>2026-05-02T07:51:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/maximum-number-of-jumps-to-reach-the-last-index-leetcode-2770</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/f97M-I3V8U4/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Number of Jumps to Reach the Last Index | Simple Intuition | Leetcode 2770 | MIK</video:title><video:description>Maximum Number of Jumps to Reach the Last Index | Simple Intuition | Leetcode 2770 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/f97M-I3V8U4</video:player_loc><video:duration>1044</video:duration><video:publication_date>2026-05-10T03:27:35.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/jump-game-v-leetcode-1340</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/y0akfzqlxc8/hqdefault.jpg</video:thumbnail_loc><video:title>Jump Game V | Detailed | Simplified | Intuition | Leetcode 1340 | codestorywithMIK</video:title><video:description>Jump Game V | Detailed | Simplified | Intuition | Leetcode 1340 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/y0akfzqlxc8</video:player_loc><video:duration>2710</video:duration><video:publication_date>2026-05-23T02:53:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/jump-game-vii-leetcode-1871</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/LQjehUy3AnM/hqdefault.jpg</video:thumbnail_loc><video:title>Jump Game VII | Brute Force | Optimal | Simple Intuition | Leetcode 1871 | codestorywithMIK</video:title><video:description>Jump Game VII | Brute Force | Optimal | Simple Intuition | Leetcode 1871 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/LQjehUy3AnM</video:player_loc><video:duration>2207</video:duration><video:publication_date>2026-05-25T11:48:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/jump-game-vii-leetcode-3753</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/POvt5kXDesE/hqdefault.jpg</video:thumbnail_loc><video:title>Total Waviness of Numbers in Range II | Super Detailed | For Beginners | Leetcode 3753 | MIK</video:title><video:description>Total Waviness of Numbers in Range II | Super Detailed | For Beginners | Leetcode 3753 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/POvt5kXDesE</video:player_loc><video:duration>4263</video:duration><video:publication_date>2026-06-05T09:41:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/number-of-zigzag-arrays-i-leetcode-3699</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/e08vqe1VIF4/hqdefault.jpg</video:thumbnail_loc><video:title>Number of ZigZag Arrays I | Brute Force | Better | Optimal | Leetcode 3699 | codestorywithMIK</video:title><video:description>Number of ZigZag Arrays I | Brute Force | Better | Optimal | Leetcode 3699 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/e08vqe1VIF4</video:player_loc><video:duration>4048</video:duration><video:publication_date>2026-06-23T19:02:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/number-of-paths-with-max-score-leetcode-1301</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/52a_yLVy_MQ/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Paths with Max Score | Detailed Explanation | 2 Ways | Leetcode 1301 | codestorywithMIK</video:title><video:description>Number of Paths with Max Score | Detailed Explanation | 2 Ways | Leetcode 1301 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/52a_yLVy_MQ</video:player_loc><video:duration>2824</video:duration><video:publication_date>2026-07-05T06:09:53.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/find-the-number-of-subsequences-with-equal-gcd-leetcode-3336</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9HLmfC-nyNU/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Number of Subsequences With Equal GCD | Detailed Explanation | 3 Ways | Leetcode 3336 | MIK</video:title><video:description>Find the Number of Subsequences With Equal GCD | Detailed Explanation | 3 Ways | Leetcode 3336 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9HLmfC-nyNU</video:player_loc><video:duration>2413</video:duration><video:publication_date>2026-07-14T03:57:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/stone-game-leetcode-877</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8jvt2vw7j_Y/hqdefault.jpg</video:thumbnail_loc><video:title>Stone Game | Simple Strategy | 2 Approaches | Leetcode 877 | codestorywithMIK</video:title><video:description>Stone Game | Simple Strategy | 2 Approaches | Leetcode 877 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8jvt2vw7j_Y</video:player_loc><video:duration>1639</video:duration><video:publication_date>2026-08-02T03:15:17.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/stone-game-iv-leetcode-1510</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/sflSTlWFxxo/hqdefault.jpg</video:thumbnail_loc><video:title>Stone Game IV | Simplified Approaches | Leetcode 1510 | codestorywithMIK</video:title><video:description>Stone Game IV | Simplified Approaches | Leetcode 1510 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/sflSTlWFxxo</video:player_loc><video:duration>1475</video:duration><video:publication_date>2026-08-10T10:53:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/stone-game-v-leetcode-1563</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/zIy0DkjsNuI/hqdefault.jpg</video:thumbnail_loc><video:title>Stone Game V | Simplified Explanations | Leetcode 1563 | codestorywithMIK</video:title><video:description>Stone Game V | Simplified Explanations | Leetcode 1563 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/zIy0DkjsNuI</video:player_loc><video:duration>1909</video:duration><video:publication_date>2026-08-17T03:57:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/stone-game-viii-leetcode-1872</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QdILmPwk0dI/hqdefault.jpg</video:thumbnail_loc><video:title>Stone Game VIII | Simplified Approach | Leetcode 1872 | codestorywithMIK</video:title><video:description>Stone Game VIII | Simplified Approach | Leetcode 1872 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QdILmPwk0dI</video:player_loc><video:duration>1615</video:duration><video:publication_date>2026-08-24T04:40:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/distinct-subsequences-leetcode-115</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/CIZa4MhIoI8/hqdefault.jpg</video:thumbnail_loc><video:title>Distinct Subsequences | 3 Detailed Ways | Simplified | Leetcode 115 | codestorywithMIK</video:title><video:description>Distinct Subsequences | 3 Detailed Ways | Simplified | Leetcode 115 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/CIZa4MhIoI8</video:player_loc><video:duration>2659</video:duration><video:publication_date>2026-09-06T03:47:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/distinct-subsequences-ii-leetcode-940</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/yjULp_PDY-c/hqdefault.jpg</video:thumbnail_loc><video:title>Distinct Subsequences II | 3 Detailed Ways | Simplified | GOOGLE | Leetcode 940 | codestorywithMIK</video:title><video:description>Distinct Subsequences II | 3 Detailed Ways | Simplified | GOOGLE | Leetcode 940 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/yjULp_PDY-c</video:player_loc><video:duration>3220</video:duration><video:publication_date>2026-09-07T08:01:49.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/maximum-score-of-non-overlapping-intervals-leetcode-3414</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/pqYk8mUEK18/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Score of Non-overlapping Intervals | Beginner Friendly | Leetcode 3414 | codestorywithMIK</video:title><video:description>Maximum Score of Non-overlapping Intervals | Beginner Friendly | Leetcode 3414 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/pqYk8mUEK18</video:player_loc><video:duration>2955</video:duration><video:publication_date>2026-09-12T04:28:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/maximum-number-of-non-overlapping-palindrome-substrings-leetcode-2472</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ayGS9mFwXG0/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Number of Non-overlapping Palindrome Substrings | 6 Detailed Approach | Leetcode 2472 | MIK</video:title><video:description>Maximum Number of Non-overlapping Palindrome Substrings | 6 Detailed Approach | Leetcode 2472 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ayGS9mFwXG0</video:player_loc><video:duration>4255</video:duration><video:publication_date>2026-09-15T01:18:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/maximum-score-of-non-overlapping-intervals-leetcode-1621</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/rpcnlDOvNMs/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Sets of K Non-Overlapping Line Segments | Beginner Friendly | Leetcode 1621 | MIK</video:title><video:description>Number of Sets of K Non-Overlapping Line Segments | Beginner Friendly | Leetcode 1621 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/rpcnlDOvNMs</video:player_loc><video:duration>1923</video:duration><video:publication_date>2026-09-16T04:31:25.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/find-x-value-of-array-i-leetcode-3524</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/uzycW0qCd0o/hqdefault.jpg</video:thumbnail_loc><video:title>Find X Value of Array I | Brute Force To Optimal | Detailed | Leetcode 3524 | codestorywithMIK</video:title><video:description>Find X Value of Array I | Brute Force To Optimal | Detailed | Leetcode 3524 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/uzycW0qCd0o</video:player_loc><video:duration>2623</video:duration><video:publication_date>2026-09-21T08:57:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/check-if-there-is-a-valid-parentheses-string-path-leetcode-2267</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5-JpdmLkKQc/hqdefault.jpg</video:thumbnail_loc><video:title>Check if There Is a Valid Parentheses String Path | Simple Approaches | Leetcode 2267 | MIK</video:title><video:description>Check if There Is a Valid Parentheses String Path | Simple Approaches | Leetcode 2267 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5-JpdmLkKQc</video:player_loc><video:duration>1884</video:duration><video:publication_date>2026-09-29T05:33:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/dynamic-programming/n-th-tribonacci-number-leetcode-1137</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Z4Pi3QALlJE/hqdefault.jpg</video:thumbnail_loc><video:title>N-th Tribonacci Number | 3 Approaches | AMAZON | Leetcode 1137 | codestorywithMIK</video:title><video:description>N-th Tribonacci Number | 3 Approaches | AMAZON | Leetcode 1137 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Z4Pi3QALlJE</video:player_loc><video:duration>1246</video:duration><video:publication_date>2024-04-24T02:07:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/tries/word-search-ii-leetcode-212</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/DMP2bqW6URA/hqdefault.jpg</video:thumbnail_loc><video:title>Word Search II | Leetcode 212 | Detailed | codestorywithMIK</video:title><video:description>Word Search II | Leetcode 212 | Detailed | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/DMP2bqW6URA</video:player_loc><video:duration>2677</video:duration><video:publication_date>2022-11-05T04:57:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/tries/implement-trie-prefix-tree-leetcode-208</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YXefcFMpemo/hqdefault.jpg</video:thumbnail_loc><video:title>Implement Trie (Prefix Tree) | Microsoft | Leetcode - 208</video:title><video:description>Implement Trie (Prefix Tree) | Microsoft | Leetcode - 208. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YXefcFMpemo</video:player_loc><video:duration>1860</video:duration><video:publication_date>2023-03-17T13:54:39.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/tries/maximum-xor-of-two-numbers-in-an-array-leetcode-421</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/JS48Hp2_Z4I/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum XOR of Two Numbers in an Array | Detailed | Intuition | MICROSOFT | Leetcode-421</video:title><video:description>Maximum XOR of Two Numbers in an Array | Detailed | Intuition | MICROSOFT | Leetcode-421. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/JS48Hp2_Z4I</video:player_loc><video:duration>3372</video:duration><video:publication_date>2023-11-15T10:09:58.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/tries/longest-common-suffix-queries-leetcode-3093</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/jZX2Z5DKR2M/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Common Suffix Queries | Simple TRIE | Clean Code | Leetcode 3093 | codestorywithMIK</video:title><video:description>Longest Common Suffix Queries | Simple TRIE | Clean Code | Leetcode 3093 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/jZX2Z5DKR2M</video:player_loc><video:duration>2914</video:duration><video:publication_date>2024-03-25T05:40:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/tries/replace-words-leetcode-648</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/FxmFhwmKumU/hqdefault.jpg</video:thumbnail_loc><video:title>Replace Words | Using TRIE | Uber | Leetcode 648 | codestorywithMIK</video:title><video:description>Replace Words | Using TRIE | Uber | Leetcode 648 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/FxmFhwmKumU</video:player_loc><video:duration>1369</video:duration><video:publication_date>2024-06-07T12:37:56.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/tries/find-the-length-of-the-longest-common-prefix-leetcode-3043</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/OZNS72LANFU/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Length of the Longest Common Prefix | 2 Approaches | Leetcode 3043 | codestorywithMIK</video:title><video:description>Find the Length of the Longest Common Prefix | 2 Approaches | Leetcode 3043 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/OZNS72LANFU</video:player_loc><video:duration>2227</video:duration><video:publication_date>2024-09-24T03:14:53.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/tries/sum-of-prefix-scores-of-strings-leetcode-2416</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/PRHedN3h2Gc/hqdefault.jpg</video:thumbnail_loc><video:title>Sum of Prefix Scores of Strings | Trie | Full Easy Dry Run | Leetcode 2416 | codestorywithMIK</video:title><video:description>Sum of Prefix Scores of Strings | Trie | Full Easy Dry Run | Leetcode 2416 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/PRHedN3h2Gc</video:player_loc><video:duration>1881</video:duration><video:publication_date>2024-09-25T03:46:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/tries/count-prefix-and-suffix-pairs-i-leetcode-3042</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/xg7z7VVsYIg/hqdefault.jpg</video:thumbnail_loc><video:title>Count Prefix and Suffix Pairs I | Brute Force | Trie | Leetcode 3042 | codestorywithMIK</video:title><video:description>Count Prefix and Suffix Pairs I | Brute Force | Trie | Leetcode 3042 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/xg7z7VVsYIg</video:player_loc><video:duration>2573</video:duration><video:publication_date>2025-01-08T04:57:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/tries/counting-words-with-a-given-prefix-leetcode-2185</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/pnOJGH2gVJU/hqdefault.jpg</video:thumbnail_loc><video:title>Counting Words With a Given Prefix | Brute Force | Trie | Leetcode 2185 | codestorywithMIK</video:title><video:description>Counting Words With a Given Prefix | Brute Force | Trie | Leetcode 2185 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/pnOJGH2gVJU</video:player_loc><video:duration>1885</video:duration><video:publication_date>2025-01-09T03:20:45.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/tries/delete-duplicate-folders-in-system-leetcode-1948</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Dw10MLHBkuE/hqdefault.jpg</video:thumbnail_loc><video:title>Delete Duplicate Folders in System | Super Detailed Explanation | Leetcode 1948 | codestorywithMIK</video:title><video:description>Delete Duplicate Folders in System | Super Detailed Explanation | Leetcode 1948 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Dw10MLHBkuE</video:player_loc><video:duration>4684</video:duration><video:publication_date>2025-07-20T11:18:48.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/bag-of-tokens-leetcode-948</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/LCx1WzlYgvw/hqdefault.jpg</video:thumbnail_loc><video:title>Bag of Tokens | Greedy Explanation | Google | Leetcode 948</video:title><video:description>Bag of Tokens | Greedy Explanation | Google | Leetcode 948. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/LCx1WzlYgvw</video:player_loc><video:duration>1108</video:duration><video:publication_date>2022-09-12T11:41:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/boats-to-save-people-leetcode-881</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/UsQzOL6r0HY/hqdefault.jpg</video:thumbnail_loc><video:title>Boats to Save People | Greedy | Google | codestorywithMIK</video:title><video:description>Boats to Save People | Greedy | Google | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/UsQzOL6r0HY</video:player_loc><video:duration>839</video:duration><video:publication_date>2022-09-14T15:03:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/break-a-palindrome-leetcode-1328</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Pbx0Pvyh7D4/hqdefault.jpg</video:thumbnail_loc><video:title>Break a Palindrome | Easy Explanation | Leetcode 1328 | codestorywithMIK</video:title><video:description>Break a Palindrome | Easy Explanation | Leetcode 1328 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Pbx0Pvyh7D4</video:player_loc><video:duration>906</video:duration><video:publication_date>2022-09-30T01:30:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/broken-calculator-leetcode-991</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/svM2wbyMT4g/hqdefault.jpg</video:thumbnail_loc><video:title>Broken Calculator | Greedy | Samsung |  Leetcode 991</video:title><video:description>Broken Calculator | Greedy | Samsung |  Leetcode 991. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/svM2wbyMT4g</video:player_loc><video:duration>984</video:duration><video:publication_date>2022-10-01T01:30:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/minimum-time-to-make-rope-colorful-leetcode-1578</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/_xNrzKfORNA/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Time to Make Rope Colorful | Greedy Intuition | Leetcode 1578 | codestorywithMIK</video:title><video:description>Minimum Time to Make Rope Colorful | Greedy Intuition | Leetcode 1578 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/_xNrzKfORNA</video:player_loc><video:duration>1421</video:duration><video:publication_date>2022-10-03T07:39:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/earliest-possible-day-of-full-bloom-leetcode-2136</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/kqOVhPfrP_I/hqdefault.jpg</video:thumbnail_loc><video:title>Earliest Possible Day of Full Bloom(Google, Amazon, Microsoft, Adobe):Explanation ➕ Live Coding</video:title><video:description>Earliest Possible Day of Full Bloom(Google, Amazon, Microsoft, Adobe):Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/kqOVhPfrP_I</video:player_loc><video:duration>2037</video:duration><video:publication_date>2022-10-29T06:04:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/longest-palindrome-by-concatenating-two-letter-words-leetcode-2131</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Q9EhdRmisVU/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Palindrome by Concatenating Two Letter Words: Greedy Explanation ➕ Live Coding 🧑🏻‍💻</video:title><video:description>Longest Palindrome by Concatenating Two Letter Words: Greedy Explanation ➕ Live Coding 🧑🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Q9EhdRmisVU</video:player_loc><video:duration>1658</video:duration><video:publication_date>2022-11-03T04:37:52.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/maximum-69-number-leetcode-1323</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/6dh1H5Hv4TI/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum 69 Number | Without String Conversion | Leetcode 1323 | codestorywithMIK</video:title><video:description>Maximum 69 Number | Without String Conversion | Leetcode 1323 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/6dh1H5Hv4TI</video:player_loc><video:duration>884</video:duration><video:publication_date>2022-11-07T04:20:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/maximum-bags-with-full-capacity-of-rocks-leetcode-2279</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/JpQaui_-a4c/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Bags With Full Capacity of Rocks | Leetcode 2279 | Story To Code | codestorywithMIK</video:title><video:description>Maximum Bags With Full Capacity of Rocks | Leetcode 2279 | Story To Code | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/JpQaui_-a4c</video:player_loc><video:duration>866</video:duration><video:publication_date>2022-12-27T03:14:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/minimum-rounds-to-complete-all-tasks-leetcode-2244</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/IIalYnjpAJA/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Rounds to Complete All Tasks : Explanation ➕ Live Coding 🧑🏻‍💻👩🏻‍💻</video:title><video:description>Minimum Rounds to Complete All Tasks : Explanation ➕ Live Coding 🧑🏻‍💻👩🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/IIalYnjpAJA</video:player_loc><video:duration>1212</video:duration><video:publication_date>2023-01-04T08:18:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/maximum-ice-cream-bars-leetcode-1833</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/uY3mWwJvRkA/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Ice Cream Bars | Leetcode 1833 | Simple Approach | codestorywithMIK</video:title><video:description>Maximum Ice Cream Bars | Leetcode 1833 | Simple Approach | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/uY3mWwJvRkA</video:player_loc><video:duration>248</video:duration><video:publication_date>2023-01-06T05:32:43.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/gas-station-leetcode-134</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/tcOcmNHFTTM/hqdefault.jpg</video:thumbnail_loc><video:title>Gas Station | Leetcode 134 | Detailed Explanation | Google | Amazon | codestorywithMIK</video:title><video:description>Gas Station | Leetcode 134 | Detailed Explanation | Google | Amazon | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/tcOcmNHFTTM</video:player_loc><video:duration>2790</video:duration><video:publication_date>2023-01-07T06:59:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/optimal-partition-of-string-leetcode-2405</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QonXo5Em5VA/hqdefault.jpg</video:thumbnail_loc><video:title>Optimal Partition of String - (AMAZON) | Leetcode-2405 | Explanation ➕ Live Coding</video:title><video:description>Optimal Partition of String - (AMAZON) | Leetcode-2405 | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QonXo5Em5VA</video:player_loc><video:duration>955</video:duration><video:publication_date>2023-04-04T04:22:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/dota2-senate-leetcode-649</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/r3lOL6srx1E/hqdefault.jpg</video:thumbnail_loc><video:title>Dota2 Senate | Brute + Slight Optimal | Leetcode - 649 | META | Explanation ➕ Live Coding 🧑🏻‍💻</video:title><video:description>Dota2 Senate | Brute + Slight Optimal | Leetcode - 649 | META | Explanation ➕ Live Coding 🧑🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/r3lOL6srx1E</video:player_loc><video:duration>1552</video:duration><video:publication_date>2023-05-04T16:49:34.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/minimum-replacements-to-sort-the-array-leetcode-2366</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/2nRXvlxkU2Y/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Replacements to Sort the Array | Cleanest Code | Full Dry Run | GOOGLE | Leetcode - 2366</video:title><video:description>Minimum Replacements to Sort the Array | Cleanest Code | Full Dry Run | GOOGLE | Leetcode - 2366. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/2nRXvlxkU2Y</video:player_loc><video:duration>1857</video:duration><video:publication_date>2023-08-30T07:35:51.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/minimum-number-of-taps-to-open-to-water-a-garden-leetcode-1326</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/2hzsf3D9Xvw/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Number of Taps to Open to Water a Garden | Full Dry Run | ATLASSIAN | Leetcode - 1326</video:title><video:description>Minimum Number of Taps to Open to Water a Garden | Full Dry Run | ATLASSIAN | Leetcode - 1326. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/2hzsf3D9Xvw</video:player_loc><video:duration>1474</video:duration><video:publication_date>2023-08-31T04:01:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/minimum-deletions-to-make-character-frequencies-unique-leetcode-1647</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/uCbOYh01wYU/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Deletions to Make Character Frequencies Unique | 2 Approaches | MICROSOFT | Leetcode - 1647</video:title><video:description>Minimum Deletions to Make Character Frequencies Unique | 2 Approaches | MICROSOFT | Leetcode - 1647. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/uCbOYh01wYU</video:player_loc><video:duration>1515</video:duration><video:publication_date>2023-09-12T04:07:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/candy-leetcode-135</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YUT13Koh5Jg/hqdefault.jpg</video:thumbnail_loc><video:title>CANDY | 2 Approaches | O(1) Space | O(N) Space | AMAZON | Leetcode 135 | codestorywithMIK</video:title><video:description>CANDY | 2 Approaches | O(1) Space | O(N) Space | AMAZON | Leetcode 135 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YUT13Koh5Jg</video:player_loc><video:duration>2373</video:duration><video:publication_date>2023-09-13T07:39:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/remove-colored-pieces-if-both-neighbors-are-the-same-color-leetcode-2038</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8jlP3D1Dnj4/hqdefault.jpg</video:thumbnail_loc><video:title>Remove Colored Pieces if Both Neighbors are the Same Color | Intuitive | GOOGLE | Leetcode - 2038</video:title><video:description>Remove Colored Pieces if Both Neighbors are the Same Color | Intuitive | GOOGLE | Leetcode - 2038. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8jlP3D1Dnj4</video:player_loc><video:duration>986</video:duration><video:publication_date>2023-10-02T08:05:34.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/maximum-score-of-a-good-subarray-leetcode-1793</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/2XMBLBdgqW8/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Score of a Good Subarray | GREEDY | INTUITION | AMAZON | Leetcode - 1793</video:title><video:description>Maximum Score of a Good Subarray | GREEDY | INTUITION | AMAZON | Leetcode - 1793. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/2XMBLBdgqW8</video:player_loc><video:duration>1525</video:duration><video:publication_date>2023-10-22T06:51:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/eliminate-maximum-number-of-monsters-leetcode-1921</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/T67MicJdTug/hqdefault.jpg</video:thumbnail_loc><video:title>Eliminate Maximum Number of Monsters | Intuition | GOOGLE | META | AMAZON | Leetcode - 1921</video:title><video:description>Eliminate Maximum Number of Monsters | Intuition | GOOGLE | META | AMAZON | Leetcode - 1921. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/T67MicJdTug</video:player_loc><video:duration>1256</video:duration><video:publication_date>2023-11-07T04:37:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/maximum-element-after-decreasing-and-rearranging-leetcode-1846</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/HGkK9n5CUaY/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Element After Decreasing and Rearranging | Intuition | Leetcode 1846 | codestorywithMIK</video:title><video:description>Maximum Element After Decreasing and Rearranging | Intuition | Leetcode 1846 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/HGkK9n5CUaY</video:player_loc><video:duration>950</video:duration><video:publication_date>2023-11-15T03:22:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/maximum-number-of-coins-you-can-get-leetcode-1561</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/H762GDF08mg/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Number of Coins You Can Get | Greedy | 2 Approaches | Leetcode - 1561</video:title><video:description>Maximum Number of Coins You Can Get | Greedy | 2 Approaches | Leetcode - 1561. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/H762GDF08mg</video:player_loc><video:duration>1338</video:duration><video:publication_date>2023-11-24T02:42:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/minimum-number-of-operations-to-make-array-empty-leetcode-2870</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/lkPNh2M1lUs/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Number of Operations to Make Array Empty | Explained with Reasons | Greedy | Leetcode 2870</video:title><video:description>Minimum Number of Operations to Make Array Empty | Explained with Reasons | Greedy | Leetcode 2870. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/lkPNh2M1lUs</video:player_loc><video:duration>1221</video:duration><video:publication_date>2024-01-04T03:02:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/water-the-plants</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/_twHfnNwTwE/hqdefault.jpg</video:thumbnail_loc><video:title>Water the plants | Intuition Explained | Similar Problem | GfG POTD</video:title><video:description>Water the plants | Intuition Explained | Similar Problem | GfG POTD. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/_twHfnNwTwE</video:player_loc><video:duration>1951</video:duration><video:publication_date>2024-01-18T08:27:13.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/find-polygon-with-the-largest-perimeter-leetcode-2971</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/3RUkd0SPnPk/hqdefault.jpg</video:thumbnail_loc><video:title>Find Polygon With the Largest Perimeter | Thought Process | Greedy | Leetcode 2971</video:title><video:description>Find Polygon With the Largest Perimeter | Thought Process | Greedy | Leetcode 2971. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/3RUkd0SPnPk</video:player_loc><video:duration>1419</video:duration><video:publication_date>2024-02-15T06:15:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/least-number-of-unique-integers-after-k-removals-leetcode-1481</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/O5v9Tqv2ZDA/hqdefault.jpg</video:thumbnail_loc><video:title>Least Number of Unique Integers after K Removals | 3 Approaches | Greedy | Leetcode 1481</video:title><video:description>Least Number of Unique Integers after K Removals | 3 Approaches | Greedy | Leetcode 1481. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/O5v9Tqv2ZDA</video:player_loc><video:duration>2622</video:duration><video:publication_date>2024-02-16T07:26:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/furthest-building-you-can-reach-leetcode-1642</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/dUkdAjY23p8/hqdefault.jpg</video:thumbnail_loc><video:title>Furthest Building You Can Reach | What is Lazy Greedy | Recursion | Memoization | Leetcode 1642</video:title><video:description>Furthest Building You Can Reach | What is Lazy Greedy | Recursion | Memoization | Leetcode 1642. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/dUkdAjY23p8</video:player_loc><video:duration>3083</video:duration><video:publication_date>2024-02-17T05:21:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/earliest-second-to-mark-indices-i-leetcode-3048</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/BSftr10xQm0/hqdefault.jpg</video:thumbnail_loc><video:title>Earliest Second to Mark Indices I | Detailed Intuition | Leetcode Weekly Contest 386 | Leetcode 3048</video:title><video:description>Earliest Second to Mark Indices I | Detailed Intuition | Leetcode Weekly Contest 386 | Leetcode 3048. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/BSftr10xQm0</video:player_loc><video:duration>3610</video:duration><video:publication_date>2024-02-26T15:18:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/minimum-deletions-to-make-string-k-special-leetcode-3085</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/u-DEw481l04/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Deletions to Make String K-Special | 2 Simple Approaches | Leetcode 3085 | codestorywithMIK</video:title><video:description>Minimum Deletions to Make String K-Special | 2 Simple Approaches | Leetcode 3085 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/u-DEw481l04</video:player_loc><video:duration>2231</video:duration><video:publication_date>2024-03-17T09:16:57.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/task-scheduler-leetcode-621</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QDsFBLGL9MM/hqdefault.jpg</video:thumbnail_loc><video:title>Task Scheduler | Using Greedy Only | No Heap | Leetcode 621 | codestorywithMIK</video:title><video:description>Task Scheduler | Using Greedy Only | No Heap | Leetcode 621 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QDsFBLGL9MM</video:player_loc><video:duration>1640</video:duration><video:publication_date>2024-03-20T17:58:49.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/maximize-happiness-of-selected-children-leetcode-3075</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Gk6ZZskgFTg/hqdefault.jpg</video:thumbnail_loc><video:title>Maximize Happiness of Selected Children | Sorting | Max Heap | Leetcode 3075 | codestorywithMIK</video:title><video:description>Maximize Happiness of Selected Children | Sorting | Max Heap | Leetcode 3075 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Gk6ZZskgFTg</video:player_loc><video:duration>908</video:duration><video:publication_date>2024-05-09T02:56:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/find-the-maximum-sum-of-node-values-leetcode-3068</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QIiQdsVvjNw/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Maximum Sum of Node Values  | Two Approaches | Detailed | Leetcode 3068 | codestorywithMIK</video:title><video:description>Find the Maximum Sum of Node Values  | Two Approaches | Detailed | Leetcode 3068 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QIiQdsVvjNw</video:player_loc><video:duration>2748</video:duration><video:publication_date>2024-05-19T05:57:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/minimum-increment-to-make-array-unique-leetcode-945</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Y3G_pdcqspw/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Increment to Make Array Unique | Sorting | Counting Sort | Leetcode 945 | codestorywithMIK</video:title><video:description>Minimum Increment to Make Array Unique | Sorting | Counting Sort | Leetcode 945 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Y3G_pdcqspw</video:player_loc><video:duration>1741</video:duration><video:publication_date>2024-06-14T08:52:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/patching-array-leetcode-330</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/K2IomuIFbPg/hqdefault.jpg</video:thumbnail_loc><video:title>Patching Array | Thought Process | Dry Runs | GOOGLE | Leetcode 330 | codestorywithMIK</video:title><video:description>Patching Array | Thought Process | Dry Runs | GOOGLE | Leetcode 330 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/K2IomuIFbPg</video:player_loc><video:duration>1923</video:duration><video:publication_date>2024-06-16T04:19:58.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/minimum-cost-for-cutting-cake-i-leetcode-3218</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/aim6BEc9aMk/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Cost for Cutting Cake I &amp; II | Thought Process | Leetcode 3218 | 3219 | codestorywithMIK</video:title><video:description>Minimum Cost for Cutting Cake I &amp; II | Thought Process | Leetcode 3218 | 3219 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/aim6BEc9aMk</video:player_loc><video:duration>2366</video:duration><video:publication_date>2024-07-14T06:19:34.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/maximum-distance-in-arrays-leetcode-624</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/OO6i7g3it4Q/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Distance in Arrays | Leetcode 624 | codestorywithMIK</video:title><video:description>Maximum Distance in Arrays | Leetcode 624 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/OO6i7g3it4Q</video:player_loc><video:duration>736</video:duration><video:publication_date>2024-08-16T10:07:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/maximum-number-of-integers-to-choose-from-a-range-i-leetcode-2554</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/urduKO4oFlo/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Number of Integers to Choose From a Range I | Simple | Leetcode 2554 | codestorywithMIK</video:title><video:description>Maximum Number of Integers to Choose From a Range I | Simple | Leetcode 2554 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/urduKO4oFlo</video:player_loc><video:duration>706</video:duration><video:publication_date>2024-12-06T03:41:41.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/maximum-average-pass-ratio-leetcode-1792</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8SzJbx1Xme0/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Average Pass Ratio | Detailed | Covered Minute Details | Leetcode 1792 | codestorywithMIK</video:title><video:description>Maximum Average Pass Ratio | Detailed | Covered Minute Details | Leetcode 1792 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8SzJbx1Xme0</video:player_loc><video:duration>2584</video:duration><video:publication_date>2024-12-15T05:47:53.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/minimum-domino-rotations-for-equal-row-leetcode-1007</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/R4qAV4rjTc4/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Domino Rotations For Equal Row | Important Lesson | Dry Run |Leetcode 1007 |codestorywithMIK</video:title><video:description>Minimum Domino Rotations For Equal Row | Important Lesson | Dry Run |Leetcode 1007 |codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/R4qAV4rjTc4</video:player_loc><video:duration>1507</video:duration><video:publication_date>2025-05-03T04:09:48.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/minimum-equal-sum-of-two-arrays-after-replacing-zeros-leetcode-2918</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/EzLcXnXZrbc/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Equal Sum of Two Arrays After Replacing Zeros | Made Easy | Leetcode 2918 | codestorywithMIK</video:title><video:description>Minimum Equal Sum of Two Arrays After Replacing Zeros | Made Easy | Leetcode 2918 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/EzLcXnXZrbc</video:player_loc><video:duration>1172</video:duration><video:publication_date>2025-05-10T01:40:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/max-difference-you-can-get-from-changing-an-integer-leetcode-1432</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/bT-xxyXvB3c/hqdefault.jpg</video:thumbnail_loc><video:title>Max Difference You Can Get From Changing an Integer | Made Easy | Leetcode 1432 | codestorywithMIK</video:title><video:description>Max Difference You Can Get From Changing an Integer | Made Easy | Leetcode 1432 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/bT-xxyXvB3c</video:player_loc><video:duration>1213</video:duration><video:publication_date>2025-06-15T01:00:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/maximum-manhattan-distance-after-k-changes-leetcode-3443</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/LjgDv-WeXfM/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Manhattan Distance After K Changes | Detailed Explanation | Leetcode 3443 | codestorywithMIK</video:title><video:description>Maximum Manhattan Distance After K Changes | Detailed Explanation | Leetcode 3443 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/LjgDv-WeXfM</video:player_loc><video:duration>2308</video:duration><video:publication_date>2025-06-20T07:22:58.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/maximum-manhattan-distance-after-k-changes-leetcode-2311</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ca04hcfuGlY/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Binary Subsequence Less Than or Equal to K | 2 Ways | Leetcode 2311 | codestorywithMIK</video:title><video:description>Longest Binary Subsequence Less Than or Equal to K | 2 Ways | Leetcode 2311 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ca04hcfuGlY</video:player_loc><video:duration>1374</video:duration><video:publication_date>2025-06-26T06:31:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/reschedule-meetings-for-maximum-free-time-ii-leetcode-3440</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/nRQwEyJBW-I/hqdefault.jpg</video:thumbnail_loc><video:title>Reschedule Meetings for Maximum Free Time II | Detailed Intuition | Leetcode 3440 | codestorywithMIK</video:title><video:description>Reschedule Meetings for Maximum Free Time II | Detailed Intuition | Leetcode 3440 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/nRQwEyJBW-I</video:player_loc><video:duration>2637</video:duration><video:publication_date>2025-07-10T07:05:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/maximize-subarrays-after-removing-one-conflicting-pair-leetcode-3480</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/gX3dCYnHpug/hqdefault.jpg</video:thumbnail_loc><video:title>Maximize Subarrays After Removing One Conflicting Pair | Detailed Explanation | Leetcode 3480 | MIK</video:title><video:description>Maximize Subarrays After Removing One Conflicting Pair | Detailed Explanation | Leetcode 3480 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/gX3dCYnHpug</video:player_loc><video:duration>3307</video:duration><video:publication_date>2025-07-26T07:49:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/rearranging-fruits-leetcode-2561</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/xveEovkFjBU/hqdefault.jpg</video:thumbnail_loc><video:title>Rearranging Fruits | Detailed Explanation | Minute Details | Leetcode 2561 | codestorywithMIK</video:title><video:description>Rearranging Fruits | Detailed Explanation | Minute Details | Leetcode 2561 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/xveEovkFjBU</video:player_loc><video:duration>2470</video:duration><video:publication_date>2025-08-02T09:20:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/minimum-number-of-people-to-teach-leetcode-1733</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/mToBak5z4BA/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Number of People to Teach | Logical Reasoning | Leetcode 1733 | codestorywithMIK</video:title><video:description>Minimum Number of People to Teach | Logical Reasoning | Leetcode 1733 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/mToBak5z4BA</video:player_loc><video:duration>1647</video:duration><video:publication_date>2025-09-10T04:15:49.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/maximum-number-of-distinct-elements-after-operations-leetcode-3397</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Vg3NjGAgOzU/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Number of Distinct Elements After Operations | Brute Force | Optimal | Leetcode 3397 | MIK</video:title><video:description>Maximum Number of Distinct Elements After Operations | Brute Force | Optimal | Leetcode 3397 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Vg3NjGAgOzU</video:player_loc><video:duration>2037</video:duration><video:publication_date>2025-10-18T07:16:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/minimum-number-of-operations-to-make-all-array-elements-leetcode-2654</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/6VuCJCcpcZI/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Number of Operations to Make All Array Elements Equal to 1 | Easy Intuition | Leetcode 2654</video:title><video:description>Minimum Number of Operations to Make All Array Elements Equal to 1 | Easy Intuition | Leetcode 2654. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/6VuCJCcpcZI</video:player_loc><video:duration>1420</video:duration><video:publication_date>2025-11-12T07:14:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/maximum-number-of-operations-to-move-ones-to-the-end-leetcode-3228</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Hr45fl6esng/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Number of Operations to Move Ones to the End | Interview Style | Leetcode 3228 | MIK</video:title><video:description>Maximum Number of Operations to Move Ones to the End | Interview Style | Leetcode 3228 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Hr45fl6esng</video:player_loc><video:duration>1062</video:duration><video:publication_date>2025-11-13T05:56:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/set-intersection-size-at-least-two-leetcode-757</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/vkFaZIgO10Y/hqdefault.jpg</video:thumbnail_loc><video:title>Set Intersection Size At Least Two | Detailed Deep Dive | Leetcode 757 | codestorywithMIK</video:title><video:description>Set Intersection Size At Least Two | Detailed Deep Dive | Leetcode 757 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/vkFaZIgO10Y</video:player_loc><video:duration>2561</video:duration><video:publication_date>2025-11-20T15:04:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/greatest-sum-divisible-by-three-leetcode-1262</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/bKbLIDzLiGQ/hqdefault.jpg</video:thumbnail_loc><video:title>Greatest Sum Divisible by Three | Multiple Approaches | Detailed | Leetcode 1262 | codestorywithMIK</video:title><video:description>Greatest Sum Divisible by Three | Multiple Approaches | Detailed | Leetcode 1262 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/bKbLIDzLiGQ</video:player_loc><video:duration>3195</video:duration><video:publication_date>2025-11-23T07:17:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/minimum-moves-to-balance-circular-array-leetcode-3776</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/UVLzXybNNYg/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Moves to Balance Circular Array | Clean Intuition | Contest Problem 3 | Leetcode 3776 | MIK</video:title><video:description>Minimum Moves to Balance Circular Array | Clean Intuition | Contest Problem 3 | Leetcode 3776 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/UVLzXybNNYg</video:player_loc><video:duration>1981</video:duration><video:publication_date>2025-12-14T07:59:39.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/partitioning-into-minimum-number-of-deci-binary-numbers-leetcode-1689</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/cfXAsmrAJXg/hqdefault.jpg</video:thumbnail_loc><video:title>Partitioning Into Minimum Number Of Deci-Binary Numbers | Brute Force | Trick | Leetcode 1689 | MIK</video:title><video:description>Partitioning Into Minimum Number Of Deci-Binary Numbers | Brute Force | Trick | Leetcode 1689 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/cfXAsmrAJXg</video:player_loc><video:duration>908</video:duration><video:publication_date>2026-03-01T05:47:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/lexicographically-smallest-generated-string-leetcode-3474</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/A2w3qAkYyQo/hqdefault.jpg</video:thumbnail_loc><video:title>Lexicographically Smallest Generated String | Simplified Approach | Dry Run | Leetcode 3474</video:title><video:description>Lexicographically Smallest Generated String | Simplified Approach | Dry Run | Leetcode 3474. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/A2w3qAkYyQo</video:player_loc><video:duration>1877</video:duration><video:publication_date>2026-03-31T00:50:51.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/destroying-asteroids-leetcode-2126</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/BRulRQnf6XY/hqdefault.jpg</video:thumbnail_loc><video:title>Destroying Asteroids | Simple Approach | Dry Run | Leetcode 2126 | codestorywithMIK</video:title><video:description>Destroying Asteroids | Simple Approach | Dry Run | Leetcode 2126 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/BRulRQnf6XY</video:player_loc><video:duration>710</video:duration><video:publication_date>2026-05-31T00:31:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/maximum-total-subarray-value-i-leetcode-3689</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/V9162iPEJFc/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Total Subarray Value I | Simple Observation | Leetcode 3689 | codestorywithMIK</video:title><video:description>Maximum Total Subarray Value I | Simple Observation | Leetcode 3689 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/V9162iPEJFc</video:player_loc><video:duration>557</video:duration><video:publication_date>2026-06-09T08:19:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/maximum-building-height-leetcode-1840</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ccWRO34TVZI/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Building Height | Detailed For Beginners | Dry Runs | Leetcode 1840 | codestorywithMIK</video:title><video:description>Maximum Building Height | Detailed For Beginners | Dry Runs | Leetcode 1840 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ccWRO34TVZI</video:player_loc><video:duration>3713</video:duration><video:publication_date>2026-06-20T18:46:39.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/smallest-palindromic-rearrangement-i-leetcode-3517</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/AKX6wMVZ13U/hqdefault.jpg</video:thumbnail_loc><video:title>Smallest Palindromic Rearrangement I | Simple Explanation | Dry Run | Leetcode 3517 | MIK</video:title><video:description>Smallest Palindromic Rearrangement I | Simple Explanation | Dry Run | Leetcode 3517 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/AKX6wMVZ13U</video:player_loc><video:duration>638</video:duration><video:publication_date>2026-07-28T00:52:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/smallest-divisible-digit-product-ii-leetcode-3348</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ezWwUASKA4s/hqdefault.jpg</video:thumbnail_loc><video:title>Smallest Divisible Digit Product I &amp; II | Detailed for Beginners | Leetcode 3348 &amp; 3345 | MIK</video:title><video:description>Smallest Divisible Digit Product I &amp; II | Detailed for Beginners | Leetcode 3348 &amp; 3345 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ezWwUASKA4s</video:player_loc><video:duration>5850</video:duration><video:publication_date>2026-08-07T02:28:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/find-the-lexicographically-smallest-valid-sequence-leetcode-3302</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Upvd6Kbahqw/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Lexicographically Smallest Valid Sequence | Clear Intuition | Leetcode 3302 | MIK</video:title><video:description>Find the Lexicographically Smallest Valid Sequence | Clear Intuition | Leetcode 3302 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Upvd6Kbahqw</video:player_loc><video:duration>2253</video:duration><video:publication_date>2026-08-08T12:18:23.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/stone-game-ix-leetcode-2029</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/whOzeueExXk/hqdefault.jpg</video:thumbnail_loc><video:title>Stone Game IX | Detailed Deep Dive | Leetcode 2029 | codestorywithMIK</video:title><video:description>Stone Game IX | Detailed Deep Dive | Leetcode 2029 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/whOzeueExXk</video:player_loc><video:duration>3204</video:duration><video:publication_date>2026-08-16T19:19:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/cinema-seat-allocation-leetcode-1386</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/N4K3OLcr6HQ/hqdefault.jpg</video:thumbnail_loc><video:title>Cinema Seat Allocation | Multiple Approaches | Dry Runs | Leetcode 1386 | codestorywithMIK</video:title><video:description>Cinema Seat Allocation | Multiple Approaches | Dry Runs | Leetcode 1386 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/N4K3OLcr6HQ</video:player_loc><video:duration>2432</video:duration><video:publication_date>2026-08-19T02:55:48.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/sum-game-leetcode-1927</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/2qQbYQtY2Tk/hqdefault.jpg</video:thumbnail_loc><video:title>Sum Game | Detailed Intuition | Leetcode 1927 | codestorywithMIK</video:title><video:description>Sum Game | Detailed Intuition | Leetcode 1927 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/2qQbYQtY2Tk</video:player_loc><video:duration>2173</video:duration><video:publication_date>2026-08-23T07:37:57.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/lexicographically-smallest-permutation-greater-than-target-leetcode-3720</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Twj2DyUrDH4/hqdefault.jpg</video:thumbnail_loc><video:title>Lexicographically Smallest Permutation Greater Than Target | Simplified and Detailed | Leetcode 3720</video:title><video:description>Lexicographically Smallest Permutation Greater Than Target | Simplified and Detailed | Leetcode 3720. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Twj2DyUrDH4</video:player_loc><video:duration>2473</video:duration><video:publication_date>2026-08-27T05:08:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/lexicographically-smallest-palindromic-permutation-greater-leetcode-3734</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/iRjcsb6Ccms/hqdefault.jpg</video:thumbnail_loc><video:title>Lexicographically Smallest Palindromic Permutation Greater Than Target | Made Easy | Leetcode 3734</video:title><video:description>Lexicographically Smallest Palindromic Permutation Greater Than Target | Made Easy | Leetcode 3734. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/iRjcsb6Ccms</video:player_loc><video:duration>1836</video:duration><video:publication_date>2026-08-28T09:52:47.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/maximum-number-of-non-overlapping-substrings-leetcode-1520</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/SlSPlKmuKwY/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Number of Non-Overlapping Substrings | Beginner Friendly | Detailed | Leetcode 1520 | MIK</video:title><video:description>Maximum Number of Non-Overlapping Substrings | Beginner Friendly | Detailed | Leetcode 1520 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/SlSPlKmuKwY</video:player_loc><video:duration>2616</video:duration><video:publication_date>2026-09-18T05:31:39.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/maximum-nesting-depth-of-two-valid-parentheses-strings-leetcode-1111</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9TiOxPz4jOk/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Nesting Depth of Two Valid Parentheses Strings | Simplest Intuition | Leetcode 1111 | MIK</video:title><video:description>Maximum Nesting Depth of Two Valid Parentheses Strings | Simplest Intuition | Leetcode 1111 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9TiOxPz4jOk</video:player_loc><video:duration>1407</video:duration><video:publication_date>2026-09-30T10:20:43.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/minimum-insertions-to-balance-a-parentheses-string-leetcode-1541</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/4Tquknq6hvg/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Insertions to Balance a Parentheses String | Simple Intuition | Leetcode 1541 | MIK</video:title><video:description>Minimum Insertions to Balance a Parentheses String | Simple Intuition | Leetcode 1541 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/4Tquknq6hvg</video:player_loc><video:duration>969</video:duration><video:publication_date>2026-10-09T04:38:51.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/minimum-sum-of-squared-difference-leetcode-2333</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ZgHoWwiBAX4/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Sum of Squared Difference | Brute Force | Optimal | Intuition | Leetcode 2333 | MIK</video:title><video:description>Minimum Sum of Squared Difference | Brute Force | Optimal | Intuition | Leetcode 2333 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ZgHoWwiBAX4</video:player_loc><video:duration>2091</video:duration><video:publication_date>2026-10-10T07:31:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/maximize-sum-of-squares-of-digits-leetcode-3723</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/6i_TS0BzTgA/hqdefault.jpg</video:thumbnail_loc><video:title>Maximize Sum of Squares of Digits | Simplest Intuition | Leetcode 3723 | codestorywithMIK</video:title><video:description>Maximize Sum of Squares of Digits | Simplest Intuition | Leetcode 3723 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/6i_TS0BzTgA</video:player_loc><video:duration>794</video:duration><video:publication_date>2026-10-14T04:49:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/maximum-odd-binary-number-leetcode-2864</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/IRO_4X0csoc/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Odd Binary Number | 2 Approaches | Leetcode 2864</video:title><video:description>Maximum Odd Binary Number | 2 Approaches | Leetcode 2864. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/IRO_4X0csoc</video:player_loc><video:duration>857</video:duration><video:publication_date>2024-03-01T02:07:23.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/maximum-value-of-an-ordered-triplet-i-leetcode-2873</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/UQZEiyIl4ZA/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Value of an Ordered Triplet I | Multiple Approaches | Leetcode 2873 | codestorywithMIK</video:title><video:description>Maximum Value of an Ordered Triplet I | Multiple Approaches | Leetcode 2873 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/UQZEiyIl4ZA</video:player_loc><video:duration>1159</video:duration><video:publication_date>2025-04-02T07:11:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/maximum-difference-by-remapping-a-digit-leetcode-2566</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/i8UYdogHsCA/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Difference by Remapping a Digit | Easy | 2 Ways | Leetcode 2566 | codestorywithMIK</video:title><video:description>Maximum Difference by Remapping a Digit | Easy | 2 Ways | Leetcode 2566 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/i8UYdogHsCA</video:player_loc><video:duration>1605</video:duration><video:publication_date>2025-06-14T04:43:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/greedy/maximum-alternating-sum-of-squares-leetcode-3727</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/MpUMQBvAa8k/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Alternating Sum of Squares | Multiple Approaches | Nth Element Trick | Leetcode 3727 | MIK</video:title><video:description>Maximum Alternating Sum of Squares | Multiple Approaches | Nth Element Trick | Leetcode 3727 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/MpUMQBvAa8k</video:player_loc><video:duration>1108</video:duration><video:publication_date>2026-10-13T04:32:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/minimum-flips-to-make-a-or-b-equal-to-c-leetcode-1318</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Gx4-uOkopMA/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Flips to Make a OR b Equal to c | 2 Approaches | Microsoft | Leetcode-1318 | Explanation</video:title><video:description>Minimum Flips to Make a OR b Equal to c | 2 Approaches | Microsoft | Leetcode-1318 | Explanation. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Gx4-uOkopMA</video:player_loc><video:duration>2212</video:duration><video:publication_date>2023-06-07T08:28:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/single-number-ii-leetcode-137</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/LK0c7tCzKmM/hqdefault.jpg</video:thumbnail_loc><video:title>Single Number II | Multiple Approaches | GOOGLE, AMAZON | META | Leetcode-137 | Explanation</video:title><video:description>Single Number II | Multiple Approaches | GOOGLE, AMAZON | META | Leetcode-137 | Explanation. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/LK0c7tCzKmM</video:player_loc><video:duration>1660</video:duration><video:publication_date>2023-07-04T12:55:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/counting-bits-leetcode-338</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/uwOz378g3ew/hqdefault.jpg</video:thumbnail_loc><video:title>Counting Bits | Follow Up Qn | 2 Approaches | AMAZON | Leetcode - 338</video:title><video:description>Counting Bits | Follow Up Qn | 2 Approaches | AMAZON | Leetcode - 338. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/uwOz378g3ew</video:player_loc><video:duration>625</video:duration><video:publication_date>2023-09-01T02:08:23.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/sort-integers-by-the-number-of-1-bits-leetcode-1356</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/2owpaafBIgw/hqdefault.jpg</video:thumbnail_loc><video:title>Sort Integers by The Number of 1 Bits | 2 Approaches | AMAZON | Leetcode 1356 | codestorywithMIK</video:title><video:description>Sort Integers by The Number of 1 Bits | 2 Approaches | AMAZON | Leetcode 1356 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/2owpaafBIgw</video:player_loc><video:duration>1306</video:duration><video:publication_date>2023-10-30T03:21:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/find-the-original-array-of-prefix-xor-leetcode-2433</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/TDjmp768H3Q/hqdefault.jpg</video:thumbnail_loc><video:title>Find The Original Array of Prefix Xor | XOR Properties | Microsoft | Leetcode - 2433</video:title><video:description>Find The Original Array of Prefix Xor | XOR Properties | Microsoft | Leetcode - 2433. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/TDjmp768H3Q</video:player_loc><video:duration>812</video:duration><video:publication_date>2023-10-31T03:34:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/maximum-xor-product-leetcode-2939</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/rCnELsv6L2I/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Xor Product | Super Detailed | Leetcode Weekly Contest 372 | Leetcode-2939</video:title><video:description>Maximum Xor Product | Super Detailed | Leetcode Weekly Contest 372 | Leetcode-2939. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/rCnELsv6L2I</video:player_loc><video:duration>3522</video:duration><video:publication_date>2023-11-23T09:49:34.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/number-of-1-bits-leetcode-191</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YOyajw-L0pc/hqdefault.jpg</video:thumbnail_loc><video:title>Number of 1 Bits | 4 Approaches | Time Complexity | Apple | Microsoft | Amazon | Leetcode 191</video:title><video:description>Number of 1 Bits | 4 Approaches | Time Complexity | Apple | Microsoft | Amazon | Leetcode 191. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YOyajw-L0pc</video:player_loc><video:duration>1127</video:duration><video:publication_date>2023-11-29T02:55:57.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/minimum-one-bit-operations-to-make-integers-zero-leetcode-1611</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/yU6DZSLW4_c/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum One Bit Operations to Make Integers Zero | Detailed Explanation | Leetcode 1611 | MIK</video:title><video:description>Minimum One Bit Operations to Make Integers Zero | Detailed Explanation | Leetcode 1611 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/yU6DZSLW4_c</video:player_loc><video:duration>1692</video:duration><video:publication_date>2023-11-30T10:42:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/maximum-number-that-sum-of-the-prices-is-less-than-or-equal-leetcode-3007</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/D5yhQ-bqw9E/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Number That Sum of the Prices Is Less Than or Equal to K  |Brute Force |Optimal |Contest 380</video:title><video:description>Maximum Number That Sum of the Prices Is Less Than or Equal to K  |Brute Force |Optimal |Contest 380. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/D5yhQ-bqw9E</video:player_loc><video:duration>3984</video:duration><video:publication_date>2024-01-15T08:22:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/maximum-length-of-a-concatenated-string-with-unique-leetcode-1239</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/eVIQUNvFR4E/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Length of a Concatenated String with Unique Characters | Using Bit Magic | Leetcode 1239</video:title><video:description>Maximum Length of a Concatenated String with Unique Characters | Using Bit Magic | Leetcode 1239. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/eVIQUNvFR4E</video:player_loc><video:duration>2405</video:duration><video:publication_date>2024-01-23T12:50:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/bitwise-and-of-numbers-range-leetcode-201</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/3XYQLHSoew8/hqdefault.jpg</video:thumbnail_loc><video:title>Bitwise AND of Numbers Range | 2 Approaches | Dry Run | Leetcode 201</video:title><video:description>Bitwise AND of Numbers Range | 2 Approaches | Dry Run | Leetcode 201. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/3XYQLHSoew8</video:player_loc><video:duration>2083</video:duration><video:publication_date>2024-02-21T08:20:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/minimum-number-of-operations-to-make-array-xor-equal-to-k-leetcode-2997</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/rCDKurGjTGg/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Number of Operations to Make Array XOR Equal to K | Easy | Leetcode 2997 | codestorywithMIK</video:title><video:description>Minimum Number of Operations to Make Array XOR Equal to K | Easy | Leetcode 2997 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/rCDKurGjTGg</video:player_loc><video:duration>669</video:duration><video:publication_date>2024-04-29T09:41:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/number-of-wonderful-substrings-leetcode-1915</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/1DdmbJj4xLE/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Wonderful Substrings  | Clear Intuition | Full Dry Run | Leetcode 1915 | codestorywithMIK</video:title><video:description>Number of Wonderful Substrings  | Clear Intuition | Full Dry Run | Leetcode 1915 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/1DdmbJj4xLE</video:player_loc><video:duration>2300</video:duration><video:publication_date>2024-04-30T04:53:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/score-after-flipping-matrix-leetcode-861</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/nNRqRWvV23k/hqdefault.jpg</video:thumbnail_loc><video:title>Score After Flipping Matrix | Modifying | Without Modifying Input | Leetcode 861 | codestorywithMIK</video:title><video:description>Score After Flipping Matrix | Modifying | Without Modifying Input | Leetcode 861 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/nNRqRWvV23k</video:player_loc><video:duration>2126</video:duration><video:publication_date>2024-05-13T06:18:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/number-of-steps-to-reduce-a-number-in-binary-representation-leetcode-1404</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/sGweAOKMyeI/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Steps to Reduce a Number in Binary Representation to One | 2 Approaches | Leetcode 1404</video:title><video:description>Number of Steps to Reduce a Number in Binary Representation to One | 2 Approaches | Leetcode 1404. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/sGweAOKMyeI</video:player_loc><video:duration>1918</video:duration><video:publication_date>2024-05-29T03:33:43.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/count-triplets-that-can-form-two-arrays-of-equal-xor-leetcode-1442</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/TgkxnZ6oPYU/hqdefault.jpg</video:thumbnail_loc><video:title>Count Triplets That Can Form Two Arrays of Equal XOR | Leetcode 1442 | codestorywithMIK</video:title><video:description>Count Triplets That Can Form Two Arrays of Equal XOR | Leetcode 1442 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/TgkxnZ6oPYU</video:player_loc><video:duration>1445</video:duration><video:publication_date>2024-05-30T02:24:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/single-number-iii-leetcode-260</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/h1EVBhCMugI/hqdefault.jpg</video:thumbnail_loc><video:title>Single Number III | Detailed Explanation | Leetcode 260 | codestorywithMIK</video:title><video:description>Single Number III | Detailed Explanation | Leetcode 260 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/h1EVBhCMugI</video:player_loc><video:duration>1554</video:duration><video:publication_date>2024-05-31T04:16:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/xor-queries-of-a-subarray-leetcode-1310</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/rZYdNpHXz0o/hqdefault.jpg</video:thumbnail_loc><video:title>XOR Queries of a Subarray | Simple Explanation | Leetcode 1310 | codestorywithMIK</video:title><video:description>XOR Queries of a Subarray | Simple Explanation | Leetcode 1310 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/rZYdNpHXz0o</video:player_loc><video:duration>705</video:duration><video:publication_date>2024-09-13T03:45:52.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/find-the-longest-substring-containing-vowels-in-even-counts-leetcode-1371</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/6Xf5LfM-ciI/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Longest Substring Containing Vowels in Even Counts | Leetcode 1371 | codestorywithMIK</video:title><video:description>Find the Longest Substring Containing Vowels in Even Counts | Leetcode 1371 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/6Xf5LfM-ciI</video:player_loc><video:duration>1785</video:duration><video:publication_date>2024-09-15T07:00:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/largest-combination-with-bitwise-and-greater-than-zero-leetcode-2275</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9ZlMnn_N0QE/hqdefault.jpg</video:thumbnail_loc><video:title>Largest Combination With Bitwise AND Greater Than Zero | Detailed | Leetcode 2275 | codestorywithMIK</video:title><video:description>Largest Combination With Bitwise AND Greater Than Zero | Detailed | Leetcode 2275 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9ZlMnn_N0QE</video:player_loc><video:duration>1780</video:duration><video:publication_date>2024-11-07T03:52:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/maximum-xor-for-each-query-leetcode-1829</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/qDtW0HRvNc0/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum XOR for Each Query | Simple Explanation | Leetcode 1829 | codestorywithMIK</video:title><video:description>Maximum XOR for Each Query | Simple Explanation | Leetcode 1829 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/qDtW0HRvNc0</video:player_loc><video:duration>1654</video:duration><video:publication_date>2024-11-08T04:30:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/minimum-array-end-leetcode-3133</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/rChLZzzggjo/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Array End | How much you know about AND | Detailed | Leetcode 3133 | codestorywithMIK</video:title><video:description>Minimum Array End | How much you know about AND | Detailed | Leetcode 3133 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/rChLZzzggjo</video:player_loc><video:duration>1868</video:duration><video:publication_date>2024-11-09T04:21:48.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/shortest-subarray-with-or-at-least-k-ii-leetcode-3097</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/pXr8CF7-5_Y/hqdefault.jpg</video:thumbnail_loc><video:title>Shortest Subarray With OR at Least K II | Made Easy | Detailed | Leetcode 3097 | codestorywithMIK</video:title><video:description>Shortest Subarray With OR at Least K II | Made Easy | Detailed | Leetcode 3097 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/pXr8CF7-5_Y</video:player_loc><video:duration>2056</video:duration><video:publication_date>2024-11-10T11:19:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/minimize-xor-leetcode-2429</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9wrKWB1xDoY/hqdefault.jpg</video:thumbnail_loc><video:title>Minimize XOR | 2 Detailed Approaches | Dry Runs | Leetcode 2429 | codestorywithMIK</video:title><video:description>Minimize XOR | 2 Detailed Approaches | Dry Runs | Leetcode 2429 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9wrKWB1xDoY</video:player_loc><video:duration>3137</video:duration><video:publication_date>2025-01-15T04:58:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/neighboring-bitwise-xor-leetcode-2683</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/T1uAPDDFDmM/hqdefault.jpg</video:thumbnail_loc><video:title>Neighboring Bitwise XOR | 2 Detailed Approaches | Dry Runs | Leetcode 2683 | codestorywithMIK</video:title><video:description>Neighboring Bitwise XOR | 2 Detailed Approaches | Dry Runs | Leetcode 2683 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/T1uAPDDFDmM</video:player_loc><video:duration>2821</video:duration><video:publication_date>2025-01-16T02:06:48.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/bitwise-xor-of-all-pairings-leetcode-2425</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/19-Q_Krxj1w/hqdefault.jpg</video:thumbnail_loc><video:title>Bitwise XOR of All Pairings | 2 Simple Approaches | Dry Runs | Leetcode 2425 | codestorywithMIK</video:title><video:description>Bitwise XOR of All Pairings | 2 Simple Approaches | Dry Runs | Leetcode 2425 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/19-Q_Krxj1w</video:player_loc><video:duration>1449</video:duration><video:publication_date>2025-01-16T02:38:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/smallest-subarrays-with-maximum-bitwise-or-leetcode-2411</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/7ZOmJlTI2Z0/hqdefault.jpg</video:thumbnail_loc><video:title>Smallest Subarrays With Maximum Bitwise OR | Detailed Explanation | Leetcode 2411 | codestorywithMIK</video:title><video:description>Smallest Subarrays With Maximum Bitwise OR | Detailed Explanation | Leetcode 2411 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/7ZOmJlTI2Z0</video:player_loc><video:duration>2628</video:duration><video:publication_date>2025-07-29T06:18:13.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/construct-the-minimum-bitwise-array-i-leetcode-3314</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/RnCZCzFivl8/hqdefault.jpg</video:thumbnail_loc><video:title>Construct the Minimum Bitwise Array I &amp; II | Brute Force | Optimal | Leetcode 3314 &amp; 3315 | MIK</video:title><video:description>Construct the Minimum Bitwise Array I &amp; II | Brute Force | Optimal | Leetcode 3314 &amp; 3315 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/RnCZCzFivl8</video:player_loc><video:duration>2150</video:duration><video:publication_date>2026-01-20T00:46:47.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/check-if-a-string-contains-all-binary-codes-of-size-k-leetcode-1461</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/-ShPKo-FXbw/hqdefault.jpg</video:thumbnail_loc><video:title>Check If a String Contains All Binary Codes of Size K | Simple Approach | Leetcode 1461 | MIK</video:title><video:description>Check If a String Contains All Binary Codes of Size K | Simple Approach | Leetcode 1461 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/-ShPKo-FXbw</video:player_loc><video:duration>768</video:duration><video:publication_date>2026-02-23T01:20:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/concatenation-of-consecutive-binary-numbers-leetcode-1680</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/JwiTzOEzy44/hqdefault.jpg</video:thumbnail_loc><video:title>Concatenation of Consecutive Binary Numbers | Two Approaches | Dry Run | Leetcode 1680 | MIK</video:title><video:description>Concatenation of Consecutive Binary Numbers | Two Approaches | Dry Run | Leetcode 1680 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/JwiTzOEzy44</video:player_loc><video:duration>796</video:duration><video:publication_date>2026-02-28T01:32:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/number-of-unique-xor-triplets-i-leetcode-3513</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/FbD3Tfwhi0Q/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Unique XOR Triplets I | Leetcode 3513 | Detailed Observation | codestorywithMIK</video:title><video:description>Number of Unique XOR Triplets I | Leetcode 3513 | Detailed Observation | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/FbD3Tfwhi0Q</video:player_loc><video:duration>1368</video:duration><video:publication_date>2026-07-23T08:35:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/number-of-unique-xor-triplets-ii-leetcode-3514</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ZW8dmdP3w3s/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Unique XOR Triplets II | Leetcode 3514 | Simplified Explanation | codestorywithMIK</video:title><video:description>Number of Unique XOR Triplets II | Leetcode 3514 | Simplified Explanation | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ZW8dmdP3w3s</video:player_loc><video:duration>1630</video:duration><video:publication_date>2026-07-24T03:49:34.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/longest-subsequence-with-non-zero-bitwise-xor-leetcode-3702</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/t0kb8GtOsWs/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Subsequence With Non-Zero Bitwise XOR | Leetcode 3702 | Simple Observation | MIK</video:title><video:description>Longest Subsequence With Non-Zero Bitwise XOR | Leetcode 3702 | Simple Observation | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/t0kb8GtOsWs</video:player_loc><video:duration>965</video:duration><video:publication_date>2026-08-15T02:49:18.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/apply-operations-on-array-to-maximize-sum-of-squares-leetcode-2897</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/b5J2CmPEeeQ/hqdefault.jpg</video:thumbnail_loc><video:title>Apply Operations on Array to Maximize Sum of Squares | Detailed Intuition | Proof | Leetcode 2897</video:title><video:description>Apply Operations on Array to Maximize Sum of Squares | Detailed Intuition | Proof | Leetcode 2897. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/b5J2CmPEeeQ</video:player_loc><video:duration>2187</video:duration><video:publication_date>2026-10-12T05:24:25.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/maximum-k-to-sort-a-permutation-leetcode-3644</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/t9qkP1cDzC4/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum K to Sort a Permutation | Brute Force | Optimal | Clear Intuition | Leetcode 3644 | MIK</video:title><video:description>Maximum K to Sort a Permutation | Brute Force | Optimal | Clear Intuition | Leetcode 3644 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/t9qkP1cDzC4</video:player_loc><video:duration>1198</video:duration><video:publication_date>2026-10-23T07:14:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/power-of-two-leetcode-231</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/bVfA6_rDw4M/hqdefault.jpg</video:thumbnail_loc><video:title>Power of Two | Multiple Approaches | Leetcode 231 | codestorywithMIK</video:title><video:description>Power of Two | Multiple Approaches | Leetcode 231 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/bVfA6_rDw4M</video:player_loc><video:duration>1036</video:duration><video:publication_date>2024-02-19T02:10:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/sum-of-all-subset-xor-totals-leetcode-1863</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/3tzP38WPAoA/hqdefault.jpg</video:thumbnail_loc><video:title>Sum of All Subset XOR Totals | Simple Story To Code | Leetcode 1863 | codestorywithMIK</video:title><video:description>Sum of All Subset XOR Totals | Simple Story To Code | Leetcode 1863 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/3tzP38WPAoA</video:player_loc><video:duration>1500</video:duration><video:publication_date>2024-05-20T03:30:56.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/number-complement-leetcode-476</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QaVwcw2f-pM/hqdefault.jpg</video:thumbnail_loc><video:title>Number Complement | Multiple Approaches | Leetcode 476 | codestorywithMIK</video:title><video:description>Number Complement | Multiple Approaches | Leetcode 476 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QaVwcw2f-pM</video:player_loc><video:duration>1336</video:duration><video:publication_date>2024-08-22T06:04:41.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/smallest-number-with-all-set-bits-leetcode-3370</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/o_H5hRs-REo/hqdefault.jpg</video:thumbnail_loc><video:title>Smallest Number With All Set Bits | 3 Approaches | Something to learn | Leetcode 3370 | MIK</video:title><video:description>Smallest Number With All Set Bits | 3 Approaches | Something to learn | Leetcode 3370 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/o_H5hRs-REo</video:player_loc><video:duration>1167</video:duration><video:publication_date>2025-10-29T04:27:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/the-two-sneaky-numbers-of-digitville-leetcode-3289</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5Vjt_w5Zi-A/hqdefault.jpg</video:thumbnail_loc><video:title>The Two Sneaky Numbers of Digitville | Learn Important Bit Concept | Dry Runs | Leetcode 3289 | MIK</video:title><video:description>The Two Sneaky Numbers of Digitville | Learn Important Bit Concept | Dry Runs | Leetcode 3289 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5Vjt_w5Zi-A</video:player_loc><video:duration>1654</video:duration><video:publication_date>2025-10-31T06:29:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/binary-prefix-divisible-by-5-leetcode-1018</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/dRwEixchYqc/hqdefault.jpg</video:thumbnail_loc><video:title>Binary Prefix Divisible By 5 | Important Things To Learn | Leetcode 1018 | codestorywithMIK</video:title><video:description>Binary Prefix Divisible By 5 | Important Things To Learn | Leetcode 1018 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/dRwEixchYqc</video:player_loc><video:duration>1173</video:duration><video:publication_date>2025-11-24T04:54:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/binary-watch-leetcode-401</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/lVDSn737vfY/hqdefault.jpg</video:thumbnail_loc><video:title>Binary Watch | Simple Clean Approach | Leetcode 401 | codestorywithMIK</video:title><video:description>Binary Watch | Simple Clean Approach | Leetcode 401 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/lVDSn737vfY</video:player_loc><video:duration>1418</video:duration><video:publication_date>2026-02-17T01:59:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/add-binary-leetcode-67</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/gl_6rVkbrHI/hqdefault.jpg</video:thumbnail_loc><video:title>Add Binary | Simple Explanation | Dry Run | Leetcode 67 | codestorywithMIK</video:title><video:description>Add Binary | Simple Explanation | Dry Run | Leetcode 67 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/gl_6rVkbrHI</video:player_loc><video:duration>756</video:duration><video:publication_date>2026-02-15T01:57:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/reverse-bits-leetcode-190</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/wl9OVejxckw/hqdefault.jpg</video:thumbnail_loc><video:title>Reverse Bits | Simple Explanation | Dry Run | Leetcode 190 | codestorywithMIK</video:title><video:description>Reverse Bits | Simple Explanation | Dry Run | Leetcode 190 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/wl9OVejxckw</video:player_loc><video:duration>724</video:duration><video:publication_date>2026-02-16T01:22:43.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/binary-number-with-alternating-bits-leetcode-693</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/E1pLPxpvmeQ/hqdefault.jpg</video:thumbnail_loc><video:title>Binary Number with Alternating Bits | 3 Approaches | Detailed | Leetcode 693 | codestorywithMIK</video:title><video:description>Binary Number with Alternating Bits | 3 Approaches | Detailed | Leetcode 693 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/E1pLPxpvmeQ</video:player_loc><video:duration>1089</video:duration><video:publication_date>2026-02-18T02:09:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/prime-number-of-set-bits-in-binary-representation-leetcode-762</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/OhgrtltB5iM/hqdefault.jpg</video:thumbnail_loc><video:title>Prime Number of Set Bits in Binary Representation | Simple Approach | Leetcode 762 | MIK</video:title><video:description>Prime Number of Set Bits in Binary Representation | Simple Approach | Leetcode 762 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/OhgrtltB5iM</video:player_loc><video:duration>480</video:duration><video:publication_date>2026-02-21T07:42:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/binary-gap-leetcode-868</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/T2eCRsAVLQU/hqdefault.jpg</video:thumbnail_loc><video:title>Binary Gap | Two Simple Approaches | Leetcode 868 | codestorywithMIK</video:title><video:description>Binary Gap | Two Simple Approaches | Leetcode 868 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/T2eCRsAVLQU</video:player_loc><video:duration>942</video:duration><video:publication_date>2026-02-22T02:17:49.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/bit-manipulation/complement-of-base-10-integer-leetcode-1009</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/nh7BeLcKeGw/hqdefault.jpg</video:thumbnail_loc><video:title>Complement of Base 10 Integer | 3 Detailed Approaches | Leetcode 1009 | codestorywithMIK</video:title><video:description>Complement of Base 10 Integer | 3 Detailed Approaches | Leetcode 1009 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/nh7BeLcKeGw</video:player_loc><video:duration>969</video:duration><video:publication_date>2026-03-11T01:12:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/primality-check</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/61LWhWexFI4/hqdefault.jpg</video:thumbnail_loc><video:title>Primality Check | Sieve of Eratosthenes | Super Detailed For Beginners | codestorywithMIK</video:title><video:description>Primality Check | Sieve of Eratosthenes | Super Detailed For Beginners | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/61LWhWexFI4</video:player_loc><video:duration>2959</video:duration><video:publication_date>2024-12-08T14:36:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/binary-exponentiation</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/D320QeHS0XQ/hqdefault.jpg</video:thumbnail_loc><video:title>Binary Exponentiation | Fast Exponentiation | Detailed For Beginners | codestorywithMIK</video:title><video:description>Binary Exponentiation | Fast Exponentiation | Detailed For Beginners | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/D320QeHS0XQ</video:player_loc><video:duration>775</video:duration><video:publication_date>2025-03-29T05:36:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/modular-ncr-using-fermats-little-theorem</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/FMBW7m1Wap0/hqdefault.jpg</video:thumbnail_loc><video:title>Modular nCr using Fermat’s Little Theorem | Beginner Friendly Explanation | Code | codestorywithMIK</video:title><video:description>Modular nCr using Fermat’s Little Theorem | Beginner Friendly Explanation | Code | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/FMBW7m1Wap0</video:player_loc><video:duration>1325</video:duration><video:publication_date>2025-04-22T10:38:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/matrix-exponentiation</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/gX8KaRlkoN0/hqdefault.jpg</video:thumbnail_loc><video:title>Matrix Exponentiation | n Degree Linear Recurrence | Super Detailed | codestorywithMIK</video:title><video:description>Matrix Exponentiation | n Degree Linear Recurrence | Super Detailed | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/gX8KaRlkoN0</video:player_loc><video:duration>2858</video:duration><video:publication_date>2025-05-14T15:05:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/square-root-decomposition-made-easy</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/aI10OoSvhUI/hqdefault.jpg</video:thumbnail_loc><video:title>Square Root Decomposition Made Easy | Range Query Detailed | Full Intuition | codestorywithMIK</video:title><video:description>Square Root Decomposition Made Easy | Range Query Detailed | Full Intuition | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/aI10OoSvhUI</video:player_loc><video:duration>3033</video:duration><video:publication_date>2026-04-09T01:06:39.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/find-median-of-x-sized-subarrays</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/-zRQhT1Cdhs/hqdefault.jpg</video:thumbnail_loc><video:title>Find Median of X Sized Subarrays | Weekly Contest 443 | Hint To Qn 4 | Detailed | codestorywithMIK</video:title><video:description>Find Median of X Sized Subarrays | Weekly Contest 443 | Hint To Qn 4 | Detailed | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/-zRQhT1Cdhs</video:player_loc><video:duration>1636</video:duration><video:publication_date>2025-03-30T11:01:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/ugly-number-leetcode-263</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/aCylFAah1z4/hqdefault.jpg</video:thumbnail_loc><video:title>Ugly Number -(Amazon , Meta) : Explanation ➕ Live Coding</video:title><video:description>Ugly Number -(Amazon , Meta) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/aCylFAah1z4</video:player_loc><video:duration>381</video:duration><video:publication_date>2022-11-18T17:19:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/erect-the-fence-leetcode-587</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/et3dtYzVGQQ/hqdefault.jpg</video:thumbnail_loc><video:title>Erect the Fence -(GOOGLE) : Explanation ➕ Live Coding</video:title><video:description>Erect the Fence -(GOOGLE) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/et3dtYzVGQQ</video:player_loc><video:duration>1732</video:duration><video:publication_date>2022-11-19T12:45:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/max-points-on-a-line-leetcode-149</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/AzER0wuL0QY/hqdefault.jpg</video:thumbnail_loc><video:title>Max Points on a Line -(Google, Apple, LinkedIn, Amazon) : Explanation ➕ Live Coding</video:title><video:description>Max Points on a Line -(Google, Apple, LinkedIn, Amazon) : Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/AzER0wuL0QY</video:player_loc><video:duration>2203</video:duration><video:publication_date>2023-01-08T07:47:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/add-digits-leetcode-258</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/urZ7Jj2UXp0/hqdefault.jpg</video:thumbnail_loc><video:title>Add Digits | With Proof | (MICROSOFT, ADOBE) | Leetcode-258 | Live Code + Explanation</video:title><video:description>Add Digits | With Proof | (MICROSOFT, ADOBE) | Leetcode-258 | Live Code + Explanation. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/urZ7Jj2UXp0</video:player_loc><video:duration>1079</video:duration><video:publication_date>2023-04-26T08:20:17.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/bulb-switcher-leetcode-319</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/q-7aoEILGb0/hqdefault.jpg</video:thumbnail_loc><video:title>Bulb Switcher | With Intuition | AMAZON | Leetcode 319 | codestorywithMIK</video:title><video:description>Bulb Switcher | With Intuition | AMAZON | Leetcode 319 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/q-7aoEILGb0</video:player_loc><video:duration>727</video:duration><video:publication_date>2023-04-27T12:11:47.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/new-21-game-leetcode-837</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/x19SmqQbhWk/hqdefault.jpg</video:thumbnail_loc><video:title>New 21 Game | With Maths Logic | GOOGLE | Leetcode-837 | codestorywithMIK</video:title><video:description>New 21 Game | With Maths Logic | GOOGLE | Leetcode-837 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/x19SmqQbhWk</video:player_loc><video:duration>2273</video:duration><video:publication_date>2023-05-25T18:37:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/check-if-it-is-a-straight-line-leetcode-1232</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ZG2ZYd7U03s/hqdefault.jpg</video:thumbnail_loc><video:title>Check If It Is a Straight Line | AMAZON | Leetcode-1232 | Explanation ➕ Live Coding</video:title><video:description>Check If It Is a Straight Line | AMAZON | Leetcode-1232 | Explanation ➕ Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ZG2ZYd7U03s</video:player_loc><video:duration>623</video:duration><video:publication_date>2023-06-05T02:41:18.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/can-make-arithmetic-progression-from-sequence-leetcode-1502</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/RgeDl_pjWog/hqdefault.jpg</video:thumbnail_loc><video:title>Can Make Arithmetic Progression From Sequence | 2 Approaches | GOOGLE | Leetcode-1502</video:title><video:description>Can Make Arithmetic Progression From Sequence | 2 Approaches | GOOGLE | Leetcode-1502. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/RgeDl_pjWog</video:player_loc><video:duration>971</video:duration><video:publication_date>2023-06-06T03:32:52.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/can-make-arithmetic-progression-from-sequence-leetcode-1502-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/cA68tbKhoIQ/hqdefault.jpg</video:thumbnail_loc><video:title>Can Make Arithmetic Progression From Sequence | O(1) Space | GOOGLE | Leetcode-1502 | Explanation</video:title><video:description>Can Make Arithmetic Progression From Sequence | O(1) Space | GOOGLE | Leetcode-1502 | Explanation. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/cA68tbKhoIQ</video:player_loc><video:duration>1247</video:duration><video:publication_date>2023-06-09T12:09:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/number-of-ways-to-reorder-array-to-get-same-bst-leetcode-1569</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YMe9Q2yZvBo/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Ways to Reorder Array to Get Same BST | Intuition From Scratch | Leetcode-1569 | MIK</video:title><video:description>Number of Ways to Reorder Array to Get Same BST | Intuition From Scratch | Leetcode-1569 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YMe9Q2yZvBo</video:player_loc><video:duration>2490</video:duration><video:publication_date>2023-06-16T09:47:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/powx-n-leetcode-50</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/7wcJXZoGKMI/hqdefault.jpg</video:thumbnail_loc><video:title>Pow(x, n) | Reasoning | Dry Run | LINKEDIN | AMAZON | Leetcode-50 | Live Code + Explanation</video:title><video:description>Pow(x, n) | Reasoning | Dry Run | LINKEDIN | AMAZON | Leetcode-50 | Live Code + Explanation. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/7wcJXZoGKMI</video:player_loc><video:duration>933</video:duration><video:publication_date>2023-07-24T05:08:25.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/excel-sheet-column-title-leetcode-168</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8QfC0elqK1o/hqdefault.jpg</video:thumbnail_loc><video:title>Excel Sheet Column Title | Made it simple | Dry Run | Leetcode-168 | Meta | Microsoft | Explanation</video:title><video:description>Excel Sheet Column Title | Made it simple | Dry Run | Leetcode-168 | Meta | Microsoft | Explanation. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8QfC0elqK1o</video:player_loc><video:duration>1175</video:duration><video:publication_date>2023-08-22T04:07:38.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/count-all-valid-pickup-and-delivery-options-leetcode-1359</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/JlBSoswl87c/hqdefault.jpg</video:thumbnail_loc><video:title>Count All Valid Pickup and Delivery Options | CLEAR INTUITION | META | Leetcode - 1359</video:title><video:description>Count All Valid Pickup and Delivery Options | CLEAR INTUITION | META | Leetcode - 1359. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/JlBSoswl87c</video:player_loc><video:duration>1311</video:duration><video:publication_date>2023-09-10T05:45:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/power-of-four-leetcode-342</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/-2Z4ngPy4H0/hqdefault.jpg</video:thumbnail_loc><video:title>Power of Four | 3 Approaches | Maths | With Proof | Bit Magic | Leetcode - 342</video:title><video:description>Power of Four | 3 Approaches | Maths | With Proof | Bit Magic | Leetcode - 342. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/-2Z4ngPy4H0</video:player_loc><video:duration>998</video:duration><video:publication_date>2023-10-23T04:41:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/poor-pigs-leetcode-458</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YQJLNxveyKg/hqdefault.jpg</video:thumbnail_loc><video:title>Poor Pigs | Maths | With Intuition | Clear Explanation | Leetcode 458 | codestorywithMIK</video:title><video:description>Poor Pigs | Maths | With Intuition | Clear Explanation | Leetcode 458 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YQJLNxveyKg</video:player_loc><video:duration>1987</video:duration><video:publication_date>2023-10-29T08:26:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/determine-if-a-cell-is-reachable-at-a-given-time-leetcode-2849</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/1k5-LnJlH78/hqdefault.jpg</video:thumbnail_loc><video:title>Determine if a Cell Is Reachable at a Given Time | Intuition | Math | Leetcode - 2849</video:title><video:description>Determine if a Cell Is Reachable at a Given Time | Intuition | Math | Leetcode - 2849. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/1k5-LnJlH78</video:player_loc><video:duration>1611</video:duration><video:publication_date>2023-11-08T03:44:18.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/minimum-time-visiting-all-points-leetcode-1266</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/_76B629_qas/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Time Visiting All Points | Simple Intuition | Leetcode 1266 | codestorywithMIK</video:title><video:description>Minimum Time Visiting All Points | Simple Intuition | Leetcode 1266 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/_76B629_qas</video:player_loc><video:duration>776</video:duration><video:publication_date>2023-12-03T05:15:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/calculate-money-in-leetcode-bank-leetcode-1716</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/TAmv6Csq3Ss/hqdefault.jpg</video:thumbnail_loc><video:title>Calculate Money in Leetcode Bank | 2 Approaches | O(n) | O(1) | Leetcode 1716</video:title><video:description>Calculate Money in Leetcode Bank | 2 Approaches | O(n) | O(1) | Leetcode 1716. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/TAmv6Csq3Ss</video:player_loc><video:duration>1629</video:duration><video:publication_date>2023-12-06T04:03:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/techfest-and-the-queue</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/-ZKUZU7s5Kw/hqdefault.jpg</video:thumbnail_loc><video:title>Techfest and the Queue | Simplest Explanation | GFG POTD</video:title><video:description>Techfest and the Queue | Simplest Explanation | GFG POTD. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/-ZKUZU7s5Kw</video:player_loc><video:duration>1435</video:duration><video:publication_date>2024-01-06T14:12:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/find-the-pivot-integer-leetcode-2485</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/cPaq3AABkLc/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Pivot Integer | 5 Approaches | Easy Explanation | Leetcode 2485 | codestorywithMIK</video:title><video:description>Find the Pivot Integer | 5 Approaches | Easy Explanation | Leetcode 2485 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/cPaq3AABkLc</video:player_loc><video:duration>1645</video:duration><video:publication_date>2024-03-13T08:00:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/check-if-number-is-a-sum-of-powers-of-three-leetcode-1780</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/BpotFrERzP4/hqdefault.jpg</video:thumbnail_loc><video:title>Check if Number is a Sum of Powers of Three | Maths Proof | 3 Ways | Leetcode 1780 |codestorywithMIK</video:title><video:description>Check if Number is a Sum of Powers of Three | Maths Proof | 3 Ways | Leetcode 1780 |codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/BpotFrERzP4</video:player_loc><video:duration>2488</video:duration><video:publication_date>2025-03-04T05:03:43.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/count-total-number-of-colored-cells-leetcode-2579</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/LakDs5OBiGM/hqdefault.jpg</video:thumbnail_loc><video:title>Count Total Number of Colored Cells | Maths Proof | 2 Approaches | Leetcode 2579 | codestorywithMIK</video:title><video:description>Count Total Number of Colored Cells | Maths Proof | 2 Approaches | Leetcode 2579 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/LakDs5OBiGM</video:player_loc><video:duration>853</video:duration><video:publication_date>2025-03-05T03:54:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/closest-prime-numbers-in-range-leetcode-2523</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/fwKTSOUvzaE/hqdefault.jpg</video:thumbnail_loc><video:title>Closest Prime Numbers in Range | 2 Detailed Approaches | Leetcode 2523 | codestorywithMIK</video:title><video:description>Closest Prime Numbers in Range | 2 Detailed Approaches | Leetcode 2523 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/fwKTSOUvzaE</video:player_loc><video:duration>1638</video:duration><video:publication_date>2025-03-07T04:30:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/minimum-operations-to-make-a-uni-value-grid-leetcode-2033</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/NvdOTWO02ZI/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Operations to Make a Uni-Value Grid | Detailed Simple Maths Proof | Leetcode 2033 | MIK</video:title><video:description>Minimum Operations to Make a Uni-Value Grid | Detailed Simple Maths Proof | Leetcode 2033 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/NvdOTWO02ZI</video:player_loc><video:duration>1768</video:duration><video:publication_date>2025-03-26T05:49:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/apply-operations-to-maximize-score-leetcode-2818</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/DX4zng-0pLE/hqdefault.jpg</video:thumbnail_loc><video:title>Apply Operations to Maximize Score | Super Detailed Approach For Beginners | Leetcode 2818 | MIK</video:title><video:description>Apply Operations to Maximize Score | Super Detailed Approach For Beginners | Leetcode 2818 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/DX4zng-0pLE</video:player_loc><video:duration>4852</video:duration><video:publication_date>2025-03-29T10:29:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/find-the-count-of-good-integers-leetcode-3272</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/4I1c9esy54s/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Count of Good Integers | Detailed Approach | Step By Step | Leetcode 3272 |codestorywithMIK</video:title><video:description>Find the Count of Good Integers | Detailed Approach | Step By Step | Leetcode 3272 |codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/4I1c9esy54s</video:player_loc><video:duration>2966</video:duration><video:publication_date>2025-04-12T06:38:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/count-good-numbers-leetcode-1922</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/rYLRgdj0n4s/hqdefault.jpg</video:thumbnail_loc><video:title>Count Good Numbers | Simple Explanation | Leetcode 1922 | codestorywithMIK</video:title><video:description>Count Good Numbers | Simple Explanation | Leetcode 1922 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/rYLRgdj0n4s</video:player_loc><video:duration>853</video:duration><video:publication_date>2025-04-13T03:34:48.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/count-the-hidden-sequences-leetcode-2145</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ednfb3I1qBo/hqdefault.jpg</video:thumbnail_loc><video:title>Count the Hidden Sequences | Detailed Explanation | Maths | Leetcode 2145 | codestorywithMIK</video:title><video:description>Count the Hidden Sequences | Detailed Explanation | Maths | Leetcode 2145 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ednfb3I1qBo</video:player_loc><video:duration>1578</video:duration><video:publication_date>2025-04-21T02:01:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/count-the-number-of-ideal-arrays-leetcode-2338</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/-3O4xMNjnUs/hqdefault.jpg</video:thumbnail_loc><video:title>Count the Number of Ideal Arrays | Detailed Explanation | Explained Maths | Leetcode 2338 | MIK</video:title><video:description>Count the Number of Ideal Arrays | Detailed Explanation | Explained Maths | Leetcode 2338 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/-3O4xMNjnUs</video:player_loc><video:duration>4546</video:duration><video:publication_date>2025-04-22T16:07:43.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/total-characters-in-string-after-transformations-ii-leetcode-3337</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/MGu9Zr5RFtg/hqdefault.jpg</video:thumbnail_loc><video:title>Total Characters in String After Transformations II | Binary Exponentiation | Leetcode 3337 | MIK</video:title><video:description>Total Characters in String After Transformations II | Binary Exponentiation | Leetcode 3337 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/MGu9Zr5RFtg</video:player_loc><video:duration>2820</video:duration><video:publication_date>2025-05-14T17:34:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/distribute-candies-among-children-ii-leetcode-2929</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/eL_3cDp0zjE/hqdefault.jpg</video:thumbnail_loc><video:title>Distribute Candies Among Children II | 4 Approaches | Detailed | Leetcode 2929 | codestorywithMIK</video:title><video:description>Distribute Candies Among Children II | 4 Approaches | Detailed | Leetcode 2929 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/eL_3cDp0zjE</video:player_loc><video:duration>2656</video:duration><video:publication_date>2025-06-01T08:17:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/count-the-number-of-arrays-with-k-matching-adjacent-elements-leetcode-3405</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/6BAXeAsgeyc/hqdefault.jpg</video:thumbnail_loc><video:title>Count the Number of Arrays with K Matching Adjacent Elements | Detailed Approach | Leetcode 3405</video:title><video:description>Count the Number of Arrays with K Matching Adjacent Elements | Detailed Approach | Leetcode 3405. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/6BAXeAsgeyc</video:player_loc><video:duration>1996</video:duration><video:publication_date>2025-06-17T14:15:49.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/sum-of-k-mirror-numbers-leetcode-2081</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/j_cFgoSJqDQ/hqdefault.jpg</video:thumbnail_loc><video:title>Sum of k-Mirror Numbers | Super Detailed | Minute Details | Leetcode 2081 | codestorywithMIK</video:title><video:description>Sum of k-Mirror Numbers | Super Detailed | Minute Details | Leetcode 2081 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/j_cFgoSJqDQ</video:player_loc><video:duration>3667</video:duration><video:publication_date>2025-06-23T01:00:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/alice-and-bob-playing-flower-game-leetcode-3021</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8PuV3IvUgk8/hqdefault.jpg</video:thumbnail_loc><video:title>Alice and Bob Playing Flower Game | Simple Math | Leetcode 3021 | codestorywithMIK</video:title><video:description>Alice and Bob Playing Flower Game | Simple Math | Leetcode 3021 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8PuV3IvUgk8</video:player_loc><video:duration>790</video:duration><video:publication_date>2025-08-29T07:01:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/minimum-operations-to-make-the-integer-zero-leetcode-2749</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YLKbecs9LIU/hqdefault.jpg</video:thumbnail_loc><video:title>Minimum Operations to Make the Integer Zero | 2 Ways | Math Proof | Leetcode 2749 | codestorywithMIK</video:title><video:description>Minimum Operations to Make the Integer Zero | 2 Ways | Math Proof | Leetcode 2749 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YLKbecs9LIU</video:player_loc><video:duration>2011</video:duration><video:publication_date>2025-09-05T09:26:25.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/fraction-to-recurring-decimal-leetcode-166</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/FDsgahPLENw/hqdefault.jpg</video:thumbnail_loc><video:title>Fraction to Recurring Decimal | Simple School Mathematics | Leetcode 166 | codestorywithMIK</video:title><video:description>Fraction to Recurring Decimal | Simple School Mathematics | Leetcode 166 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/FDsgahPLENw</video:player_loc><video:duration>1561</video:duration><video:publication_date>2025-09-24T07:47:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/smallest-missing-non-negative-integer-after-operations-leetcode-2598</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/S-y-PphOh2Q/hqdefault.jpg</video:thumbnail_loc><video:title>Smallest Missing Non-negative Integer After Operations | Simple observation | Leetcode 2598 | MIK</video:title><video:description>Smallest Missing Non-negative Integer After Operations | Simple observation | Leetcode 2598 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/S-y-PphOh2Q</video:player_loc><video:duration>1466</video:duration><video:publication_date>2025-10-16T07:18:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/smallest-integer-divisible-by-k-leetcode-1015</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/yqCSa29Ugxc/hqdefault.jpg</video:thumbnail_loc><video:title>Smallest Integer Divisible by K | Using already Studied Concept | Leetcode 1015 | codestorywithMIK</video:title><video:description>Smallest Integer Divisible by K | Using already Studied Concept | Leetcode 1015 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/yqCSa29Ugxc</video:player_loc><video:duration>1181</video:duration><video:publication_date>2025-11-25T04:23:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/count-number-of-trapezoids-i-leetcode-3623</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YI5ALyXyv_Q/hqdefault.jpg</video:thumbnail_loc><video:title>Count Number of Trapezoids I | Simplest Explanation | Detailed | Leetcode 3623 | codestorywithMIK</video:title><video:description>Count Number of Trapezoids I | Simplest Explanation | Detailed | Leetcode 3623 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YI5ALyXyv_Q</video:player_loc><video:duration>1323</video:duration><video:publication_date>2025-12-02T11:30:17.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/count-number-of-trapezoids-ii-leetcode-3625</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/AvF_T2a1zBY/hqdefault.jpg</video:thumbnail_loc><video:title>Count Number of Trapezoids II | Detailed in Simple Words | Leetcode 3625 | codestorywithMIK</video:title><video:description>Count Number of Trapezoids II | Detailed in Simple Words | Leetcode 3625 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/AvF_T2a1zBY</video:player_loc><video:duration>3860</video:duration><video:publication_date>2025-12-03T13:51:51.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/count-the-number-of-computer-unlocking-permutations-leetcode-3577</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8mRu29VKRtc/hqdefault.jpg</video:thumbnail_loc><video:title>Count the Number of Computer Unlocking Permutations | Simplest Explanation | Leetcode 3577 | MIK</video:title><video:description>Count the Number of Computer Unlocking Permutations | Simplest Explanation | Leetcode 3577 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8mRu29VKRtc</video:player_loc><video:duration>1210</video:duration><video:publication_date>2025-12-10T11:12:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/four-divisors-leetcode-1390</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/MOYYok4_e0I/hqdefault.jpg</video:thumbnail_loc><video:title>Four Divisors | Simplest Explanation | Dry Run | Straight Forward | Leetcode 1390 | codestorywithMIK</video:title><video:description>Four Divisors | Simplest Explanation | Dry Run | Straight Forward | Leetcode 1390 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/MOYYok4_e0I</video:player_loc><video:duration>1355</video:duration><video:publication_date>2026-01-04T02:29:51.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/find-the-largest-area-of-square-inside-two-rectangles-leetcode-3047</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Py-QkipMstQ/hqdefault.jpg</video:thumbnail_loc><video:title>Find the Largest Area of Square Inside Two Rectangles | Simple | Intuitive | Leetcode 3047 | MIK</video:title><video:description>Find the Largest Area of Square Inside Two Rectangles | Simple | Intuitive | Leetcode 3047 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Py-QkipMstQ</video:player_loc><video:duration>2026</video:duration><video:publication_date>2026-01-17T04:14:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/fancy-sequence-leetcode-1622</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/O306K1S7A8U/hqdefault.jpg</video:thumbnail_loc><video:title>Fancy Sequence | Made Super Simple | Intuitive | Detailed | Leetcode 1622 | codestorywithMIK</video:title><video:description>Fancy Sequence | Made Super Simple | Intuitive | Detailed | Leetcode 1622 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/O306K1S7A8U</video:player_loc><video:duration>2577</video:duration><video:publication_date>2026-03-15T01:12:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/total-waviness-of-numbers-in-range-i-leetcode-3751</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/rPbjKtn3vOg/hqdefault.jpg</video:thumbnail_loc><video:title>Total Waviness of Numbers in Range I | Simple | Leetcode 3751 | codestorywithMIK</video:title><video:description>Total Waviness of Numbers in Range I | Simple | Leetcode 3751 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/rPbjKtn3vOg</video:player_loc><video:duration>609</video:duration><video:publication_date>2026-06-04T08:34:18.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/number-of-ways-to-assign-edge-weights-i-leetcode-3558</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/VQ2I1vn21iA/hqdefault.jpg</video:thumbnail_loc><video:title>Number of Ways to Assign Edge Weights I | Simplified | Leetcode 3558 | codestorywithMIK</video:title><video:description>Number of Ways to Assign Edge Weights I | Simplified | Leetcode 3558 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/VQ2I1vn21iA</video:player_loc><video:duration>1831</video:duration><video:publication_date>2026-06-11T07:50:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/sorted-gcd-pair-queries-leetcode-3312</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/v4f2M_0IPgU/hqdefault.jpg</video:thumbnail_loc><video:title>Sorted GCD Pair Queries | Deep Dive | Intuition | Dry Run | Leetcode 3312 | codestorywithMIK</video:title><video:description>Sorted GCD Pair Queries | Deep Dive | Intuition | Dry Run | Leetcode 3312 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/v4f2M_0IPgU</video:player_loc><video:duration>3100</video:duration><video:publication_date>2026-07-17T15:53:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/smallest-palindromic-rearrangement-ii-leetcode-3518</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/OTdZRJsNRtE/hqdefault.jpg</video:thumbnail_loc><video:title>Smallest Palindromic Rearrangement II | Deep Dive | Intuition | Dry Run | Leetcode 3518 | MIK</video:title><video:description>Smallest Palindromic Rearrangement II | Deep Dive | Intuition | Dry Run | Leetcode 3518 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/OTdZRJsNRtE</video:player_loc><video:duration>5070</video:duration><video:publication_date>2026-07-29T08:15:21.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/kth-smallest-amount-with-single-denomination-combination-leetcode-3116</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QRlIMH6GmtU/hqdefault.jpg</video:thumbnail_loc><video:title>Kth Smallest Amount With Single Denomination Combination | Detailed For Beginners | Leetcode 3116</video:title><video:description>Kth Smallest Amount With Single Denomination Combination | Detailed For Beginners | Leetcode 3116. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QRlIMH6GmtU</video:player_loc><video:duration>3697</video:duration><video:publication_date>2026-08-21T14:03:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/construct-uniform-parity-array-i-leetcode-3875</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Ee_0S2bzJeI/hqdefault.jpg</video:thumbnail_loc><video:title>Construct Uniform Parity Array I &amp; II | Clear Intuition | Leetcode 3875 &amp; 3876 | codestorywithMIK</video:title><video:description>Construct Uniform Parity Array I &amp; II | Clear Intuition | Leetcode 3875 &amp; 3876 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Ee_0S2bzJeI</video:player_loc><video:duration>2022</video:duration><video:publication_date>2026-09-02T15:14:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/count-commas-in-range-ii-leetcode-3871</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/lgYlM6MLUyU/hqdefault.jpg</video:thumbnail_loc><video:title>Count Commas in Range II | Two Approaches | Leetcode 3871 | codestorywithMIK</video:title><video:description>Count Commas in Range II | Two Approaches | Leetcode 3871 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/lgYlM6MLUyU</video:player_loc><video:duration>1679</video:duration><video:publication_date>2026-09-08T07:02:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/circle-and-rectangle-overlapping-leetcode-1401</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YQoN-z3HKI4/hqdefault.jpg</video:thumbnail_loc><video:title>Circle and Rectangle Overlapping | Two Simplest Ways | Visualizations | Leetcode 1401 | MIK</video:title><video:description>Circle and Rectangle Overlapping | Two Simplest Ways | Visualizations | Leetcode 1401 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YQoN-z3HKI4</video:player_loc><video:duration>1161</video:duration><video:publication_date>2026-09-19T03:04:17.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/count-of-matches-in-tournament-leetcode-1688</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/rTZdxOlHwk0/hqdefault.jpg</video:thumbnail_loc><video:title>Count of Matches in Tournament | MICROSOFT | Leetcode 1688</video:title><video:description>Count of Matches in Tournament | MICROSOFT | Leetcode 1688. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/rTZdxOlHwk0</video:player_loc><video:duration>729</video:duration><video:publication_date>2023-12-05T02:57:45.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/missing-number-leetcode-268</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/lpyQGkbDvqI/hqdefault.jpg</video:thumbnail_loc><video:title>Missing Number | Multiple Approaches | Leetcode 268</video:title><video:description>Missing Number | Multiple Approaches | Leetcode 268. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/lpyQGkbDvqI</video:player_loc><video:duration>1498</video:duration><video:publication_date>2024-02-20T02:23:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/pass-the-pillow-leetcode-2582</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/tI8OO93t2zM/hqdefault.jpg</video:thumbnail_loc><video:title>Pass the Pillow | 2 Approaches | Easy Explanations | Leetcode 2582 | codestorywithMIK</video:title><video:description>Pass the Pillow | 2 Approaches | Easy Explanations | Leetcode 2582 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/tI8OO93t2zM</video:player_loc><video:duration>1449</video:duration><video:publication_date>2024-07-06T08:21:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/water-bottles-leetcode-1518</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/v2D_v3llC98/hqdefault.jpg</video:thumbnail_loc><video:title>Water Bottles | Leetcode 1518 | 3 Approaches | Dry Runs Explained Clearly | codestorywithMIK</video:title><video:description>Water Bottles | Leetcode 1518 | 3 Approaches | Dry Runs Explained Clearly | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/v2D_v3llC98</video:player_loc><video:duration>1853</video:duration><video:publication_date>2024-07-07T03:23:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/find-missing-and-repeated-values-leetcode-2965</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9tUv0SfUyGg/hqdefault.jpg</video:thumbnail_loc><video:title>Find Missing and Repeated Values | Mathematical Proof | Leetcode 2965 | codestorywithMIK</video:title><video:description>Find Missing and Repeated Values | Mathematical Proof | Leetcode 2965 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9tUv0SfUyGg</video:player_loc><video:duration>1551</video:duration><video:publication_date>2025-03-06T02:34:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/count-symmetric-integers-leetcode-2843</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/abaS9eWoRkw/hqdefault.jpg</video:thumbnail_loc><video:title>Count Symmetric Integers | 2 Detailed Approaches | Leetcode 2843 | codestorywithMIK</video:title><video:description>Count Symmetric Integers | 2 Detailed Approaches | Leetcode 2843 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/abaS9eWoRkw</video:player_loc><video:duration>1138</video:duration><video:publication_date>2025-04-11T02:14:53.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/unique-3-digit-even-numbers-leetcode-2094</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/og7s7dhWRbE/hqdefault.jpg</video:thumbnail_loc><video:title>Finding 3-Digit Even Numbers | 2 Simple Approaches | Leetcode 2094 | Leetcode 3483 | MIK</video:title><video:description>Finding 3-Digit Even Numbers | 2 Simple Approaches | Leetcode 2094 | Leetcode 3483 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/og7s7dhWRbE</video:player_loc><video:duration>1431</video:duration><video:publication_date>2025-05-12T02:28:59.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/divisible-and-non-divisible-sums-difference-leetcode-2894</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/aSZi159QnvU/hqdefault.jpg</video:thumbnail_loc><video:title>Divisible and Non-divisible Sums Difference | Constant Time | Leetcode 2894 | codestorywithMIK</video:title><video:description>Divisible and Non-divisible Sums Difference | Constant Time | Leetcode 2894 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/aSZi159QnvU</video:player_loc><video:duration>687</video:duration><video:publication_date>2025-05-27T01:44:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/power-of-three-leetcode-326</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/11lCatB_H_A/hqdefault.jpg</video:thumbnail_loc><video:title>Power of Three | 4 Approaches | Why Constant Approach Works | Leetcode 326 | codestorywithMIK</video:title><video:description>Power of Three | 4 Approaches | Why Constant Approach Works | Leetcode 326 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/11lCatB_H_A</video:player_loc><video:duration>1314</video:duration><video:publication_date>2025-08-13T04:13:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/maximum-area-of-longest-diagonal-rectangle-leetcode-3000</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/S43R5YCvf9Q/hqdefault.jpg</video:thumbnail_loc><video:title>Maximum Area of Longest Diagonal Rectangle | Easy | Leetcode 3000 | codestorywithMIK</video:title><video:description>Maximum Area of Longest Diagonal Rectangle | Easy | Leetcode 3000 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/S43R5YCvf9Q</video:player_loc><video:duration>422</video:duration><video:publication_date>2025-08-26T01:23:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/largest-triangle-area-leetcode-812</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Xlkvc2IeK7M/hqdefault.jpg</video:thumbnail_loc><video:title>Largest Triangle Area | Heron | Shoelace | Leetcode 812 | codestorywithMIK</video:title><video:description>Largest Triangle Area | Heron | Shoelace | Leetcode 812 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Xlkvc2IeK7M</video:player_loc><video:duration>889</video:duration><video:publication_date>2025-09-27T05:55:18.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/calculate-money-in-leetcode-bank-leetcode-1716-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/-_JnFCYgMUo/hqdefault.jpg</video:thumbnail_loc><video:title>Calculate Money in Leetcode Bank | 3 Easy Approaches | Leetcode 1716 | codestorywithMIK</video:title><video:description>Calculate Money in Leetcode Bank | 3 Easy Approaches | Leetcode 1716 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/-_JnFCYgMUo</video:player_loc><video:duration>1670</video:duration><video:publication_date>2025-10-25T06:14:48.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/count-operations-to-obtain-zero-leetcode-2169</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/1Vq8EjnWTNE/hqdefault.jpg</video:thumbnail_loc><video:title>Count Operations to Obtain Zero | Multiple Approaches | Leetcode 2169 | codestorywithMIK</video:title><video:description>Count Operations to Obtain Zero | Multiple Approaches | Leetcode 2169 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/1Vq8EjnWTNE</video:player_loc><video:duration>1003</video:duration><video:publication_date>2025-11-09T01:21:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/count-odd-numbers-in-an-interval-range-leetcode-1523</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/c5iHN8MI_JI/hqdefault.jpg</video:thumbnail_loc><video:title>Count Odd Numbers in an Interval Range | Multiple Ways | Leetcode 1523 | codestorywithMIK</video:title><video:description>Count Odd Numbers in an Interval Range | Multiple Ways | Leetcode 1523 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/c5iHN8MI_JI</video:player_loc><video:duration>790</video:duration><video:publication_date>2025-12-07T03:49:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/mirror-distance-of-an-integer-leetcode-3783</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ON5pgHe9noc/hqdefault.jpg</video:thumbnail_loc><video:title>Mirror Distance of an Integer | 2 Ways | Simple Explanation | Leetcode 3783 | codestorywithMIK</video:title><video:description>Mirror Distance of an Integer | 2 Ways | Simple Explanation | Leetcode 3783 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ON5pgHe9noc</video:player_loc><video:duration>477</video:duration><video:publication_date>2026-04-18T00:11:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/gcd-of-odd-and-even-sums-leetcode-3658</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Gz-LzeUDzg4/hqdefault.jpg</video:thumbnail_loc><video:title>GCD of Odd and Even Sums | Maths Proof | Leetcode 3658 | codestorywithMIK</video:title><video:description>GCD of Odd and Even Sums | Maths Proof | Leetcode 3658 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Gz-LzeUDzg4</video:player_loc><video:duration>625</video:duration><video:publication_date>2026-07-15T06:51:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/count-commas-in-range-leetcode-3870</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Oi-pSLs5-2I/hqdefault.jpg</video:thumbnail_loc><video:title>Count Commas in Range | Simple Approaches | Leetcode 3870 | codestorywithMIK</video:title><video:description>Count Commas in Range | Simple Approaches | Leetcode 3870 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Oi-pSLs5-2I</video:player_loc><video:duration>655</video:duration><video:publication_date>2026-09-08T01:30:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/math/vowels-game-in-a-string-leetcode-3227</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/vJuMCE8ZiD4/hqdefault.jpg</video:thumbnail_loc><video:title>Vowels Game in a String | Simple Brainteaser | Leetcode 3227 | codestorywithMIK</video:title><video:description>Vowels Game in a String | Simple Brainteaser | Leetcode 3227 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/vJuMCE8ZiD4</video:player_loc><video:duration>1013</video:duration><video:publication_date>2025-09-12T04:13:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/segment-tree-and-bit/segment-tree</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/k99r1A7krcY/hqdefault.jpg</video:thumbnail_loc><video:title>Segment Tree | Introduction | Basics | Build Segment Tree | Video 1 | codestorywithMIK</video:title><video:description>Segment Tree | Introduction | Basics | Build Segment Tree | Video 1 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/k99r1A7krcY</video:player_loc><video:duration>3283</video:duration><video:publication_date>2024-06-16T18:50:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/segment-tree-and-bit/segment-tree-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/aHOKsAg2EWE/hqdefault.jpg</video:thumbnail_loc><video:title>Segment Tree | Update Query | Story To Code | Video 2</video:title><video:description>Segment Tree | Update Query | Story To Code | Video 2. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/aHOKsAg2EWE</video:player_loc><video:duration>1343</video:duration><video:publication_date>2024-06-17T14:58:17.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/segment-tree-and-bit/segment-tree-3</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8TEGjTfnRt8/hqdefault.jpg</video:thumbnail_loc><video:title>Segment Tree | Range Sum Query | Story To Code | Video 3</video:title><video:description>Segment Tree | Range Sum Query | Story To Code | Video 3. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8TEGjTfnRt8</video:player_loc><video:duration>1741</video:duration><video:publication_date>2024-06-18T16:20:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/segment-tree-and-bit/segment-tree-4</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/3Iq5x56g_dM/hqdefault.jpg</video:thumbnail_loc><video:title>Segment Tree | Why size is 4*n | With Proof | Video 4</video:title><video:description>Segment Tree | Why size is 4*n | With Proof | Video 4. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/3Iq5x56g_dM</video:player_loc><video:duration>870</video:duration><video:publication_date>2024-06-23T15:07:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/segment-tree-and-bit/range-maximum-index-query</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5n2zzL8EqNY/hqdefault.jpg</video:thumbnail_loc><video:title>Range Maximum Index Query | Part 1 | Segment Tree Concepts &amp; Qns | Video 9 | codestorywithMIK</video:title><video:description>Range Maximum Index Query | Part 1 | Segment Tree Concepts &amp; Qns | Video 9 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5n2zzL8EqNY</video:player_loc><video:duration>2059</video:duration><video:publication_date>2024-12-23T20:57:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/segment-tree-and-bit/range-maximum-index-query-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/SpBjlU3ETL0/hqdefault.jpg</video:thumbnail_loc><video:title>Range Maximum Index Query | Part 2 | Segment Tree Concepts &amp; Qns | Video 10 | codestorywithMIK</video:title><video:description>Range Maximum Index Query | Part 2 | Segment Tree Concepts &amp; Qns | Video 10 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/SpBjlU3ETL0</video:player_loc><video:duration>1226</video:duration><video:publication_date>2024-12-24T16:52:52.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/segment-tree-and-bit/range-update</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/sQ2qWFzRAi8/hqdefault.jpg</video:thumbnail_loc><video:title>Range Update | Min-Max Query | Lazy Propagation | Segment Tree Concepts &amp; Qns | Video 14 | MIK</video:title><video:description>Range Update | Min-Max Query | Lazy Propagation | Segment Tree Concepts &amp; Qns | Video 14 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/sQ2qWFzRAi8</video:player_loc><video:duration>1964</video:duration><video:publication_date>2026-02-11T07:34:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/segment-tree-and-bit/maximize-active-section-with-trade-ii-leetcode-3501</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YW6kW65yRx8/hqdefault.jpg</video:thumbnail_loc><video:title>Maximize Active Section with Trade II | Leetcode 3501 | Detailed For Beginners | codestorywithMIK</video:title><video:description>Maximize Active Section with Trade II | Leetcode 3501 | Detailed For Beginners | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YW6kW65yRx8</video:player_loc><video:duration>3955</video:duration><video:publication_date>2026-07-22T10:32:59.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/segment-tree-and-bit/query-sum-ii</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/VJ67kQHYbv8/hqdefault.jpg</video:thumbnail_loc><video:title>Query Sum II | Segment Tree Concepts &amp; Qns | Video 5 | codestorywithMIK</video:title><video:description>Query Sum II | Segment Tree Concepts &amp; Qns | Video 5 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/VJ67kQHYbv8</video:player_loc><video:duration>1128</video:duration><video:publication_date>2024-06-30T06:27:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/segment-tree-and-bit/range-minimum-query</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/qU4DAnv3o7g/hqdefault.jpg</video:thumbnail_loc><video:title>Range Minimum Query | Segment Tree Concepts &amp; Qns | Video 6 | codestorywithMIK</video:title><video:description>Range Minimum Query | Segment Tree Concepts &amp; Qns | Video 6 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/qU4DAnv3o7g</video:player_loc><video:duration>864</video:duration><video:publication_date>2024-06-30T06:46:17.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/segment-tree-and-bit/range-update-query</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/FB_LjtTQwlw/hqdefault.jpg</video:thumbnail_loc><video:title>Range Update Query | Lazy Propagation | Segment Tree Concepts &amp; Qns | Video 7 | codestorywithMIK</video:title><video:description>Range Update Query | Lazy Propagation | Segment Tree Concepts &amp; Qns | Video 7 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/FB_LjtTQwlw</video:player_loc><video:duration>2946</video:duration><video:publication_date>2024-07-07T16:41:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/segment-tree-and-bit/range-sum-query-mutable-leetcode-307</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/82HaBghHuDU/hqdefault.jpg</video:thumbnail_loc><video:title>Range Sum Query - Mutable | Leetcode 307 | Segment Tree Concepts &amp; Qns | Video 8 | codestorywithMIK</video:title><video:description>Range Sum Query - Mutable | Leetcode 307 | Segment Tree Concepts &amp; Qns | Video 8 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/82HaBghHuDU</video:player_loc><video:duration>1038</video:duration><video:publication_date>2024-07-13T09:46:55.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/segment-tree-and-bit/find-building-where-alice-and-bob-can-meet-leetcode-2940</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Eh2UHBHxqvc/hqdefault.jpg</video:thumbnail_loc><video:title>Find Building Where Alice and Bob Can Meet | Segment Tree Concepts &amp; Qns | Video 11 | Leetcode 2940</video:title><video:description>Find Building Where Alice and Bob Can Meet | Segment Tree Concepts &amp; Qns | Video 11 | Leetcode 2940. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Eh2UHBHxqvc</video:player_loc><video:duration>2229</video:duration><video:publication_date>2024-12-24T17:34:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/segment-tree-and-bit/count-good-triplets-in-an-array-leetcode-2179</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/gRF7k0dNr7k/hqdefault.jpg</video:thumbnail_loc><video:title>Count Good Triplets in an Array | Segment Tree Concepts &amp; Qns | Video 12 | Leetcode 2179 | MIK</video:title><video:description>Count Good Triplets in an Array | Segment Tree Concepts &amp; Qns | Video 12 | Leetcode 2179 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/gRF7k0dNr7k</video:player_loc><video:duration>3849</video:duration><video:publication_date>2025-04-15T13:51:57.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/segment-tree-and-bit/fruits-into-baskets-ii-leetcode-3477</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/OC3zzMwCdSk/hqdefault.jpg</video:thumbnail_loc><video:title>Fruits Into Baskets II &amp; III | Segment Tree Concepts &amp; Qns | Video 13 | Leetcode 3477 | 3479 | MIK</video:title><video:description>Fruits Into Baskets II &amp; III | Segment Tree Concepts &amp; Qns | Video 13 | Leetcode 3477 | 3479 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/OC3zzMwCdSk</video:player_loc><video:duration>2232</video:duration><video:publication_date>2025-08-05T20:20:23.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/segment-tree-and-bit/longest-balanced-subarray-ii-leetcode-3721</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QxS30NMAjhE/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Balanced Subarray II | Leetcode 3721 | Min-Max Query | Segment Tree Concept | Video 15 | MIK</video:title><video:description>Longest Balanced Subarray II | Leetcode 3721 | Min-Max Query | Segment Tree Concept | Video 15 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QxS30NMAjhE</video:player_loc><video:duration>1997</video:duration><video:publication_date>2026-02-11T11:20:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/segment-tree-and-bit/block-placement-queries-leetcode-3161</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/s3_sqPldDTU/hqdefault.jpg</video:thumbnail_loc><video:title>Block Placement Queries | Leetcode 3161 | Brute Force | Optimal | Detailed | codestorywithMIK</video:title><video:description>Block Placement Queries | Leetcode 3161 | Brute Force | Optimal | Detailed | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/s3_sqPldDTU</video:player_loc><video:duration>3303</video:duration><video:publication_date>2026-05-30T10:41:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/segment-tree-and-bit/longest-substring-of-one-repeating-character-leetcode-2213</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/b4DvhEzS9x0/hqdefault.jpg</video:thumbnail_loc><video:title>Longest Substring of One Repeating Character | Leetcode 2213 | Detailed with Dry Run | MIK</video:title><video:description>Longest Substring of One Repeating Character | Leetcode 2213 | Detailed with Dry Run | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/b4DvhEzS9x0</video:player_loc><video:duration>3384</video:duration><video:publication_date>2026-08-13T07:18:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/segment-tree-and-bit/distribute-elements-into-two-arrays-ii-leetcode-3072</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ONzyN2tE4fU/hqdefault.jpg</video:thumbnail_loc><video:title>Distribute Elements Into Two Arrays II | Detailed | Made Simple | Leetcode 3072 | codestorywithMIK</video:title><video:description>Distribute Elements Into Two Arrays II | Detailed | Made Simple | Leetcode 3072 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ONzyN2tE4fU</video:player_loc><video:duration>4494</video:duration><video:publication_date>2026-08-21T00:29:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/segment-tree-and-bit/find-x-value-of-array-ii-leetcode-3525</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/LFYjHyUXAdc/hqdefault.jpg</video:thumbnail_loc><video:title>Find X Value of Array II | Super Detailed | Beginner Friendly | Leetcode 3525 | codestorywithMIK</video:title><video:description>Find X Value of Array II | Super Detailed | Beginner Friendly | Leetcode 3525 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/LFYjHyUXAdc</video:player_loc><video:duration>5049</video:duration><video:publication_date>2026-09-22T04:05:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/segment-tree-and-bit/subarrays-distinct-element-sum-of-squares-ii-leetcode-2916</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8Fjin_L8Qmw/hqdefault.jpg</video:thumbnail_loc><video:title>Subarrays Distinct Element Sum of Squares II | Detailed Deep Dive | Leetcode 2916 | codestorywithMIK</video:title><video:description>Subarrays Distinct Element Sum of Squares II | Detailed Deep Dive | Leetcode 2916 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8Fjin_L8Qmw</video:player_loc><video:duration>4109</video:duration><video:publication_date>2026-10-16T06:49:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/design-data-structures/insert-delete-getrandom-o1-leetcode-380</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/3yTnLrNdJGo/hqdefault.jpg</video:thumbnail_loc><video:title>Insert Delete GetRandom O(1) | Detailed | Google | Leetcode 380</video:title><video:description>Insert Delete GetRandom O(1) | Detailed | Google | Leetcode 380. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/3yTnLrNdJGo</video:player_loc><video:duration>1284</video:duration><video:publication_date>2022-11-29T04:44:53.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/design-data-structures/lru-cache-leetcode-146</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/81h8O-0U5oo/hqdefault.jpg</video:thumbnail_loc><video:title>LRU Cache | Brute Force | Optimal | Detailed | Leetcode 146</video:title><video:description>LRU Cache | Brute Force | Optimal | Detailed | Leetcode 146. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/81h8O-0U5oo</video:player_loc><video:duration>2432</video:duration><video:publication_date>2023-01-29T10:36:18.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/design-data-structures/lfu-cache-leetcode-460</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/-Vch0tHAsOM/hqdefault.jpg</video:thumbnail_loc><video:title>LFU Cache - (Microsoft)  :  Explanation➕Live Coding</video:title><video:description>LFU Cache - (Microsoft)  :  Explanation➕Live Coding. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/-Vch0tHAsOM</video:player_loc><video:duration>2969</video:duration><video:publication_date>2023-01-29T17:00:38.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/design-data-structures/design-browser-history-leetcode-1472</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/FNcanLK6aZs/hqdefault.jpg</video:thumbnail_loc><video:title>Design Browser History  | Made Easy | META | Leetcode 1472</video:title><video:description>Design Browser History  | Made Easy | META | Leetcode 1472. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/FNcanLK6aZs</video:player_loc><video:duration>854</video:duration><video:publication_date>2023-03-18T16:50:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/design-data-structures/design-add-and-search-words-data-structure-leetcode-211</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/wyUO7Oq9uS4/hqdefault.jpg</video:thumbnail_loc><video:title>Design Add and Search Words Data Structure | Made Easy | GOOGLE | Leetcode 211</video:title><video:description>Design Add and Search Words Data Structure | Made Easy | GOOGLE | Leetcode 211. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/wyUO7Oq9uS4</video:player_loc><video:duration>1508</video:duration><video:publication_date>2023-03-19T14:58:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/design-data-structures/design-parking-system-leetcode-1603</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ysZ7Rla4w7Y/hqdefault.jpg</video:thumbnail_loc><video:title>Design Parking System | GOOGLE | Leetcode-1603 | Live Code</video:title><video:description>Design Parking System | GOOGLE | Leetcode-1603 | Live Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ysZ7Rla4w7Y</video:player_loc><video:duration>446</video:duration><video:publication_date>2023-05-29T02:05:48.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/design-data-structures/design-hashset-leetcode-705</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Ts9JHEaApfM/hqdefault.jpg</video:thumbnail_loc><video:title>Design HashSet | Full Details | GOOGLE | Leetcode-705 | Live Code</video:title><video:description>Design HashSet | Full Details | GOOGLE | Leetcode-705 | Live Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Ts9JHEaApfM</video:player_loc><video:duration>1577</video:duration><video:publication_date>2023-05-30T12:27:52.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/design-data-structures/design-underground-system-leetcode-1396</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/AdRVFQo0l7w/hqdefault.jpg</video:thumbnail_loc><video:title>Design Underground System | Full Thought Process | Bloomberg | Amazon | Leetcode 1396</video:title><video:description>Design Underground System | Full Thought Process | Bloomberg | Amazon | Leetcode 1396. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/AdRVFQo0l7w</video:player_loc><video:duration>1226</video:duration><video:publication_date>2023-05-31T15:06:23.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/design-data-structures/snapshot-array-leetcode-1146</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/yEYoNCom72Q/hqdefault.jpg</video:thumbnail_loc><video:title>Snapshot Array | Full Thought Process | Microsoft | Amazon | Leetcode 1146</video:title><video:description>Snapshot Array | Full Thought Process | Microsoft | Amazon | Leetcode 1146. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/yEYoNCom72Q</video:player_loc><video:duration>2105</video:duration><video:publication_date>2023-06-11T12:45:18.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/design-data-structures/implement-stack-using-queues-leetcode-225</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/LaBE0gNYCaM/hqdefault.jpg</video:thumbnail_loc><video:title>Implement Stack using Queues | Full Thought Process | BLOOMBERG | Leetcode-225 | Live Code</video:title><video:description>Implement Stack using Queues | Full Thought Process | BLOOMBERG | Leetcode-225 | Live Code. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/LaBE0gNYCaM</video:player_loc><video:duration>1319</video:duration><video:publication_date>2023-08-28T03:30:41.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/design-data-structures/design-hashmap-leetcode-706</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/SerANdwnELI/hqdefault.jpg</video:thumbnail_loc><video:title>Design HashMap | Brute Force | Optimal | META | GOOGLE | NETFLIX | Leetcode - 706</video:title><video:description>Design HashMap | Brute Force | Optimal | META | GOOGLE | NETFLIX | Leetcode - 706. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/SerANdwnELI</video:player_loc><video:duration>1431</video:duration><video:publication_date>2023-10-04T11:26:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/design-data-structures/flatten-nested-list-iterator-leetcode-341</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/0PFE_7S3X-U/hqdefault.jpg</video:thumbnail_loc><video:title>Flatten Nested List Iterator | 3 Approaches | Full Details | GOOGLE | NETFLIX | Leetcode - 341</video:title><video:description>Flatten Nested List Iterator | 3 Approaches | Full Details | GOOGLE | NETFLIX | Leetcode - 341. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/0PFE_7S3X-U</video:player_loc><video:duration>2572</video:duration><video:publication_date>2023-10-20T08:35:38.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/design-data-structures/seat-reservation-manager-leetcode-1845</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/fjwHZNvbr7g/hqdefault.jpg</video:thumbnail_loc><video:title>Seat Reservation Manager | 3 Ways | Intuition | META | Leetcode - 1845</video:title><video:description>Seat Reservation Manager | 3 Ways | Intuition | META | Leetcode - 1845. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/fjwHZNvbr7g</video:player_loc><video:duration>1445</video:duration><video:publication_date>2023-11-06T03:38:57.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/design-data-structures/design-a-food-rating-system-leetcode-2353</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/SF13GD8FPxM/hqdefault.jpg</video:thumbnail_loc><video:title>Design a Food Rating System | Clean Approach | Leetcode 2353 | codestorywithMIK</video:title><video:description>Design a Food Rating System | Clean Approach | Leetcode 2353 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/SF13GD8FPxM</video:player_loc><video:duration>1533</video:duration><video:publication_date>2023-12-17T06:26:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/design-data-structures/most-frequent-ids-leetcode-3092</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/saAEj_iL_FQ/hqdefault.jpg</video:thumbnail_loc><video:title>Most Frequent IDs | Complete Intuition | Leetcode 3092 | codestorywithMIK</video:title><video:description>Most Frequent IDs | Complete Intuition | Leetcode 3092 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/saAEj_iL_FQ</video:player_loc><video:duration>1919</video:duration><video:publication_date>2024-03-24T06:15:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/design-data-structures/design-circular-deque-leetcode-641</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/WMlBUTu-mBU/hqdefault.jpg</video:thumbnail_loc><video:title>Design Circular Deque | Simplest Explanation | 2 Ways | Leetcode 641 | codestorywithMIK</video:title><video:description>Design Circular Deque | Simplest Explanation | 2 Ways | Leetcode 641 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/WMlBUTu-mBU</video:player_loc><video:duration>1495</video:duration><video:publication_date>2024-09-28T06:21:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/design-data-structures/all-oone-data-structure-leetcode-432</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/GJJ2OWKHADs/hqdefault.jpg</video:thumbnail_loc><video:title>All O`one Data Structure | Super Simple Explanation | Leetcode 432 | codestorywithMIK</video:title><video:description>All O`one Data Structure | Super Simple Explanation | Leetcode 432 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/GJJ2OWKHADs</video:player_loc><video:duration>2849</video:duration><video:publication_date>2024-09-29T08:31:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/design-data-structures/design-a-stack-with-increment-operation-leetcode-1381</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/1KYzjryTRmg/hqdefault.jpg</video:thumbnail_loc><video:title>Design a Stack With Increment Operation | Better Approach | O(1) | Leetcode 1381 | codestorywithMIK</video:title><video:description>Design a Stack With Increment Operation | Better Approach | O(1) | Leetcode 1381 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/1KYzjryTRmg</video:player_loc><video:duration>1477</video:duration><video:publication_date>2024-09-30T03:33:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/design-data-structures/design-a-number-container-system-leetcode-2349</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/689qj769Gt4/hqdefault.jpg</video:thumbnail_loc><video:title>Design a Number Container System | 2 Approaches | Leetcode 2349 | codestorywithMIK</video:title><video:description>Design a Number Container System | 2 Approaches | Leetcode 2349 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/689qj769Gt4</video:player_loc><video:duration>1833</video:duration><video:publication_date>2025-02-08T03:37:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/design-data-structures/finding-pairs-with-a-certain-sum-leetcode-1865</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/3yL6gQz4vTc/hqdefault.jpg</video:thumbnail_loc><video:title>Finding Pairs With a Certain Sum | Simple Explanation | Leetcode 1865 | codestorywithMIK</video:title><video:description>Finding Pairs With a Certain Sum | Simple Explanation | Leetcode 1865 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/3yL6gQz4vTc</video:player_loc><video:duration>1187</video:duration><video:publication_date>2025-07-06T04:16:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/design-data-structures/design-task-manager-leetcode-3408</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/s5HK_H9GSDI/hqdefault.jpg</video:thumbnail_loc><video:title>Design Task Manager | Simple Intuition | Dry Run | Leetcode 3408 | codestorywithMIK</video:title><video:description>Design Task Manager | Simple Intuition | Dry Run | Leetcode 3408 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/s5HK_H9GSDI</video:player_loc><video:duration>1516</video:duration><video:publication_date>2025-09-18T07:59:43.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/design-data-structures/design-spreadsheet-leetcode-3484</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/gWZaQtwM388/hqdefault.jpg</video:thumbnail_loc><video:title>Design Spreadsheet | Simple Simulation | Leetcode 3484 | codestorywithMIK</video:title><video:description>Design Spreadsheet | Simple Simulation | Leetcode 3484 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/gWZaQtwM388</video:player_loc><video:duration>982</video:duration><video:publication_date>2025-09-19T05:54:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/design-data-structures/implement-router-leetcode-3508</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/cZ2XgOV_M3A/hqdefault.jpg</video:thumbnail_loc><video:title>Implement Router | Detailed Analysis | Leetcode 3508 | codestorywithMIK</video:title><video:description>Implement Router | Detailed Analysis | Leetcode 3508 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/cZ2XgOV_M3A</video:player_loc><video:duration>2259</video:duration><video:publication_date>2025-09-20T08:29:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/design-data-structures/design-movie-rental-system-leetcode-1912</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/17UaJS5dYVc/hqdefault.jpg</video:thumbnail_loc><video:title>Design Movie Rental System | Detailed Analysis | Leetcode 1912 | codestorywithMIK</video:title><video:description>Design Movie Rental System | Detailed Analysis | Leetcode 1912 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/17UaJS5dYVc</video:player_loc><video:duration>2271</video:duration><video:publication_date>2025-09-21T07:49:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/design-data-structures/simple-bank-system-leetcode-2043</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/tWjhWdHR4Zw/hqdefault.jpg</video:thumbnail_loc><video:title>Simple Bank System | Easy Simulation| Leetcode 2043 | codestorywithMIK</video:title><video:description>Simple Bank System | Easy Simulation| Leetcode 2043 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/tWjhWdHR4Zw</video:player_loc><video:duration>668</video:duration><video:publication_date>2025-10-26T05:43:35.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/design-data-structures/walking-robot-simulation-ii-leetcode-2069</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YAGP17hvQjY/hqdefault.jpg</video:thumbnail_loc><video:title>Walking Robot Simulation II | Simplified Simulation | Leetcode 2069 | codestorywithMIK</video:title><video:description>Walking Robot Simulation II | Simplified Simulation | Leetcode 2069 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YAGP17hvQjY</video:player_loc><video:duration>1471</video:duration><video:publication_date>2026-04-07T04:54:13.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/advanced-techniques/introduction</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/NCr27WYjCH4/hqdefault.jpg</video:thumbnail_loc><video:title>Introduction | Meet In The Middle (MITM) | Concepts &amp; Questions - 1 | codestorywithMIK</video:title><video:description>Introduction | Meet In The Middle (MITM) | Concepts &amp; Questions - 1 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/NCr27WYjCH4</video:player_loc><video:duration>3288</video:duration><video:publication_date>2026-07-15T09:02:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/advanced-techniques/cses-1628-meet-in-the-middle</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YWKib1hflGg/hqdefault.jpg</video:thumbnail_loc><video:title>CSES 1628 - Meet In The Middle | MITM | Concepts &amp; Questions - 2 | codestorywithMIK</video:title><video:description>CSES 1628 - Meet In The Middle | MITM | Concepts &amp; Questions - 2 | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YWKib1hflGg</video:player_loc><video:duration>2155</video:duration><video:publication_date>2026-07-18T19:25:52.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/advanced-techniques/closest-subsequence-sum-leetcode-1755</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/N5Tnm9v-wuk/hqdefault.jpg</video:thumbnail_loc><video:title>Closest Subsequence Sum | Leetcode 1755 | Meet In The Middle | MITM | Concepts &amp; Questions - 3 | MIK</video:title><video:description>Closest Subsequence Sum | Leetcode 1755 | Meet In The Middle | MITM | Concepts &amp; Questions - 3 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/N5Tnm9v-wuk</video:player_loc><video:duration>1569</video:duration><video:publication_date>2026-07-19T14:16:41.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/advanced-techniques/partition-array-into-two-arrays-to-minimize-sum-difference-leetcode-2035</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/tCoxxtYG2k8/hqdefault.jpg</video:thumbnail_loc><video:title>Partition Array Into Two Arrays to Minimize Sum Difference | Leetcode 2035 | MITM | Concepts Qn - 4</video:title><video:description>Partition Array Into Two Arrays to Minimize Sum Difference | Leetcode 2035 | MITM | Concepts Qn - 4. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/tCoxxtYG2k8</video:player_loc><video:duration>3089</video:duration><video:publication_date>2026-07-26T15:55:51.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/dsa/advanced-techniques/split-array-with-same-average-leetcode-805</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/KmsHhgkCrXg/hqdefault.jpg</video:thumbnail_loc><video:title>Split Array With Same Average | Leetcode 805 | Meet In The Middle | Concepts &amp; Questions - 5 | MIK</video:title><video:description>Split Array With Same Average | Leetcode 805 | Meet In The Middle | Concepts &amp; Questions - 5 | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/KmsHhgkCrXg</video:player_loc><video:duration>2770</video:duration><video:publication_date>2026-08-01T12:32:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/back-of-the-envelope-estimation</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/juCeZCZgWZU/hqdefault.jpg</video:thumbnail_loc><video:title>Back-Of-The-Envelope-Estimation 🕵️📈📏📁</video:title><video:description>Back-Of-The-Envelope-Estimation 🕵️📈📏📁. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/juCeZCZgWZU</video:player_loc><video:duration>564</video:duration><video:publication_date>2022-06-11T03:29:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/twitter-qps-and-storage-estimation</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/kb8sH4MWjpc/hqdefault.jpg</video:thumbnail_loc><video:title>Twitter QPS &amp; Storage Estimation 🐦🔎📀</video:title><video:description>Twitter QPS &amp; Storage Estimation 🐦🔎📀. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/kb8sH4MWjpc</video:player_loc><video:duration>461</video:duration><video:publication_date>2022-06-12T04:14:53.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/system-design-interview-red-flags-and-myths</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/zbB7S39MqkQ/hqdefault.jpg</video:thumbnail_loc><video:title>System Design Interview : 🚩 Red Flags &amp; Myths 💥🤯🫢</video:title><video:description>System Design Interview : 🚩 Red Flags &amp; Myths 💥🤯🫢. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/zbB7S39MqkQ</video:player_loc><video:duration>368</video:duration><video:publication_date>2022-06-13T06:56:49.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-news-feed-system-step-1-of-4</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/L20bYFvdt6s/hqdefault.jpg</video:thumbnail_loc><video:title>Design News Feed System : step-1 of 4</video:title><video:description>Design News Feed System : step-1 of 4. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/L20bYFvdt6s</video:player_loc><video:duration>449</video:duration><video:publication_date>2022-06-14T13:19:34.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-news-feed-system-step-2-of-4</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/vKIU7jrlJh8/hqdefault.jpg</video:thumbnail_loc><video:title>Design News Feed System : step-2 of 4</video:title><video:description>Design News Feed System : step-2 of 4. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/vKIU7jrlJh8</video:player_loc><video:duration>433</video:duration><video:publication_date>2022-06-15T03:16:41.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-news-feed-system-step-3-of-4</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/dVs8l2O-9-o/hqdefault.jpg</video:thumbnail_loc><video:title>Design News Feed System : step-3 of 4</video:title><video:description>Design News Feed System : step-3 of 4. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/dVs8l2O-9-o</video:player_loc><video:duration>460</video:duration><video:publication_date>2022-06-16T14:06:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-news-feed-system-step-4-of-4</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/05QLDkf4JQU/hqdefault.jpg</video:thumbnail_loc><video:title>Design News Feed System : Step 4 of 4</video:title><video:description>Design News Feed System : Step 4 of 4. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/05QLDkf4JQU</video:player_loc><video:duration>370</video:duration><video:publication_date>2022-06-18T02:23:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-rate-limiter-what-is-it</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/-F4DmMT0sY0/hqdefault.jpg</video:thumbnail_loc><video:title>Design Rate Limiter : What is it ❓🤨📈</video:title><video:description>Design Rate Limiter : What is it ❓🤨📈. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/-F4DmMT0sY0</video:player_loc><video:duration>296</video:duration><video:publication_date>2022-06-18T05:32:55.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-rate-limiter-step-1-of-4</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/oYEpUThjm4Q/hqdefault.jpg</video:thumbnail_loc><video:title>Design Rate Limiter : step-1 of 4 📈📏⚙️🏗</video:title><video:description>Design Rate Limiter : step-1 of 4 📈📏⚙️🏗. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/oYEpUThjm4Q</video:player_loc><video:duration>334</video:duration><video:publication_date>2022-06-19T03:33:41.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-rate-limiter-step-2-of-4-part-i-where-to-put-rate-limiter</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9CtwF7CdY34/hqdefault.jpg</video:thumbnail_loc><video:title>Design Rate Limiter : Step-2 of 4 (PART-I) - Where To Put Rate Limiter</video:title><video:description>Design Rate Limiter : Step-2 of 4 (PART-I) - Where To Put Rate Limiter. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9CtwF7CdY34</video:player_loc><video:duration>321</video:duration><video:publication_date>2022-06-20T05:17:51.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-rate-limiter-step-2-of-4-part-2-token-bucket-algorithm</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YucmAlxbJ_Q/hqdefault.jpg</video:thumbnail_loc><video:title>Design Rate Limiter : step-2 of 4 (PART-2) - Token  Bucket Algorithm</video:title><video:description>Design Rate Limiter : step-2 of 4 (PART-2) - Token  Bucket Algorithm. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YucmAlxbJ_Q</video:player_loc><video:duration>546</video:duration><video:publication_date>2022-06-21T03:05:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-rate-limiter-step-2-of-4-part-3-leaky-bucket-algorithm</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/v1GnJ9r2WLY/hqdefault.jpg</video:thumbnail_loc><video:title>Design Rate Limiter : step-2 of 4 (PART-3) - Leaky Bucket Algorithm 🪣💦💧</video:title><video:description>Design Rate Limiter : step-2 of 4 (PART-3) - Leaky Bucket Algorithm 🪣💦💧. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/v1GnJ9r2WLY</video:player_loc><video:duration>343</video:duration><video:publication_date>2022-06-22T04:26:43.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-rate-limiter-step-2-of-4-part-iv-fixed-window-counter-algorithm</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/VA-uLSiwyZw/hqdefault.jpg</video:thumbnail_loc><video:title>Design Rate Limiter : step-2 of 4 (PART-IV) - Fixed Window Counter Algorithm 👩‍🔧🏗⚙️</video:title><video:description>Design Rate Limiter : step-2 of 4 (PART-IV) - Fixed Window Counter Algorithm 👩‍🔧🏗⚙️. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/VA-uLSiwyZw</video:player_loc><video:duration>672</video:duration><video:publication_date>2022-06-23T03:15:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-rate-limiter-step-2-of-4-part-v-sliding-window-log-algorithm</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/aTtcG6XabU8/hqdefault.jpg</video:thumbnail_loc><video:title>Design Rate Limiter : step-2 of 4 (PART-V) - Sliding Window Log Algorithm</video:title><video:description>Design Rate Limiter : step-2 of 4 (PART-V) - Sliding Window Log Algorithm. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/aTtcG6XabU8</video:player_loc><video:duration>546</video:duration><video:publication_date>2022-06-24T04:39:56.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-rate-limiter-step-2-of-4-part-vi-high-level-architecture</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/FXOT3kBqho8/hqdefault.jpg</video:thumbnail_loc><video:title>Design Rate Limiter : step-2 of 4 (PART-VI) - High Level Architecture</video:title><video:description>Design Rate Limiter : step-2 of 4 (PART-VI) - High Level Architecture. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/FXOT3kBqho8</video:player_loc><video:duration>366</video:duration><video:publication_date>2022-06-25T06:27:58.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-rate-limiter-step-3-of-4-part-i-design-deep-dive-and-lyft</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/APayGQDMIwo/hqdefault.jpg</video:thumbnail_loc><video:title>Design Rate Limiter : step-3 of 4 (PART-I) - Design Deep Dive &amp; LYFT 🚕🚖</video:title><video:description>Design Rate Limiter : step-3 of 4 (PART-I) - Design Deep Dive &amp; LYFT 🚕🚖. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/APayGQDMIwo</video:player_loc><video:duration>479</video:duration><video:publication_date>2022-06-26T05:08:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-rate-limiter-step-3-part-ii-detailed-design</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/n44TxyNE2FM/hqdefault.jpg</video:thumbnail_loc><video:title>Design Rate Limiter : step-3 (PART-II) - Detailed Design 🕵️🔎⚙️🏗</video:title><video:description>Design Rate Limiter : step-3 (PART-II) - Detailed Design 🕵️🔎⚙️🏗. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/n44TxyNE2FM</video:player_loc><video:duration>504</video:duration><video:publication_date>2022-06-27T03:46:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-rate-limiter-step-3-of-4-part-iii-rate-limiter-in-distributed-environment</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8YRA2MzYVx8/hqdefault.jpg</video:thumbnail_loc><video:title>Design Rate Limiter : step-3 of 4 (PART-III) - Rate Limiter in  Distributed Environment ⚙️🏗🤯</video:title><video:description>Design Rate Limiter : step-3 of 4 (PART-III) - Rate Limiter in  Distributed Environment ⚙️🏗🤯. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8YRA2MzYVx8</video:player_loc><video:duration>385</video:duration><video:publication_date>2022-06-28T04:06:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-rate-limiter-step-3-of-4-part-iv-performance-optimisation-and-monitoring</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/fO13OloW6UU/hqdefault.jpg</video:thumbnail_loc><video:title>Design Rate Limiter - step-3 of 4 (PART-IV) - Performance Optimisation &amp; Monitoring</video:title><video:description>Design Rate Limiter - step-3 of 4 (PART-IV) - Performance Optimisation &amp; Monitoring. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/fO13OloW6UU</video:player_loc><video:duration>268</video:duration><video:publication_date>2022-06-29T18:01:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-rate-limiter-step-4-of-4-wrap-up</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/mJ2pK2tKs5U/hqdefault.jpg</video:thumbnail_loc><video:title>Design Rate Limiter - step-4 of 4 - WRAP UP</video:title><video:description>Design Rate Limiter - step-4 of 4 - WRAP UP. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/mJ2pK2tKs5U</video:player_loc><video:duration>210</video:duration><video:publication_date>2022-06-30T04:56:53.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-consistent-hashing-whats-the-problem-why-need-it</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9_yhj2foAe8/hqdefault.jpg</video:thumbnail_loc><video:title>Design Consistent Hashing - What’s the problem ? Why need it ? #️⃣🕵️</video:title><video:description>Design Consistent Hashing - What’s the problem ? Why need it ? #️⃣🕵️. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9_yhj2foAe8</video:player_loc><video:duration>508</video:duration><video:publication_date>2022-07-03T05:29:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-consistent-hashing-how-it-works</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Ao7ddTg3Gew/hqdefault.jpg</video:thumbnail_loc><video:title>Design Consistent Hashing - How It Works ? #️⃣🏗</video:title><video:description>Design Consistent Hashing - How It Works ? #️⃣🏗. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Ao7ddTg3Gew</video:player_loc><video:duration>567</video:duration><video:publication_date>2022-07-03T17:35:35.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-consistent-hashing-two-problems-with-basic-approach</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QMp5YUVNues/hqdefault.jpg</video:thumbnail_loc><video:title>Design Consistent Hashing - Two Problems with Basic Approach 🤯#️⃣🕵🏻</video:title><video:description>Design Consistent Hashing - Two Problems with Basic Approach 🤯#️⃣🕵🏻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QMp5YUVNues</video:player_loc><video:duration>384</video:duration><video:publication_date>2022-07-05T03:45:17.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-consistent-hashing-virtual-nodes</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/lJGKum53sQk/hqdefault.jpg</video:thumbnail_loc><video:title>Design Consistent Hashing - Virtual Nodes ￼#️⃣🤯🕵🏻</video:title><video:description>Design Consistent Hashing - Virtual Nodes ￼#️⃣🤯🕵🏻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/lJGKum53sQk</video:player_loc><video:duration>561</video:duration><video:publication_date>2022-07-06T00:30:18.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-consistent-hashing-wrap-up</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/PkEiuHDkFW4/hqdefault.jpg</video:thumbnail_loc><video:title>Design Consistent Hashing - Wrap Up #️⃣🥳🤩</video:title><video:description>Design Consistent Hashing - Wrap Up #️⃣🥳🤩. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/PkEiuHDkFW4</video:player_loc><video:duration>150</video:duration><video:publication_date>2022-07-07T04:55:57.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-key-value-store-part-i</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/iq2gWDSN9tc/hqdefault.jpg</video:thumbnail_loc><video:title>Design Key-Value Store - (Part-I)</video:title><video:description>Design Key-Value Store - (Part-I). Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/iq2gWDSN9tc</video:player_loc><video:duration>391</video:duration><video:publication_date>2022-07-08T14:09:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-key-value-store-part-ii-single-server-key-value-store</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Akgj2cq654Y/hqdefault.jpg</video:thumbnail_loc><video:title>Design Key-Value Store - (PART-II) : Single Server Key-Value Store 🏗⚙️💻💿</video:title><video:description>Design Key-Value Store - (PART-II) : Single Server Key-Value Store 🏗⚙️💻💿. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Akgj2cq654Y</video:player_loc><video:duration>175</video:duration><video:publication_date>2022-07-09T06:42:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-key-value-store-part-iii-distributed-key-value-store-and-cap-theorem</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/-Kqs9l15KEk/hqdefault.jpg</video:thumbnail_loc><video:title>Design Key-Value Store - (PART-III) : Distributed Key-Value Store and CAP Theorem 🤯</video:title><video:description>Design Key-Value Store - (PART-III) : Distributed Key-Value Store and CAP Theorem 🤯. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/-Kqs9l15KEk</video:player_loc><video:duration>701</video:duration><video:publication_date>2022-07-11T07:58:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-key-value-store-part-iv-data-partition-and-data-replication</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/d8rYe8Rhl-k/hqdefault.jpg</video:thumbnail_loc><video:title>Design Key-Value Store - (PART-IV) : Data Partition &amp; Data Replication  💿⚙️🏗</video:title><video:description>Design Key-Value Store - (PART-IV) : Data Partition &amp; Data Replication  💿⚙️🏗. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/d8rYe8Rhl-k</video:player_loc><video:duration>592</video:duration><video:publication_date>2022-07-12T23:30:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-key-value-store-part-v-consistency-quorum-tunable-consistency</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/JhSUxp4vms0/hqdefault.jpg</video:thumbnail_loc><video:title>Design Key-Value Store - (PART-V) : Consistency, Quorum, Tunable Consistency 😱🤯⚙️</video:title><video:description>Design Key-Value Store - (PART-V) : Consistency, Quorum, Tunable Consistency 😱🤯⚙️. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/JhSUxp4vms0</video:player_loc><video:duration>1076</video:duration><video:publication_date>2022-07-14T23:30:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-key-value-store-part-vi-inconsistency-resolution-and-vector-clocks</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/mOYrcx-iM0I/hqdefault.jpg</video:thumbnail_loc><video:title>Design Key-Value Store - (PART-VI) : Inconsistency Resolution and Vector Clocks😱🤯⚙️</video:title><video:description>Design Key-Value Store - (PART-VI) : Inconsistency Resolution and Vector Clocks😱🤯⚙️. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/mOYrcx-iM0I</video:player_loc><video:duration>795</video:duration><video:publication_date>2022-07-19T03:32:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-key-value-store-part-vii-handling-temporary-failures</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Z_ql8kHQg7U/hqdefault.jpg</video:thumbnail_loc><video:title>Design Key-Value Store - (PART-VII) : Handling Temporary Failures | Gossip Protocol | Hinted 🤯😱🏗</video:title><video:description>Design Key-Value Store - (PART-VII) : Handling Temporary Failures | Gossip Protocol | Hinted 🤯😱🏗. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Z_ql8kHQg7U</video:player_loc><video:duration>684</video:duration><video:publication_date>2022-07-23T06:34:41.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-key-value-store-part-viii-handling-permanent-failures</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/VyLur6btuaU/hqdefault.jpg</video:thumbnail_loc><video:title>Design Key-Value Store - (PART-VIII) : Handling Permanent Failures | Anti-Entropy | Merkle Tree😱</video:title><video:description>Design Key-Value Store - (PART-VIII) : Handling Permanent Failures | Anti-Entropy | Merkle Tree😱. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/VyLur6btuaU</video:player_loc><video:duration>555</video:duration><video:publication_date>2022-07-26T23:30:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-key-value-store-part-ix-system-architecture-diagram</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/yFOX1B1-lns/hqdefault.jpg</video:thumbnail_loc><video:title>Design Key-Value Store - (PART-IX) : System Architecture Diagram 😱⚙️🏗👩‍🎨👷👷‍♀️</video:title><video:description>Design Key-Value Store - (PART-IX) : System Architecture Diagram 😱⚙️🏗👩‍🎨👷👷‍♀️. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/yFOX1B1-lns</video:player_loc><video:duration>444</video:duration><video:publication_date>2022-07-28T23:30:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-key-value-store-part-x-read-path-and-write-path</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/BBusgoFERKA/hqdefault.jpg</video:thumbnail_loc><video:title>Design Key-Value Store - (PART-X) : Read Path &amp; Write Path⚙️🧑🏻‍💻👷🏗👩‍🎨</video:title><video:description>Design Key-Value Store - (PART-X) : Read Path &amp; Write Path⚙️🧑🏻‍💻👷🏗👩‍🎨. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/BBusgoFERKA</video:player_loc><video:duration>510</video:duration><video:publication_date>2022-07-29T23:30:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-a-unique-id-generator-in-distributed-systems-part-i-understand-the</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/DLu6GekSeow/hqdefault.jpg</video:thumbnail_loc><video:title>Design A Unique ID Generator In Distributed  Systems - (Part-I) : Understand The Problem  🏗👷👩🏻‍�</video:title><video:description>Design A Unique ID Generator In Distributed  Systems - (Part-I) : Understand The Problem  🏗👷👩🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/DLu6GekSeow</video:player_loc><video:duration>316</video:duration><video:publication_date>2022-08-01T23:30:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-a-unique-id-generator-in-distributed-systems-part-ii-multi-master</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/w71BMp9Idgo/hqdefault.jpg</video:thumbnail_loc><video:title>Design A Unique ID Generator In Distributed  Systems (Part-II): Multi Master Replication 🏗👷👩🏻‍💻</video:title><video:description>Design A Unique ID Generator In Distributed  Systems (Part-II): Multi Master Replication 🏗👷👩🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/w71BMp9Idgo</video:player_loc><video:duration>388</video:duration><video:publication_date>2022-08-08T23:30:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-a-unique-id-generator-in-distributed-systems-part-iii-uuid</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/bBGt2_H71_M/hqdefault.jpg</video:thumbnail_loc><video:title>Design A Unique ID Generator In Distributed Systems (Part-III): UUID 🏗👷👩🏻‍💻</video:title><video:description>Design A Unique ID Generator In Distributed Systems (Part-III): UUID 🏗👷👩🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/bBGt2_H71_M</video:player_loc><video:duration>272</video:duration><video:publication_date>2022-08-10T23:30:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-a-unique-id-generator-in-distributed-systems-part-iv-ticket-server</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/89ky2JarwOI/hqdefault.jpg</video:thumbnail_loc><video:title>Design A Unique ID Generator In Distributed Systems (Part-IV): Ticket Server 🏗👷👩🏻‍💻</video:title><video:description>Design A Unique ID Generator In Distributed Systems (Part-IV): Ticket Server 🏗👷👩🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/89ky2JarwOI</video:player_loc><video:duration>271</video:duration><video:publication_date>2022-08-13T08:10:58.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-a-unique-id-generator-in-distributed-systems-part-v-twitter-snowflake</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/jpdVmAPY0wM/hqdefault.jpg</video:thumbnail_loc><video:title>Design A Unique ID Generator In Distributed Systems (Part-V): Twitter Snowflake Approach 🏗👷👩🏻‍💻</video:title><video:description>Design A Unique ID Generator In Distributed Systems (Part-V): Twitter Snowflake Approach 🏗👷👩🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/jpdVmAPY0wM</video:player_loc><video:duration>358</video:duration><video:publication_date>2022-08-15T11:23:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-a-unique-id-generator-in-distributed-systems-part-vi-design-deep-dive</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/LdKWggpy6Bk/hqdefault.jpg</video:thumbnail_loc><video:title>Design A Unique ID Generator In Distributed Systems (Part-VI): Design Deep Dive 🏗👷👩🏻‍💻</video:title><video:description>Design A Unique ID Generator In Distributed Systems (Part-VI): Design Deep Dive 🏗👷👩🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/LdKWggpy6Bk</video:player_loc><video:duration>342</video:duration><video:publication_date>2022-08-17T04:25:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-a-unique-id-generator-in-distributed-systems-part-vii-wrap-up</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/7aJVflnGnE4/hqdefault.jpg</video:thumbnail_loc><video:title>Design A Unique ID Generator In Distributed Systems (Part-VII): Wrap Up !!! 🏗👷👩🏻‍💻</video:title><video:description>Design A Unique ID Generator In Distributed Systems (Part-VII): Wrap Up !!! 🏗👷👩🏻‍💻. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/7aJVflnGnE4</video:player_loc><video:duration>228</video:duration><video:publication_date>2022-08-19T15:29:23.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-a-url-shortener-part-i-step-1-understand-the-problem-and-establish</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/I_GsnhGtjWA/hqdefault.jpg</video:thumbnail_loc><video:title>Design A URL Shortener (Part-I): Step-1 (Understand The Problem &amp; Establish Design Scope) !!! 🏗⚙️👷</video:title><video:description>Design A URL Shortener (Part-I): Step-1 (Understand The Problem &amp; Establish Design Scope) !!! 🏗⚙️👷. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/I_GsnhGtjWA</video:player_loc><video:duration>359</video:duration><video:publication_date>2022-08-26T15:51:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-a-url-shortener-part-ii-back-of-the-envelope-estimation</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/nibQgCh65RA/hqdefault.jpg</video:thumbnail_loc><video:title>Design A URL Shortener (Part-II): Back Of The Envelope Estimation !!! 🏗⚙️👷</video:title><video:description>Design A URL Shortener (Part-II): Back Of The Envelope Estimation !!! 🏗⚙️👷. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/nibQgCh65RA</video:player_loc><video:duration>427</video:duration><video:publication_date>2022-08-27T15:56:59.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-a-url-shortener-part-iii-step-2-propose-high-level-design-and-get-buy-in</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Hb-WRt5MFqs/hqdefault.jpg</video:thumbnail_loc><video:title>Design A URL Shortener (Part-III): STEP-2 : Propose High Level Design &amp; Get Buy-In  !!! 🏗⚙️👷</video:title><video:description>Design A URL Shortener (Part-III): STEP-2 : Propose High Level Design &amp; Get Buy-In  !!! 🏗⚙️👷. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Hb-WRt5MFqs</video:player_loc><video:duration>424</video:duration><video:publication_date>2022-08-30T15:17:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-a-url-shortener-part-iv-step-2-301-redirect-vs-302-redirect-status-code</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/JwPxohKcbLE/hqdefault.jpg</video:thumbnail_loc><video:title>Design A URL Shortener (Part-IV): STEP-2 : 301 Redirect Vs 302 Redirect Status Code !!! 🏗⚙️👷</video:title><video:description>Design A URL Shortener (Part-IV): STEP-2 : 301 Redirect Vs 302 Redirect Status Code !!! 🏗⚙️👷. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/JwPxohKcbLE</video:player_loc><video:duration>466</video:duration><video:publication_date>2022-09-01T15:32:23.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-a-url-shortener-part-v-step-2-url-shortening-hash-function</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/A8ymGwoBefQ/hqdefault.jpg</video:thumbnail_loc><video:title>Design A URL Shortener (Part-V): STEP-2 : URL SHORTENING (HASH FUNCTION) !!! 🏗⚙️👷</video:title><video:description>Design A URL Shortener (Part-V): STEP-2 : URL SHORTENING (HASH FUNCTION) !!! 🏗⚙️👷. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/A8ymGwoBefQ</video:player_loc><video:duration>235</video:duration><video:publication_date>2022-09-05T17:21:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-a-url-shortener-part-vi-step-3-design-deep-dive-data-model</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/BGPLqtNMxIw/hqdefault.jpg</video:thumbnail_loc><video:title>Design A URL Shortener (Part-VI): STEP-3 : DESIGN DEEP DIVE (DATA MODEL) !!! 🏗⚙️👷</video:title><video:description>Design A URL Shortener (Part-VI): STEP-3 : DESIGN DEEP DIVE (DATA MODEL) !!! 🏗⚙️👷. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/BGPLqtNMxIw</video:player_loc><video:duration>238</video:duration><video:publication_date>2022-09-11T13:49:29.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-a-url-shortener-part-vii-step-3-design-deep-dive-hash-function</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/_NCB1v1paII/hqdefault.jpg</video:thumbnail_loc><video:title>Design A URL Shortener (Part-VII): STEP-3 : DESIGN DEEP DIVE (HASH FUNCTION) !!! 🏗⚙️👷</video:title><video:description>Design A URL Shortener (Part-VII): STEP-3 : DESIGN DEEP DIVE (HASH FUNCTION) !!! 🏗⚙️👷. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/_NCB1v1paII</video:player_loc><video:duration>304</video:duration><video:publication_date>2022-09-19T04:18:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-a-url-shortener-part-viii-step-3-design-deep-dive-hash-collision</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/xFO-MNrwwP8/hqdefault.jpg</video:thumbnail_loc><video:title>Design A URL Shortener (Part-VIII): STEP-3 : DESIGN DEEP DIVE (HASH + COLLISION RESOLUTION) 🏗⚙️👷</video:title><video:description>Design A URL Shortener (Part-VIII): STEP-3 : DESIGN DEEP DIVE (HASH + COLLISION RESOLUTION) 🏗⚙️👷. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/xFO-MNrwwP8</video:player_loc><video:duration>440</video:duration><video:publication_date>2022-09-20T16:44:56.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-a-url-shortener-part-ix-step-3-design-deep-dive-base-62-conversion</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/S9Lu7bEVkAY/hqdefault.jpg</video:thumbnail_loc><video:title>Design A URL Shortener (Part-IX): STEP-3 : DESIGN DEEP DIVE (BASE-62 CONVERSION) 🏗⚙️👷</video:title><video:description>Design A URL Shortener (Part-IX): STEP-3 : DESIGN DEEP DIVE (BASE-62 CONVERSION) 🏗⚙️👷. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/S9Lu7bEVkAY</video:player_loc><video:duration>748</video:duration><video:publication_date>2022-09-22T17:47:23.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-a-url-shortener-part-x-step-3-design-deep-dive-url-shortening-flow</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5wuR0TQDBng/hqdefault.jpg</video:thumbnail_loc><video:title>Design A URL Shortener (Part-X): STEP-3 : DESIGN DEEP DIVE (URL SHORTENING FLOW) 🏗⚙️👷</video:title><video:description>Design A URL Shortener (Part-X): STEP-3 : DESIGN DEEP DIVE (URL SHORTENING FLOW) 🏗⚙️👷. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5wuR0TQDBng</video:player_loc><video:duration>411</video:duration><video:publication_date>2022-09-25T17:08:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-a-url-shortener-part-xi-step-3-and-4-design-deep-dive-and-wrap-up-url</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QfJSU_yLQzw/hqdefault.jpg</video:thumbnail_loc><video:title>Design A URL Shortener (Part-XI): STEP-3&amp;4 : DESIGN DEEP DIVE &amp; WRAP UP (URL Redirecting Deep Dive)</video:title><video:description>Design A URL Shortener (Part-XI): STEP-3&amp;4 : DESIGN DEEP DIVE &amp; WRAP UP (URL Redirecting Deep Dive). Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QfJSU_yLQzw</video:player_loc><video:duration>621</video:duration><video:publication_date>2022-09-27T02:30:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-web-crawler-part-i-google-step-1-understand-the-problem-and-establish</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Cuc0mNJs1iU/hqdefault.jpg</video:thumbnail_loc><video:title>Design Web Crawler (Part-I): (Google) : STEP-1 : Understand The Problem &amp; Establish Design Scope</video:title><video:description>Design Web Crawler (Part-I): (Google) : STEP-1 : Understand The Problem &amp; Establish Design Scope. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Cuc0mNJs1iU</video:player_loc><video:duration>549</video:duration><video:publication_date>2022-10-06T02:30:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-web-crawler-part-ii-google-amazon-meta-step-1-back-of-the-envelope</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5Jas626WgJg/hqdefault.jpg</video:thumbnail_loc><video:title>Design Web Crawler (Part-II) : Google, Amazon, Meta: STEP-1 : Back Of The Envelope Estimation 🏗⚙️👷</video:title><video:description>Design Web Crawler (Part-II) : Google, Amazon, Meta: STEP-1 : Back Of The Envelope Estimation 🏗⚙️👷. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5Jas626WgJg</video:player_loc><video:duration>490</video:duration><video:publication_date>2022-10-07T03:32:49.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-web-crawler-part-iii-google-amazon-meta-step-2-propose-a-high-level</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/rolY9r4soAQ/hqdefault.jpg</video:thumbnail_loc><video:title>Design Web Crawler(Part-III):Google, Amazon, Meta: STEP-2 : Propose A High Level Design &amp; Get Buy-in</video:title><video:description>Design Web Crawler(Part-III):Google, Amazon, Meta: STEP-2 : Propose A High Level Design &amp; Get Buy-in. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/rolY9r4soAQ</video:player_loc><video:duration>1058</video:duration><video:publication_date>2022-10-08T13:03:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-web-crawler-part-iv-google-amazon-meta-step-3-design-deep-dive-bfs-vs-dfs</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/mE5yg_HcDuE/hqdefault.jpg</video:thumbnail_loc><video:title>Design Web Crawler (Part-IV) : Google, Amazon, Meta : STEP-3 : Design Deep Dive (BFS vs DFS) 🏗⚙️👷</video:title><video:description>Design Web Crawler (Part-IV) : Google, Amazon, Meta : STEP-3 : Design Deep Dive (BFS vs DFS) 🏗⚙️👷. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/mE5yg_HcDuE</video:player_loc><video:duration>567</video:duration><video:publication_date>2022-10-17T02:30:23.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-web-crawler-part-v-google-amazon-meta-step-3-design-deep-dive-url</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/fClDjOk8fFM/hqdefault.jpg</video:thumbnail_loc><video:title>Design Web Crawler (Part-V) : Google, Amazon, Meta : STEP-3 : Design Deep Dive (URL Frontier) 🏗⚙️👷</video:title><video:description>Design Web Crawler (Part-V) : Google, Amazon, Meta : STEP-3 : Design Deep Dive (URL Frontier) 🏗⚙️👷. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/fClDjOk8fFM</video:player_loc><video:duration>1181</video:duration><video:publication_date>2022-11-04T14:33:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/design-web-crawler-part-vi-google-amazon-meta-step-3-design-deep-dive-complete</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/hoD3uw5RX-U/hqdefault.jpg</video:thumbnail_loc><video:title>Design Web Crawler (Part-VI) : Google, Amazon, Meta : STEP-3 : Design Deep Dive Complete &amp; WRAP-UP</video:title><video:description>Design Web Crawler (Part-VI) : Google, Amazon, Meta : STEP-3 : Design Deep Dive Complete &amp; WRAP-UP. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/hoD3uw5RX-U</video:player_loc><video:duration>1924</video:duration><video:publication_date>2022-12-03T04:17:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/introduction-why-and-what</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ftwfCDc3IpE/hqdefault.jpg</video:thumbnail_loc><video:title>Introduction - Why &amp; what ?</video:title><video:description>Introduction - Why &amp; what ?. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ftwfCDc3IpE</video:player_loc><video:duration>116</video:duration><video:publication_date>2022-05-29T05:41:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/single-server-setup</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/j0oGDURDzsk/hqdefault.jpg</video:thumbnail_loc><video:title>Single Server Setup</video:title><video:description>Single Server Setup. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/j0oGDURDzsk</video:player_loc><video:duration>391</video:duration><video:publication_date>2022-05-29T06:59:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/database-and-multiple-servers</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/FMDUgOAOk14/hqdefault.jpg</video:thumbnail_loc><video:title>Database &amp; Multiple Servers</video:title><video:description>Database &amp; Multiple Servers. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/FMDUgOAOk14</video:player_loc><video:duration>250</video:duration><video:publication_date>2022-05-30T04:15:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/which-database-to-use</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QoHEAFGK-7Y/hqdefault.jpg</video:thumbnail_loc><video:title>Which Database to use ?</video:title><video:description>Which Database to use ?. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QoHEAFGK-7Y</video:player_loc><video:duration>419</video:duration><video:publication_date>2022-05-31T04:12:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/vertical-scaling-vs-horizontal-scaling</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/U5wenrkP-Zo/hqdefault.jpg</video:thumbnail_loc><video:title>Vertical Scaling vs Horizontal Scaling</video:title><video:description>Vertical Scaling vs Horizontal Scaling. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/U5wenrkP-Zo</video:player_loc><video:duration>275</video:duration><video:publication_date>2022-06-01T06:26:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/load-balancer</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/7WmDS4om_AE/hqdefault.jpg</video:thumbnail_loc><video:title>Load Balancer ⚖️</video:title><video:description>Load Balancer ⚖️. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/7WmDS4om_AE</video:player_loc><video:duration>293</video:duration><video:publication_date>2022-06-02T09:40:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/database-replication</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/VHqEnFS4qpw/hqdefault.jpg</video:thumbnail_loc><video:title>Database Replication 💿💿📚📖📒</video:title><video:description>Database Replication 💿💿📚📖📒. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/VHqEnFS4qpw</video:player_loc><video:duration>450</video:duration><video:publication_date>2022-06-03T04:27:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/caching</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Q4INr5u6r58/hqdefault.jpg</video:thumbnail_loc><video:title>Caching</video:title><video:description>Caching. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Q4INr5u6r58</video:player_loc><video:duration>433</video:duration><video:publication_date>2022-06-04T15:57:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/cdn-content-delivery-network</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/D_ZcZLosnck/hqdefault.jpg</video:thumbnail_loc><video:title>CDN (Content Delivery Network) 🚚📦</video:title><video:description>CDN (Content Delivery Network) 🚚📦. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/D_ZcZLosnck</video:player_loc><video:duration>477</video:duration><video:publication_date>2022-06-05T06:08:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/stateful-and-stateless-architecture</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Sn18rLefS-4/hqdefault.jpg</video:thumbnail_loc><video:title>Stateful &amp; Stateless Architecture 👷🏗</video:title><video:description>Stateful &amp; Stateless Architecture 👷🏗. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Sn18rLefS-4</video:player_loc><video:duration>529</video:duration><video:publication_date>2022-06-06T04:09:51.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/data-centers-and-geodns</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/WAZHbxEKOZU/hqdefault.jpg</video:thumbnail_loc><video:title>Data Centers &amp; geoDNS</video:title><video:description>Data Centers &amp; geoDNS. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/WAZHbxEKOZU</video:player_loc><video:duration>360</video:duration><video:publication_date>2022-06-06T16:41:59.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/message-queue</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Fa0IfmukPBU/hqdefault.jpg</video:thumbnail_loc><video:title>Message Queue</video:title><video:description>Message Queue. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Fa0IfmukPBU</video:player_loc><video:duration>519</video:duration><video:publication_date>2022-06-08T01:38:21.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/logging-metric-automation</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/LxgV988RXX0/hqdefault.jpg</video:thumbnail_loc><video:title>Logging, Metric, Automation 🤖⚙️</video:title><video:description>Logging, Metric, Automation 🤖⚙️. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/LxgV988RXX0</video:player_loc><video:duration>462</video:duration><video:publication_date>2022-06-09T09:16:35.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/database-scaling-sharding-and-justin-bieber-problem</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/dIfFFUmJ2lA/hqdefault.jpg</video:thumbnail_loc><video:title>Database Scaling, Sharding &amp; Justin Bieber Problem 🧑‍🎤💿</video:title><video:description>Database Scaling, Sharding &amp; Justin Bieber Problem 🧑‍🎤💿. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/dIfFFUmJ2lA</video:player_loc><video:duration>788</video:duration><video:publication_date>2022-06-10T16:58:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/system-design/fundamentals/normalization-vs-denormalization-in-rdbms</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/3AMj_E24NK0/hqdefault.jpg</video:thumbnail_loc><video:title>Normalization vs Denormalization in RDBMS | Examples | Tables | SQL Query | codestorywithMIK</video:title><video:description>Normalization vs Denormalization in RDBMS | Examples | Tables | SQL Query | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/3AMj_E24NK0</video:player_loc><video:duration>1059</video:duration><video:publication_date>2024-01-18T16:37:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/ai/ai-fundamentals/chatgpt-isnt-magic-the-simplest-llm-explanation-ever</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/fMHGSx8B9gs/hqdefault.jpg</video:thumbnail_loc><video:title>ChatGPT isn&apos;t Magic: The Simplest LLM Explanation Ever | AI Fundamentals Decoded | codestorywithMIK</video:title><video:description>ChatGPT isn&apos;t Magic: The Simplest LLM Explanation Ever | AI Fundamentals Decoded | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/fMHGSx8B9gs</video:player_loc><video:duration>331</video:duration><video:publication_date>2026-09-12T13:07:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/ai/ai-fundamentals/ai-cant-read-words</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/NnUZLEVSaLk/hqdefault.jpg</video:thumbnail_loc><video:title>AI Can&apos;t Read Words | What Tokens Actually Are | AI Fundamentals Decoded | codestorywithMIK</video:title><video:description>AI Can&apos;t Read Words | What Tokens Actually Are | AI Fundamentals Decoded | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/NnUZLEVSaLk</video:player_loc><video:duration>397</video:duration><video:publication_date>2026-09-13T11:30:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/ai/ai-fundamentals/how-ai-actually-understands-meaning</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/pnCGqI7Cfcs/hqdefault.jpg</video:thumbnail_loc><video:title>How AI Actually Understands Meaning | What Are Embeddings? | AI Fundamentals Decoded | MIK</video:title><video:description>How AI Actually Understands Meaning | What Are Embeddings? | AI Fundamentals Decoded | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/pnCGqI7Cfcs</video:player_loc><video:duration>632</video:duration><video:publication_date>2026-09-14T11:47:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/ai/ai-fundamentals/where-does-ai-store-its-memories</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/RRCBHAIPXSk/hqdefault.jpg</video:thumbnail_loc><video:title>Where Does AI Store Its Memories? | What is a Vector Database? | AI Fundamentals Decoded | MIK</video:title><video:description>Where Does AI Store Its Memories? | What is a Vector Database? | AI Fundamentals Decoded | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/RRCBHAIPXSk</video:player_loc><video:duration>419</video:duration><video:publication_date>2026-09-15T11:39:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/ai/ai-fundamentals/how-to-give-chatgpt-your-private-data</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/3ViPZOMSBsI/hqdefault.jpg</video:thumbnail_loc><video:title>How to Give ChatGPT Your Private Data | What is RAG? | AI Fundamentals Decoded | codestorywithMIK</video:title><video:description>How to Give ChatGPT Your Private Data | What is RAG? | AI Fundamentals Decoded | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/3ViPZOMSBsI</video:player_loc><video:duration>546</video:duration><video:publication_date>2026-09-16T12:13:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/ai/ai-fundamentals/whats-actually-inside-an-llm</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/nZ7BX18UqQQ/hqdefault.jpg</video:thumbnail_loc><video:title>What’s Actually Inside an LLM? | The Transformer Explained | AI Fundamentals Decoded | MIK</video:title><video:description>What’s Actually Inside an LLM? | The Transformer Explained | AI Fundamentals Decoded | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/nZ7BX18UqQQ</video:player_loc><video:duration>605</video:duration><video:publication_date>2026-09-17T11:09:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/ai/ai-fundamentals/how-transformers-actually-think-query-key-and-value-q-k-v</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/RObFfdAPFR8/hqdefault.jpg</video:thumbnail_loc><video:title>How Transformers Actually Think: Query, Key &amp; Value (Q, K, V) | AI Fundamentals Decoded | MIK</video:title><video:description>How Transformers Actually Think: Query, Key &amp; Value (Q, K, V) | AI Fundamentals Decoded | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/RObFfdAPFR8</video:player_loc><video:duration>757</video:duration><video:publication_date>2026-09-18T12:44:43.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/ai/ai-fundamentals/why-self-attention-is-slow</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/r_zb6O05_2Q/hqdefault.jpg</video:thumbnail_loc><video:title>Why Self-Attention is Slow | AI Fundamentals Decoded | codestorywithMIK</video:title><video:description>Why Self-Attention is Slow | AI Fundamentals Decoded | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/r_zb6O05_2Q</video:player_loc><video:duration>609</video:duration><video:publication_date>2026-09-19T10:30:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/ai/ai-fundamentals/why-cant-ai-remember-everything-the-truth-about-context-windows</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/puBoCy_RfbY/hqdefault.jpg</video:thumbnail_loc><video:title>Why Can&apos;t AI Remember Everything? The Truth About Context Windows | AI Fundamentals Decoded | MIK</video:title><video:description>Why Can&apos;t AI Remember Everything? The Truth About Context Windows | AI Fundamentals Decoded | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/puBoCy_RfbY</video:player_loc><video:duration>806</video:duration><video:publication_date>2026-09-20T10:30:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/ai/ai-fundamentals/what-are-parameters</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/dMoeiDMSWN8/hqdefault.jpg</video:thumbnail_loc><video:title>What are Parameters | The Real Meaning Behind Model Sizes | AI Fundamentals Decoded | MIK</video:title><video:description>What are Parameters | The Real Meaning Behind Model Sizes | AI Fundamentals Decoded | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/dMoeiDMSWN8</video:player_loc><video:duration>977</video:duration><video:publication_date>2026-09-21T14:29:49.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/ai/ai-fundamentals/how-ai-specializes-pre-training-vs-fine-tuning</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ekTZNRYB5ZQ/hqdefault.jpg</video:thumbnail_loc><video:title>How AI Specializes: Pre-training vs Fine-tuning | AI Fundamentals Decoded | codestorywithMIK</video:title><video:description>How AI Specializes: Pre-training vs Fine-tuning | AI Fundamentals Decoded | codestorywithMIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ekTZNRYB5ZQ</video:player_loc><video:duration>906</video:duration><video:publication_date>2026-09-23T13:53:38.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/ai/ai-fundamentals/why-ai-sometimes-makes-things-up</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ASDw6qiG6IQ/hqdefault.jpg</video:thumbnail_loc><video:title>Why AI Sometimes Makes Things Up | Inference, Temperature &amp; Hallucinations | AI Fundamentals Decoded</video:title><video:description>Why AI Sometimes Makes Things Up | Inference, Temperature &amp; Hallucinations | AI Fundamentals Decoded. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ASDw6qiG6IQ</video:player_loc><video:duration>766</video:duration><video:publication_date>2026-09-24T15:25:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/ai/ai-fundamentals/what-are-langchain-and-langgraph</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/H6hH8Bx3K0I/hqdefault.jpg</video:thumbnail_loc><video:title>What are LangChain &amp; LangGraph? | Why Real AI Apps Need Them | AI Fundamentals Decoded | MIK</video:title><video:description>What are LangChain &amp; LangGraph? | Why Real AI Apps Need Them | AI Fundamentals Decoded | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/H6hH8Bx3K0I</video:player_loc><video:duration>681</video:duration><video:publication_date>2026-10-08T10:56:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/ai/build-real-ai-projects/your-roadmap-to-master-advanced-ai</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/f0HBW-47wwU/hqdefault.jpg</video:thumbnail_loc><video:title>Your Roadmap to Master Advanced AI | What&apos;s Coming in This Playlist? | Advanced AI Playlist | MIK</video:title><video:description>Your Roadmap to Master Advanced AI | What&apos;s Coming in This Playlist? | Advanced AI Playlist | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/f0HBW-47wwU</video:player_loc><video:duration>676</video:duration><video:publication_date>2026-10-05T15:26:58.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/ai/build-real-ai-projects/complete-setup-for-ai-development</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8xQOyAxSqg8/hqdefault.jpg</video:thumbnail_loc><video:title>Complete Setup for AI Development | VS Code, Python, Ollama | Local LLM | Advanced AI Playlist | MIK</video:title><video:description>Complete Setup for AI Development | VS Code, Python, Ollama | Local LLM | Advanced AI Playlist | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8xQOyAxSqg8</video:player_loc><video:duration>2077</video:duration><video:publication_date>2026-10-07T15:46:13.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/ai/build-real-ai-projects/build-your-first-ai-assistant-in-python</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/gj3u7OxE0o0/hqdefault.jpg</video:thumbnail_loc><video:title>Build Your First AI Assistant in Python | OpenAI API Style | Deep Dive | Advanced AI Playlist | MIK</video:title><video:description>Build Your First AI Assistant in Python | OpenAI API Style | Deep Dive | Advanced AI Playlist | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/gj3u7OxE0o0</video:player_loc><video:duration>2081</video:duration><video:publication_date>2026-10-10T16:43:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/ai/build-real-ai-projects/make-your-ai-assistant-chat-continuously</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8EnFDW3LmvY/hqdefault.jpg</video:thumbnail_loc><video:title>Make Your AI Assistant Chat Continuously | Conversation Loop | Advanced AI Playlist | MIK</video:title><video:description>Make Your AI Assistant Chat Continuously | Conversation Loop | Advanced AI Playlist | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8EnFDW3LmvY</video:player_loc><video:duration>1607</video:duration><video:publication_date>2026-10-11T15:09:21.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/ai/build-real-ai-projects/give-your-ai-assistant-memory</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/uMyhG6usK2o/hqdefault.jpg</video:thumbnail_loc><video:title>Give Your AI Assistant Memory | Conversation History | Context Window | Advanced AI Playlist | MIK</video:title><video:description>Give Your AI Assistant Memory | Conversation History | Context Window | Advanced AI Playlist | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/uMyhG6usK2o</video:player_loc><video:duration>1597</video:duration><video:publication_date>2026-10-12T19:37:51.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/ai/build-real-ai-projects/give-your-ai-assistant-a-personality</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/JAn2cd6e-Jo/hqdefault.jpg</video:thumbnail_loc><video:title>Give Your AI Assistant a Personality | System Prompt | Prompt Engineering | Advanced AI Playlist</video:title><video:description>Give Your AI Assistant a Personality | System Prompt | Prompt Engineering | Advanced AI Playlist. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/JAn2cd6e-Jo</video:player_loc><video:duration>1459</video:duration><video:publication_date>2026-10-14T14:44:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/ai/build-real-ai-projects/make-your-ai-assistant-use-tools</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/yqy-nwsFG9M/hqdefault.jpg</video:thumbnail_loc><video:title>Make Your AI Assistant Use Tools | Tool Calling | Function Calling Explained | Advanced AI Playlist</video:title><video:description>Make Your AI Assistant Use Tools | Tool Calling | Function Calling Explained | Advanced AI Playlist. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/yqy-nwsFG9M</video:player_loc><video:duration>3140</video:duration><video:publication_date>2026-10-15T15:00:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/ai/build-real-ai-projects/tool-calling-with-parameters</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/XIu9qPeL6Ak/hqdefault.jpg</video:thumbnail_loc><video:title>Tool Calling With Parameters | Add a Weather API Tool to Your AI Assistant | Advanced AI Playlist</video:title><video:description>Tool Calling With Parameters | Add a Weather API Tool to Your AI Assistant | Advanced AI Playlist. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/XIu9qPeL6Ak</video:player_loc><video:duration>1095</video:duration><video:publication_date>2026-10-16T13:51:49.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/ai/build-real-ai-projects/chained-tool-calling</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/22C9W0-9TC8/hqdefault.jpg</video:thumbnail_loc><video:title>Chained Tool Calling | Agent Loop | Multi-Step Tool Calls &amp; Limitations | Advanced AI Playlist | MIK</video:title><video:description>Chained Tool Calling | Agent Loop | Multi-Step Tool Calls &amp; Limitations | Advanced AI Playlist | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/22C9W0-9TC8</video:player_loc><video:duration>2694</video:duration><video:publication_date>2026-10-18T15:38:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/ai/build-real-ai-projects/make-your-ai-agent-look-cool</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8JuYTUpG-5g/hqdefault.jpg</video:thumbnail_loc><video:title>Make your AI Agent Look Cool | Refactoring | Debug Logging | Bug Fixes | Advanced AI Playlist | MIK</video:title><video:description>Make your AI Agent Look Cool | Refactoring | Debug Logging | Bug Fixes | Advanced AI Playlist | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8JuYTUpG-5g</video:player_loc><video:duration>2580</video:duration><video:publication_date>2026-10-19T14:47:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/ai/build-real-ai-projects/make-your-ai-respond-word-by-word-like-chatgpt</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/otDELFAfSCM/hqdefault.jpg</video:thumbnail_loc><video:title>Make Your AI Respond Word by Word Like ChatGPT | LLM Streaming in Python | Advanced AI Playlist</video:title><video:description>Make Your AI Respond Word by Word Like ChatGPT | LLM Streaming in Python | Advanced AI Playlist. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/otDELFAfSCM</video:player_loc><video:duration>4114</video:duration><video:publication_date>2026-10-22T22:43:51.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/ai/build-real-ai-projects/add-streaming-to-your-ai-agent</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/V17i8aU7vL4/hqdefault.jpg</video:thumbnail_loc><video:title>Add Streaming to Your AI Agent |  Ctrl+C Handling Like Claude | Advanced AI Playlist | MIK</video:title><video:description>Add Streaming to Your AI Agent |  Ctrl+C Handling Like Claude | Advanced AI Playlist | MIK. Video lecture by codestorywithMIK on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/V17i8aU7vL4</video:player_loc><video:duration>1345</video:duration><video:publication_date>2026-10-23T17:46:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/sql-basics/i-solved-every-leetcode-sql-question</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/79cYr1_ggRA/hqdefault.jpg</video:thumbnail_loc><video:title>I Solved Every Leetcode SQL Question | How To Solve Leetcode Questions Effectively by EDS</video:title><video:description>I Solved Every Leetcode SQL Question | How To Solve Leetcode Questions Effectively by EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/79cYr1_ggRA</video:player_loc><video:duration>401</video:duration><video:publication_date>2022-10-31T02:30:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/sql-basics/find-customer-referee-leetcode-584</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/dgvnF3ulQRc/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 584</video:title><video:description>LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 584. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/dgvnF3ulQRc</video:player_loc><video:duration>310</video:duration><video:publication_date>2022-01-17T02:17:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/sql-basics/big-countries-leetcode-595</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8pkEOtpOlR4/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 595</video:title><video:description>LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 595. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8pkEOtpOlR4</video:player_loc><video:duration>235</video:duration><video:publication_date>2022-01-18T14:55:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/sql-basics/not-boring-movies-leetcode-620</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/wC7Tc7e_1s8/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 620</video:title><video:description>LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 620. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/wC7Tc7e_1s8</video:player_loc><video:duration>358</video:duration><video:publication_date>2022-01-23T12:00:35.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/sql-basics/recyclable-and-low-fat-products-leetcode-1757</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/f-Sc3X4mRxY/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1757 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1757 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/f-Sc3X4mRxY</video:player_loc><video:duration>194</video:duration><video:publication_date>2022-03-01T00:00:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/sql-basics/find-customers-with-positive-revenue-this-year-leetcode-1821</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/oJxNo2Qe30Q/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1821 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1821 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/oJxNo2Qe30Q</video:player_loc><video:duration>264</video:duration><video:publication_date>2022-03-05T00:00:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/sql-basics/low-quality-problems-leetcode-2026</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/1XW7v7Qo118/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 2026 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 2026 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/1XW7v7Qo118</video:player_loc><video:duration>280</video:duration><video:publication_date>2022-03-10T11:45:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/sql-basics/article-views-i-leetcode-1148</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/KJ0kmu7NbBI/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1148 LinkedIn Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1148 LinkedIn Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/KJ0kmu7NbBI</video:player_loc><video:duration>219</video:duration><video:publication_date>2022-04-07T11:00:18.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/sql-basics/sort-the-olympic-table-leetcode-2377</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/20ABs0cQfX8/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 2377 &quot;Sort the Olympic Table&quot; Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode 2377 &quot;Sort the Olympic Table&quot; Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/20ABs0cQfX8</video:player_loc><video:duration>235</video:duration><video:publication_date>2022-08-31T03:00:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/sql-basics/sort-the-olympic-table-leetcode-2377-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/NNWdkJGjwZI/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode 2377 - Sort the Olympic Table ORDER BY multiple condition - Solved by Everyday Data Science</video:title><video:description>Leetcode 2377 - Sort the Olympic Table ORDER BY multiple condition - Solved by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/NNWdkJGjwZI</video:player_loc><video:duration>167</video:duration><video:publication_date>2024-07-08T14:30:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/sql-basics/books-with-null-ratings-leetcode-3358</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/U-GVSgnbFlw/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode 3358 - Books With NULL Ratings - Filtering and Ordering Data in SQL | Everyday Data Science</video:title><video:description>Leetcode 3358 - Books With NULL Ratings - Filtering and Ordering Data in SQL | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/U-GVSgnbFlw</video:player_loc><video:duration>172</video:duration><video:publication_date>2024-11-21T03:00:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/duplicate-emails-leetcode-182</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/OBxq2iuRVxw/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 182</video:title><video:description>LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 182. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/OBxq2iuRVxw</video:player_loc><video:duration>387</video:duration><video:publication_date>2022-01-13T01:35:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/customer-placing-the-largest-number-of-orders-leetcode-586</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/pg__4JtWHTo/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 586</video:title><video:description>LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 586. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/pg__4JtWHTo</video:player_loc><video:duration>542</video:duration><video:publication_date>2022-01-17T16:11:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/classes-with-at-least-5-students-leetcode-596</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/k0BnYsp-JZM/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 596</video:title><video:description>LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 596. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/k0BnYsp-JZM</video:player_loc><video:duration>246</video:duration><video:publication_date>2022-01-19T14:59:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/actors-and-directors-who-cooperated-at-least-three-times-leetcode-1050</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ZL-i7o-JPi0/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 1050</video:title><video:description>LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 1050. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ZL-i7o-JPi0</video:player_loc><video:duration>336</video:duration><video:publication_date>2022-01-26T00:00:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/reported-posts-leetcode-1113</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/AaR9jYa3sj0/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1113 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1113 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/AaR9jYa3sj0</video:player_loc><video:duration>419</video:duration><video:publication_date>2022-01-27T00:00:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/queries-quality-and-percentage-leetcode-1211</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/7awLGzq_YaI/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1211 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1211 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/7awLGzq_YaI</video:player_loc><video:duration>808</video:duration><video:publication_date>2022-01-28T00:00:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/number-of-comments-per-post-leetcode-1241</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/TqztAKSb3zU/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1241 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1241 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/TqztAKSb3zU</video:player_loc><video:duration>909</video:duration><video:publication_date>2022-01-29T00:00:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/average-selling-price-leetcode-1251</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/mXEj5LiXkhc/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1251 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1251 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/mXEj5LiXkhc</video:player_loc><video:duration>1031</video:duration><video:publication_date>2022-01-30T00:00:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/bank-account-summary-ii-leetcode-1587</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/RjabLgrQN5Y/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1587 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1587 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/RjabLgrQN5Y</video:player_loc><video:duration>381</video:duration><video:publication_date>2022-02-23T00:00:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/daily-leads-and-partners-leetcode-1693</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/eQrT3aOqI9E/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1693 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1693 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/eQrT3aOqI9E</video:player_loc><video:duration>296</video:duration><video:publication_date>2022-02-27T00:00:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/find-total-time-spent-by-each-employee-leetcode-1741</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/bMIt9bzFX6Q/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1741 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1741 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/bMIt9bzFX6Q</video:player_loc><video:duration>416</video:duration><video:publication_date>2022-02-28T00:00:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/the-number-of-rich-customers-leetcode-2082</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/-0V7OMyvuzg/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 2082 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 2082 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/-0V7OMyvuzg</video:player_loc><video:duration>234</video:duration><video:publication_date>2022-03-11T11:45:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/product-sales-analysis-ii-leetcode-1069</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Sk5mkl1tCF0/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1069 Amazon Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1069 Amazon Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Sk5mkl1tCF0</video:player_loc><video:duration>197</video:duration><video:publication_date>2022-03-28T11:00:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/game-play-analysis-i-leetcode-511</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/m_a8rbMpDrU/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 511 Amazon Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 511 Amazon Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/m_a8rbMpDrU</video:player_loc><video:duration>218</video:duration><video:publication_date>2022-04-02T10:45:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/primary-department-for-each-employee-leetcode-1789</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/vv_cSJhhkOE/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1789 Facebook/Meta Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1789 Facebook/Meta Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/vv_cSJhhkOE</video:player_loc><video:duration>647</video:duration><video:publication_date>2022-04-05T11:00:34.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/find-followers-count-leetcode-1729</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/1mjs_Y3c5SM/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1729 Tesla Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1729 Tesla Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/1mjs_Y3c5SM</video:player_loc><video:duration>234</video:duration><video:publication_date>2022-04-12T11:00:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/percentage-of-users-attended-a-contest-leetcode-1633</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Jsd5stwdy2Q/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1633 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1633 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Jsd5stwdy2Q</video:player_loc><video:duration>355</video:duration><video:publication_date>2022-04-13T11:00:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/confirmation-rate-leetcode-1934</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/j7z9FIYfn9s/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1934 Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 1934 Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/j7z9FIYfn9s</video:player_loc><video:duration>707</video:duration><video:publication_date>2022-04-17T11:00:18.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/orders-with-maximum-quantity-above-average-leetcode-1867</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ZU1HrcmhIKY/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1867 Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 1867 Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ZU1HrcmhIKY</video:player_loc><video:duration>446</video:duration><video:publication_date>2022-04-18T11:00:13.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/project-employees-i-leetcode-1075</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/eITmqN5ocHg/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1075 Facebook/Meta Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1075 Facebook/Meta Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/eITmqN5ocHg</video:player_loc><video:duration>271</video:duration><video:publication_date>2022-05-19T11:00:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/league-statistics-leetcode-1841</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/g5Uc--MBqac/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1841 &quot;League Statistics&quot; Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 1841 &quot;League Statistics&quot; Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/g5Uc--MBqac</video:player_loc><video:duration>1136</video:duration><video:publication_date>2022-07-20T03:00:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/average-salary-departments-vs-company-leetcode-615</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/_GbfJBFFEIE/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Hard 615 &quot;Average Salary: Departments VS Company&quot; Amazon Interview SQL Question Explanation</video:title><video:description>LeetCode Hard 615 &quot;Average Salary: Departments VS Company&quot; Amazon Interview SQL Question Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/_GbfJBFFEIE</video:player_loc><video:duration>888</video:duration><video:publication_date>2022-07-23T03:00:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/sales-analysis-iii-leetcode-1084</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/cwXIB_CkEkM/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1084 &quot;Sales Analysis III&quot; Amazon Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode 1084 &quot;Sales Analysis III&quot; Amazon Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/cwXIB_CkEkM</video:player_loc><video:duration>495</video:duration><video:publication_date>2022-07-30T03:00:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/number-of-unique-subjects-taught-by-each-teacher-leetcode-2356</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/LuglzW1kqYo/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 2356 &quot;Unique Subjects Taught by Teacher&quot; Capgemini Interview SQL Question with Explanation</video:title><video:description>LeetCode 2356 &quot;Unique Subjects Taught by Teacher&quot; Capgemini Interview SQL Question with Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/LuglzW1kqYo</video:player_loc><video:duration>192</video:duration><video:publication_date>2022-09-05T03:00:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/product-sales-analysis-v-leetcode-2329</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/dkamIBZrK5g/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 2329 &quot;Product Sales Analysis V&quot; Amazon Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode 2329 &quot;Product Sales Analysis V&quot; Amazon Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/dkamIBZrK5g</video:player_loc><video:duration>426</video:duration><video:publication_date>2022-09-14T03:00:13.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/get-highest-answer-rate-question-leetcode-578</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8pa7UPezd5w/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 578 &quot;Highest Answer Rate Question&quot; Facebook/Meta Interview SQL Question Explanation</video:title><video:description>LeetCode Medium 578 &quot;Highest Answer Rate Question&quot; Facebook/Meta Interview SQL Question Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8pa7UPezd5w</video:player_loc><video:duration>558</video:duration><video:publication_date>2022-09-18T03:00:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/friend-requests-i-overall-acceptance-rate-leetcode-597</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5xQboAjMux0/hqdefault.jpg</video:thumbnail_loc><video:title>FACEBOOK/META LeetCode 597  &quot;Friend Requests I&quot; Interview SQL Question Detailed Explanation</video:title><video:description>FACEBOOK/META LeetCode 597  &quot;Friend Requests I&quot; Interview SQL Question Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5xQboAjMux0</video:player_loc><video:duration>681</video:duration><video:publication_date>2022-10-19T02:30:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/bank-account-summary-leetcode-1555</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/3EOL82ue3Gc/hqdefault.jpg</video:thumbnail_loc><video:title>OPTUM LeetCode Medium 1555 “Bank Account Summary&quot; Interview SQL Question Explanation | EDS</video:title><video:description>OPTUM LeetCode Medium 1555 “Bank Account Summary&quot; Interview SQL Question Explanation | EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/3EOL82ue3Gc</video:player_loc><video:duration>828</video:duration><video:publication_date>2022-11-06T02:30:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/article-views-ii-leetcode-1149</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/2IYmFeJy-K0/hqdefault.jpg</video:thumbnail_loc><video:title>AMAZON &amp; LINKEDIN LeetCode Medium “Article Views II&quot; 1149 Interview SQL Question Explanation | EDS</video:title><video:description>AMAZON &amp; LINKEDIN LeetCode Medium “Article Views II&quot; 1149 Interview SQL Question Explanation | EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/2IYmFeJy-K0</video:player_loc><video:duration>381</video:duration><video:publication_date>2022-11-18T03:30:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/find-candidates-for-data-scientist-position-leetcode-3051</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/MZOmQZXR7ho/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode 3051 - Candidates for Data Scientist Position - Solved &amp; Explained by Everyday Data Science</video:title><video:description>Leetcode 3051 - Candidates for Data Scientist Position - Solved &amp; Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/MZOmQZXR7ho</video:player_loc><video:duration>246</video:duration><video:publication_date>2024-06-16T02:00:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/loan-types-leetcode-2990</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/0mmtInIFB_g/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode 2990 - Loan Types - Solved by Everyday Data Science | GROUPBY, HAVING, COUNT DISTINCT</video:title><video:description>Leetcode 2990 - Loan Types - Solved by Everyday Data Science | GROUPBY, HAVING, COUNT DISTINCT. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/0mmtInIFB_g</video:player_loc><video:duration>206</video:duration><video:publication_date>2024-07-03T14:30:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/calculate-compressed-mean-leetcode-2985</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/MGHdYWtklOU/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode 2985 - Calculate Compressed Mean- Solved by Everyday Data Science | ROUND() SUM() AVG()</video:title><video:description>Leetcode 2985 - Calculate Compressed Mean- Solved by Everyday Data Science | ROUND() SUM() AVG(). Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/MGHdYWtklOU</video:player_loc><video:duration>134</video:duration><video:publication_date>2024-06-24T04:50:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/highest-salaries-difference-leetcode-2853</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/q2kaopV6j40/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode 2853 - Highest Salaries Difference - Solved by Everyday Data Science | ABSOLUTE difference</video:title><video:description>Leetcode 2853 - Highest Salaries Difference - Solved by Everyday Data Science | ABSOLUTE difference. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/q2kaopV6j40</video:player_loc><video:duration>179</video:duration><video:publication_date>2024-07-04T14:30:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/bikes-last-time-used-leetcode-2687</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/czPAmXEuPXE/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode 2687 - Bikes Last Time Used GROUP MAX() - Solved &amp; Explained by Everyday Data Science</video:title><video:description>Leetcode 2687 - Bikes Last Time Used GROUP MAX() - Solved &amp; Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/czPAmXEuPXE</video:player_loc><video:duration>183</video:duration><video:publication_date>2024-07-05T14:30:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/find-latest-salaries-leetcode-2668</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/4wLuBEho5OE/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode 2668 - Find Latest Salaries GROUP BY MAX() - Solved &amp; Explained by Everyday Data Science</video:title><video:description>Leetcode 2668 - Find Latest Salaries GROUP BY MAX() - Solved &amp; Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/4wLuBEho5OE</video:player_loc><video:duration>235</video:duration><video:publication_date>2024-07-06T14:30:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/reported-posts-ii-leetcode-1132</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/F047jz9gooo/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 1132 - Reported Posts II DISTINCT ROUND AVERAGE - Explained by Everyday Data Science</video:title><video:description>Leetcode MEDIUM 1132 - Reported Posts II DISTINCT ROUND AVERAGE - Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/F047jz9gooo</video:player_loc><video:duration>563</video:duration><video:publication_date>2024-07-13T02:00:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/count-occurrences-in-text-leetcode-2738</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/AFiCMVHzNQA/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 2738 - Count Occurrences in Text - Using SUM to Count in SQL | Everyday Data Science</video:title><video:description>Leetcode MEDIUM 2738 - Count Occurrences in Text - Using SUM to Count in SQL | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/AFiCMVHzNQA</video:player_loc><video:duration>265</video:duration><video:publication_date>2024-10-04T02:00:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/find-candidates-for-data-scientist-position-ii-leetcode-3278</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/co4zcyWv4Ks/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3278 - Candidates for Data Scientist Position II - SQL | Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3278 - Candidates for Data Scientist Position II - SQL | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/co4zcyWv4Ks</video:player_loc><video:duration>806</video:duration><video:publication_date>2024-11-24T03:00:25.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/find-top-scoring-students-leetcode-3182</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Tqyoy_JH_W4/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3182 - Find Top Scoring Students - Filter on Aggregation SQL | Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3182 - Find Top Scoring Students - Filter on Aggregation SQL | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Tqyoy_JH_W4</video:player_loc><video:duration>573</video:duration><video:publication_date>2024-11-30T03:00:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/find-top-scoring-students-ii-leetcode-3188</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/MJ3XEtM_M6M/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 3188 - Find Top Scoring Students 2 - Aggregate Filters in SQL | Everyday Data Science</video:title><video:description>Leetcode HARD 3188 - Find Top Scoring Students 2 - Aggregate Filters in SQL | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/MJ3XEtM_M6M</video:player_loc><video:duration>1117</video:duration><video:publication_date>2024-12-03T03:00:21.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/customer-purchasing-behavior-analysis-leetcode-3230</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/sw-nXrQ3pTk/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3230 - When NOT Use COALESCE - Customer Purchasing Behavior | Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3230 - When NOT Use COALESCE - Customer Purchasing Behavior | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/sw-nXrQ3pTk</video:player_loc><video:duration>1114</video:duration><video:publication_date>2025-02-26T03:00:49.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/analyze-subscription-conversion-leetcode-3497</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/_5LkSSpwnFk/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3497 - AGG Filter in SQL - Analyze Subscription Conversion | Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3497 - AGG Filter in SQL - Analyze Subscription Conversion | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/_5LkSSpwnFk</video:player_loc><video:duration>478</video:duration><video:publication_date>2025-04-09T02:00:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/find-books-with-polarized-opinions-leetcode-3642</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/RSN38-ypuRI/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode 3642 - Using SUM to COUNT in SQL - Books with Polarized Opinions | Everyday Data Science</video:title><video:description>Leetcode 3642 - Using SUM to COUNT in SQL - Books with Polarized Opinions | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/RSN38-ypuRI</video:player_loc><video:duration>742</video:duration><video:publication_date>2025-09-13T02:00:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/find-stores-with-inventory-imbalance-leetcode-3626</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/m4nFxP_2iRU/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3626 - Why MAX(A, NULL, NULL) Returns A - Stores with Inventory Imbalances | EDS</video:title><video:description>Leetcode MEDIUM 3626 - Why MAX(A, NULL, NULL) Returns A - Stores with Inventory Imbalances | EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/m4nFxP_2iRU</video:player_loc><video:duration>953</video:duration><video:publication_date>2025-09-14T02:00:49.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/aggregation-and-group-by/find-users-with-high-token-usage-leetcode-3793</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/pQwfnTkYYPA/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode 3793 - Aggregate Filters in SQL - Find Users with High Token Usage | Everyday Data Science</video:title><video:description>Leetcode 3793 - Aggregate Filters in SQL - Find Users with High Token Usage | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/pQwfnTkYYPA</video:player_loc><video:duration>541</video:duration><video:publication_date>2026-01-05T03:01:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/combine-two-tables-leetcode-175</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/_YYq82ov7Ic/hqdefault.jpg</video:thumbnail_loc><video:title>Solving LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 175</video:title><video:description>Solving LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 175. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/_YYq82ov7Ic</video:player_loc><video:duration>804</video:duration><video:publication_date>2022-01-11T04:16:48.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/employees-earning-more-than-their-managers-leetcode-181</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/wlnOgs0PT_8/hqdefault.jpg</video:thumbnail_loc><video:title>Solving LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 181</video:title><video:description>Solving LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 181. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/wlnOgs0PT_8</video:player_loc><video:duration>909</video:duration><video:publication_date>2022-01-12T05:37:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/employee-bonus-leetcode-577</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/2UBRzqWJbbg/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 577</video:title><video:description>LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 577. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/2UBRzqWJbbg</video:player_loc><video:duration>413</video:duration><video:publication_date>2022-01-15T22:52:34.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/shortest-distance-in-a-line-leetcode-613</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/khxtcJAZ4t8/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 613</video:title><video:description>LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 613. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/khxtcJAZ4t8</video:player_loc><video:duration>544</video:duration><video:publication_date>2022-01-21T13:43:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/students-and-examinations-leetcode-1280</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/99y84u99WW4/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1280 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1280 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/99y84u99WW4</video:player_loc><video:duration>1213</video:duration><video:publication_date>2022-02-03T00:00:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/replace-employee-id-with-the-unique-identifier-leetcode-1378</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/nD3rOE_0MgQ/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1378 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1378 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/nD3rOE_0MgQ</video:player_loc><video:duration>266</video:duration><video:publication_date>2022-02-07T00:00:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/top-travellers-leetcode-1407</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/OvlSWF3A5to/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1407 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1407 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/OvlSWF3A5to</video:player_loc><video:duration>767</video:duration><video:publication_date>2022-02-09T00:00:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/npv-queries-leetcode-1421</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5h2DWUp-ogQ/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1421 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1421 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5h2DWUp-ogQ</video:player_loc><video:duration>450</video:duration><video:publication_date>2022-02-11T00:00:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/warehouse-manager-leetcode-1571</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Jb1fbvk5UcM/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1571 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1571 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Jb1fbvk5UcM</video:player_loc><video:duration>477</video:duration><video:publication_date>2022-02-19T00:00:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/customer-who-visited-but-did-not-make-any-transactions-leetcode-1581</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QjlRRBca3XE/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1581 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1581 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QjlRRBca3XE</video:player_loc><video:duration>431</video:duration><video:publication_date>2022-02-21T00:00:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/grand-slam-titles-leetcode-1783</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/hMhAdy1t_Io/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1783 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode Medium 1783 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/hMhAdy1t_Io</video:player_loc><video:duration>859</video:duration><video:publication_date>2022-03-17T10:45:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/all-people-report-to-the-given-manager-leetcode-1270</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Bv8HcApRiS8/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1270 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode Medium 1270 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Bv8HcApRiS8</video:player_loc><video:duration>1586</video:duration><video:publication_date>2022-03-20T11:00:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/product-sales-analysis-i-leetcode-1068</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/BmD65aOwNew/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1068 Amazon Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1068 Amazon Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/BmD65aOwNew</video:player_loc><video:duration>237</video:duration><video:publication_date>2022-04-01T11:00:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/count-apples-and-oranges-leetcode-1715</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/qSZkSo4CZoY/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1715 Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 1715 Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/qSZkSo4CZoY</video:player_loc><video:duration>539</video:duration><video:publication_date>2022-04-15T11:00:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/accepted-candidates-from-the-interviews-leetcode-2041</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8kQY-lalHnM/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 2041 Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 2041 Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8kQY-lalHnM</video:player_loc><video:duration>397</video:duration><video:publication_date>2022-04-16T11:00:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/number-of-times-a-driver-was-a-passenger-leetcode-2238</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Xc1RIjk7RJo/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 2238 Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 2238 Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Xc1RIjk7RJo</video:player_loc><video:duration>495</video:duration><video:publication_date>2022-04-20T11:00:25.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/market-analysis-i-leetcode-1158</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/M29s5Zdt2iU/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1158 Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 1158 Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/M29s5Zdt2iU</video:player_loc><video:duration>548</video:duration><video:publication_date>2022-05-23T11:00:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/rectangles-area-leetcode-1459</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/u2VsU7UOTh8/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1459 &quot;Rectangles Area&quot; Twitter Interview SQL Question with Explanation</video:title><video:description>LeetCode Medium 1459 &quot;Rectangles Area&quot; Twitter Interview SQL Question with Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/u2VsU7UOTh8</video:player_loc><video:duration>639</video:duration><video:publication_date>2022-06-09T03:00:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/ad-free-sessions-leetcode-1809</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/hPhw2V2doWM/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1809 &quot;Ad-Free Sessions&quot; Amazon Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode 1809 &quot;Ad-Free Sessions&quot; Amazon Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/hPhw2V2doWM</video:player_loc><video:duration>477</video:duration><video:publication_date>2022-07-02T03:00:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/countries-you-can-safely-invest-in-leetcode-1501</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/F1reodvGcYU/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1501 &quot;Countries You Can Safely Invest In&quot; Interview SQL Question with Explanation</video:title><video:description>LeetCode Medium 1501 &quot;Countries You Can Safely Invest In&quot; Interview SQL Question with Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/F1reodvGcYU</video:player_loc><video:duration>909</video:duration><video:publication_date>2022-07-06T03:00:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/count-student-number-in-departments-leetcode-580</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/-UsnD4L5cuc/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 580 &quot;Student Number in Departments&quot; Twitter Interview SQL Question with Explanation</video:title><video:description>LeetCode Medium 580 &quot;Student Number in Departments&quot; Twitter Interview SQL Question with Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/-UsnD4L5cuc</video:player_loc><video:duration>518</video:duration><video:publication_date>2022-07-15T03:00:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/count-the-number-of-experiments-leetcode-1990</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/haOa0-5qFbo/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1990 &quot;Number of Experiments&quot; Twitter Interview SQL Question Detailed Explanation</video:title><video:description>LeetCode Medium 1990 &quot;Number of Experiments&quot; Twitter Interview SQL Question Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/haOa0-5qFbo</video:player_loc><video:duration>909</video:duration><video:publication_date>2022-08-05T03:00:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/the-number-of-employees-which-report-to-each-employee-leetcode-1731</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/HfFC3S_7y10/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1731 &quot;Employees Which Report to Each Employee&quot; Interview SQL Question with Explanation</video:title><video:description>LeetCode 1731 &quot;Employees Which Report to Each Employee&quot; Interview SQL Question with Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/HfFC3S_7y10</video:player_loc><video:duration>421</video:duration><video:publication_date>2022-08-18T03:00:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/the-number-of-seniors-and-juniors-to-join-the-company-leetcode-2004</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ZM6tnkmVdmM/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Hard 2004 &quot;Number of Seniors and Juniors&quot; Wayfair Interview SQL Question With Explanation</video:title><video:description>LeetCode Hard 2004 &quot;Number of Seniors and Juniors&quot; Wayfair Interview SQL Question With Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ZM6tnkmVdmM</video:player_loc><video:duration>1230</video:duration><video:publication_date>2022-08-24T03:00:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/all-the-matches-of-the-league-leetcode-2339</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/4v8yYVMrbFw/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 2339 &quot;All Matches of the League&quot; Microsoft Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode 2339 &quot;All Matches of the League&quot; Microsoft Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/4v8yYVMrbFw</video:player_loc><video:duration>320</video:duration><video:publication_date>2022-09-03T03:00:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/products-worth-over-invoices-leetcode-1677</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/2wqGPeCM_Ec/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1677 &quot;Product&apos;s Worth Over Invoices&quot; Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode 1677 &quot;Product&apos;s Worth Over Invoices&quot; Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/2wqGPeCM_Ec</video:player_loc><video:duration>631</video:duration><video:publication_date>2022-09-22T03:00:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/shortest-distance-in-a-plane-leetcode-612</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/0k-J7tbqVM8/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 612 “Shortest Distance in a Plane&quot; Interview SQL Question Explanation | EDS</video:title><video:description>LeetCode Medium 612 “Shortest Distance in a Plane&quot; Interview SQL Question Explanation | EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/0k-J7tbqVM8</video:player_loc><video:duration>688</video:duration><video:publication_date>2022-10-26T02:30:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/calculate-the-influence-of-each-salesperson-leetcode-2372</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/XtP2L977Aao/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 2372 “Influence of Each Salesperson&quot; Interview SQL Question Explanation | EDS</video:title><video:description>LeetCode Medium 2372 “Influence of Each Salesperson&quot; Interview SQL Question Explanation | EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/XtP2L977Aao</video:player_loc><video:duration>462</video:duration><video:publication_date>2022-11-02T02:30:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/total-traveled-distance-leetcode-2837</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ak_D_QQ5XKc/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode 2837 - Total Traveled Distance - Solved by Everyday Data Science | JOIN, IFNULL() SUM()</video:title><video:description>Leetcode 2837 - Total Traveled Distance - Solved by Everyday Data Science | JOIN, IFNULL() SUM(). Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ak_D_QQ5XKc</video:player_loc><video:duration>302</video:duration><video:publication_date>2024-06-23T05:15:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/form-a-chemical-bond-leetcode-2480</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/3Wem4h6Yxro/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode 2480 - Form a Chemical Bond CROSS JOIN() - Solved &amp; Explained by Everyday Data Science</video:title><video:description>Leetcode 2480 - Form a Chemical Bond CROSS JOIN() - Solved &amp; Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/3Wem4h6Yxro</video:player_loc><video:duration>262</video:duration><video:publication_date>2024-06-27T14:00:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/second-degree-follower-leetcode-614</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/_Alt3Y68-80/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 614 - Second Degree Follower JOIN Solution - Explained by Everyday Data Science</video:title><video:description>Leetcode MEDIUM 614 - Second Degree Follower JOIN Solution - Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/_Alt3Y68-80</video:player_loc><video:duration>375</video:duration><video:publication_date>2024-07-02T14:30:23.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/tournament-winners-leetcode-1194</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/vyaGLeh7DIQ/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 1194 - Tournament Winners MULTI-COLUMN JOIN TRICK - Explained by Everyday Data Science</video:title><video:description>Leetcode HARD 1194 - Tournament Winners MULTI-COLUMN JOIN TRICK - Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/vyaGLeh7DIQ</video:player_loc><video:duration>624</video:duration><video:publication_date>2024-07-15T02:00:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/all-valid-triplets-that-can-represent-a-country-leetcode-1623</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/6Y--BrDtm08/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode 1623 - All Valid Triplets - Easiest Solution - Solved &amp; Explained by Everyday Data Science</video:title><video:description>Leetcode 1623 - All Valid Triplets - Easiest Solution - Solved &amp; Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/6Y--BrDtm08</video:player_loc><video:duration>383</video:duration><video:publication_date>2024-07-17T02:00:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/server-utilization-time-leetcode-3126</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/4SyRTGdS_xQ/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3126 - Server Utilization Time CTEs SELF JOIN - Explained by Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3126 - Server Utilization Time CTEs SELF JOIN - Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/4SyRTGdS_xQ</video:player_loc><video:duration>730</video:duration><video:publication_date>2024-07-27T01:45:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/number-of-trusted-contacts-of-a-customer-leetcode-1364</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/88ES0sxcEns/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 1364 - Number of Trusted Contacts MULTIPLE JOINS- Explained by Everyday Data Science</video:title><video:description>Leetcode MEDIUM 1364 - Number of Trusted Contacts MULTIPLE JOINS- Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/88ES0sxcEns</video:player_loc><video:duration>665</video:duration><video:publication_date>2024-08-27T02:00:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/page-recommendations-ii-leetcode-1892</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/LFjXVq_qNLc/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 1892 - Page Recommendations 2 : Using JOINs to FILTER TABLES - Explained by EDS</video:title><video:description>Leetcode HARD 1892 - Page Recommendations 2 : Using JOINs to FILTER TABLES - Explained by EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/LFjXVq_qNLc</video:player_loc><video:duration>627</video:duration><video:publication_date>2024-08-29T02:00:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/leetcodify-similar-friends-leetcode-1919</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ezV3_MPWbng/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 1919 - Leetcodify Similar Friends: How to use WHERE (a, b) IN (...) - Explained by EDS</video:title><video:description>Leetcode HARD 1919 - Leetcodify Similar Friends: How to use WHERE (a, b) IN (...) - Explained by EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ezV3_MPWbng</video:player_loc><video:duration>450</video:duration><video:publication_date>2024-08-31T02:00:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/leetcodify-friends-recommendations-leetcode-1917</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/WAOqlke1S0g/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 1917 - Leetcodify Friends Recommendations: Explained by Everyday Data Science</video:title><video:description>Leetcode HARD 1917 - Leetcodify Friends Recommendations: Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/WAOqlke1S0g</video:player_loc><video:duration>547</video:duration><video:publication_date>2024-09-05T02:00:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/strong-friendship-leetcode-1949</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/00l8pQc3WUk/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 1949 - Strong Friendship SELF JOINS in SQL - Explained by Everyday Data Science</video:title><video:description>Leetcode MEDIUM 1949 - Strong Friendship SELF JOINS in SQL - Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/00l8pQc3WUk</video:player_loc><video:duration>673</video:duration><video:publication_date>2024-09-09T02:00:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/the-number-of-seniors-and-juniors-to-join-the-company-ii-leetcode-2010</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/nN_7RJPm7jI/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 2010 - Number of Seniors &amp; Juniors to Join 2 : Explained by Everyday Data Science</video:title><video:description>Leetcode HARD 2010 - Number of Seniors &amp; Juniors to Join 2 : Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/nN_7RJPm7jI</video:player_loc><video:duration>491</video:duration><video:publication_date>2024-09-11T02:00:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/calculate-product-final-price-leetcode-3293</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/LObB1axn690/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3293 - Calculate Product Final Price - Using IFNULL in SQL | Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3293 - Calculate Product Final Price - Using IFNULL in SQL | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/LObB1axn690</video:player_loc><video:duration>329</video:duration><video:publication_date>2024-10-26T02:00:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/friends-with-no-mutual-friends-leetcode-3058</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/HqMtsXF7Ldg/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3058 - Friends With No Mutual Friends - SELF JOINS in SQL | Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3058 - Friends With No Mutual Friends - SELF JOINS in SQL | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/HqMtsXF7Ldg</video:player_loc><video:duration>527</video:duration><video:publication_date>2024-11-17T03:00:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/find-students-who-improved-leetcode-3421</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/s3R4bhUSzpU/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3421 - SELF JOINs in SQL - Find Students Who Improved | Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3421 - SELF JOINs in SQL - Find Students Who Improved | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/s3R4bhUSzpU</video:player_loc><video:duration>647</video:duration><video:publication_date>2025-01-16T03:00:40.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/team-dominance-by-pass-success-leetcode-3384</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/_SaWh48e4xE/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 3384 - SELF JOIN in SQL Explained - Team Dominance by Pass | Everyday Data Science</video:title><video:description>Leetcode HARD 3384 - SELF JOIN in SQL Explained - Team Dominance by Pass | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/_SaWh48e4xE</video:player_loc><video:duration>478</video:duration><video:publication_date>2025-01-26T03:00:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/find-overlapping-shifts-leetcode-3262</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/wDj-gEBV6QM/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3262 - SELF JOINs in SQL - Find Overlapping Shifts | Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3262 - SELF JOINs in SQL - Find Overlapping Shifts | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/wDj-gEBV6QM</video:player_loc><video:duration>370</video:duration><video:publication_date>2025-02-07T03:00:50.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/find-overlapping-shifts-ii-leetcode-3268</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/mrYYe-d_CXk/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 3268 - SELF JOINs in SQL Explained - Find Overlapping Shifts 2 | Everyday Data Science</video:title><video:description>Leetcode HARD 3268 - SELF JOINs in SQL Explained - Find Overlapping Shifts 2 | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/mrYYe-d_CXk</video:player_loc><video:duration>603</video:duration><video:publication_date>2025-02-15T03:00:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/find-product-recommendation-pairs-leetcode-3521</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/dsWbvWRR2BY/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3521 - SELF JOIN in SQL - Amazon Product Recommendation Pair | Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3521 - SELF JOIN in SQL - Amazon Product Recommendation Pair | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/dsWbvWRR2BY</video:player_loc><video:duration>729</video:duration><video:publication_date>2025-04-29T02:00:38.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/find-books-with-no-available-copies-leetcode-3570</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Q724hLkWVGk/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode 3570 - Learn SQL - Find Books with No Available Copies | Everyday Data Science</video:title><video:description>Leetcode 3570 - Learn SQL - Find Books with No Available Copies | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Q724hLkWVGk</video:player_loc><video:duration>523</video:duration><video:publication_date>2025-09-21T02:00:34.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/joins/find-category-recommendation-pairs-leetcode-3554</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/LoQyKqZ4stA/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 3554 - Self Joins AMAZON - Find Category Recommendation Pairs | Everyday Data Science</video:title><video:description>Leetcode HARD 3554 - Self Joins AMAZON - Find Category Recommendation Pairs | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/LoQyKqZ4stA</video:player_loc><video:duration>715</video:duration><video:publication_date>2025-09-22T02:00:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/customers-who-never-order-leetcode-183</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ddeiGdMWtbQ/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 183</video:title><video:description>LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 183. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ddeiGdMWtbQ</video:player_loc><video:duration>1055</video:duration><video:publication_date>2022-01-14T02:28:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/biggest-single-number-leetcode-619</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/1Aujpatu0fs/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 619</video:title><video:description>LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 619. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/1Aujpatu0fs</video:player_loc><video:duration>558</video:duration><video:publication_date>2022-01-22T23:49:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/students-with-invalid-departments-leetcode-1350</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/dgfCTCafuIU/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1350 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1350 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/dgfCTCafuIU</video:player_loc><video:duration>327</video:duration><video:publication_date>2022-02-05T00:00:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/employees-with-missing-information-leetcode-1965</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/hQU1gYzY-Ug/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1965 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1965 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/hQU1gYzY-Ug</video:player_loc><video:duration>787</video:duration><video:publication_date>2022-03-09T11:45:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/drop-type-1-orders-for-customers-with-type-0-orders-leetcode-2084</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8EGyxJHW7jk/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 2084 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode Medium 2084 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8EGyxJHW7jk</video:player_loc><video:duration>921</video:duration><video:publication_date>2022-03-14T10:45:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/sales-analysis-i-leetcode-1082</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/i-wRrPYAgB0/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1082 Amazon Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1082 Amazon Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/i-wRrPYAgB0</video:player_loc><video:duration>452</video:duration><video:publication_date>2022-04-08T11:00:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/sales-person-leetcode-607</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/dz1SmsAD8bU/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 607 Amazon Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 607 Amazon Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/dz1SmsAD8bU</video:player_loc><video:duration>404</video:duration><video:publication_date>2022-04-14T11:00:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/activity-participants-leetcode-1355</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/302YoPPja5k/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1355 IBM Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 1355 IBM Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/302YoPPja5k</video:player_loc><video:duration>774</video:duration><video:publication_date>2022-04-21T11:00:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/the-airport-with-the-most-traffic-leetcode-2112</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/u5hEeI6Q5ww/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 2112 Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 2112 Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/u5hEeI6Q5ww</video:player_loc><video:duration>628</video:duration><video:publication_date>2022-05-11T12:00:35.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/product-price-at-a-given-date-leetcode-1164</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/gmYMeVcEsnM/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1164 Amazon Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 1164 Amazon Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/gmYMeVcEsnM</video:player_loc><video:duration>590</video:duration><video:publication_date>2022-05-15T11:00:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/customers-who-bought-all-products-leetcode-1045</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/lTeIJ23ruWU/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1045 Amazon Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 1045 Amazon Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/lTeIJ23ruWU</video:player_loc><video:duration>421</video:duration><video:publication_date>2022-05-17T11:00:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/immediate-food-delivery-ii-leetcode-1174</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/UiOwML5ncCw/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1174 Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 1174 Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/UiOwML5ncCw</video:player_loc><video:duration>651</video:duration><video:publication_date>2022-05-30T11:00:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/active-businesses-leetcode-1126</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5J-srtoCM48/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1126 Yelp Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 1126 Yelp Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5J-srtoCM48</video:player_loc><video:duration>596</video:duration><video:publication_date>2022-06-02T11:00:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/second-highest-salary-leetcode-176</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Sow1S_aMpCI/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 176 Amazon Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 176 Amazon Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Sow1S_aMpCI</video:player_loc><video:duration>584</video:duration><video:publication_date>2022-06-03T11:00:14.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/find-cutoff-score-for-each-school-leetcode-1988</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/aV6-Y-S3FAA/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1988 &quot;Find Cutoff Score for Each School&quot; Interview SQL Question with Explanation</video:title><video:description>LeetCode Medium 1988 &quot;Find Cutoff Score for Each School&quot; Interview SQL Question with Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/aV6-Y-S3FAA</video:player_loc><video:duration>785</video:duration><video:publication_date>2022-06-26T03:00:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/movie-rating-leetcode-1341</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9R50mg564YQ/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1341 &quot;Movie Rating&quot; SAP Interview SQL Question with Explanation</video:title><video:description>LeetCode Medium 1341 &quot;Movie Rating&quot; SAP Interview SQL Question with Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9R50mg564YQ</video:player_loc><video:duration>724</video:duration><video:publication_date>2022-07-13T03:00:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/game-play-analysis-ii-leetcode-512</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/XfliQZnEjVI/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 512 &quot;Game Play Analysis II&quot; GSN Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode 512 &quot;Game Play Analysis II&quot; GSN Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/XfliQZnEjVI</video:player_loc><video:duration>331</video:duration><video:publication_date>2022-07-25T03:00:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/sellers-with-no-sales-leetcode-1607</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/hQCb3e4SEf0/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1607 &quot;Sellers With No Sales&quot; Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode 1607 &quot;Sellers With No Sales&quot; Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/hQCb3e4SEf0</video:player_loc><video:duration>307</video:duration><video:publication_date>2022-07-27T03:00:23.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/investments-in-2016-leetcode-585</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/BVGhF9yaDU0/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 585 &quot;Investments in 2016&quot; Twitter Interview SQL Question With Detailed Explanation</video:title><video:description>LeetCode Medium 585 &quot;Investments in 2016&quot; Twitter Interview SQL Question With Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/BVGhF9yaDU0</video:player_loc><video:duration>1056</video:duration><video:publication_date>2022-08-03T03:00:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/employees-whose-manager-left-the-company-leetcode-1978</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/WW1dFJ0o_kw/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1978 &quot;Employees Whose Manager Left&quot; Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode 1978 &quot;Employees Whose Manager Left&quot; Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/WW1dFJ0o_kw</video:player_loc><video:duration>385</video:duration><video:publication_date>2022-08-10T03:00:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/project-employees-ii-leetcode-1076</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/xeadVLQj5WI/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1076 &quot;Project Employees II&quot; Meta Interview SQL Question with Explanation</video:title><video:description>LeetCode 1076 &quot;Project Employees II&quot; Meta Interview SQL Question with Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/xeadVLQj5WI</video:player_loc><video:duration>325</video:duration><video:publication_date>2022-08-16T03:00:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/nth-highest-salary-leetcode-177</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/jNSGAS2lIvE/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 177 &quot;Nth Highest Salary&quot; Amazon Bloomberg Interview SQL Question With Explanation</video:title><video:description>LeetCode Medium 177 &quot;Nth Highest Salary&quot; Amazon Bloomberg Interview SQL Question With Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/jNSGAS2lIvE</video:player_loc><video:duration>395</video:duration><video:publication_date>2022-08-22T03:00:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/department-highest-salary-leetcode-184</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/68PVQ4OzLuk/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 184 &quot;Department Highest Salary&quot; Amazon Interview SQL Question With Explanation</video:title><video:description>LeetCode Medium 184 &quot;Department Highest Salary&quot; Amazon Interview SQL Question With Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/68PVQ4OzLuk</video:player_loc><video:duration>441</video:duration><video:publication_date>2022-09-07T03:00:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/managers-with-at-least-5-direct-reports-leetcode-570</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/cBi77HIJOyQ/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 570 &quot;Managers with 5 Direct Reports&quot; Amazon Interview SQL Question With Explanation</video:title><video:description>LeetCode Medium 570 &quot;Managers with 5 Direct Reports&quot; Amazon Interview SQL Question With Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/cBi77HIJOyQ</video:player_loc><video:duration>331</video:duration><video:publication_date>2022-09-10T03:00:13.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/winning-candidate-leetcode-574</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/7ZwnwSRE56Q/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 574 &quot;Winning Candidate&quot; Interview SQL Question With Detailed Explanation</video:title><video:description>LeetCode Medium 574 &quot;Winning Candidate&quot; Interview SQL Question With Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/7ZwnwSRE56Q</video:player_loc><video:duration>414</video:duration><video:publication_date>2022-09-12T03:00:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/sales-analysis-ii-leetcode-1083</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/fsl_zca3l8U/hqdefault.jpg</video:thumbnail_loc><video:title>AMAZON LeetCode 1083 &quot;Sales Analysis II&quot; Interview SQL Question Detailed Explanation</video:title><video:description>AMAZON LeetCode 1083 &quot;Sales Analysis II&quot; Interview SQL Question Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/fsl_zca3l8U</video:player_loc><video:duration>499</video:duration><video:publication_date>2022-10-21T02:30:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/page-recommendations-leetcode-1264</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/nRuj-7LgIjk/hqdefault.jpg</video:thumbnail_loc><video:title>FACEBOOK/META LeetCode Medium 1264 “Page Recommendations&quot; Interview SQL Question Explanation | EDS</video:title><video:description>FACEBOOK/META LeetCode Medium 1264 “Page Recommendations&quot; Interview SQL Question Explanation | EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/nRuj-7LgIjk</video:player_loc><video:duration>415</video:duration><video:publication_date>2022-10-28T02:30:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/friend-requests-ii-who-has-the-most-friends-leetcode-602</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/UAFppQ2dh1g/hqdefault.jpg</video:thumbnail_loc><video:title>FACEBOOK/META LeetCode Medium “Friend Requests II&quot; 602 Interview SQL Question Explanation | EDS</video:title><video:description>FACEBOOK/META LeetCode Medium “Friend Requests II&quot; 602 Interview SQL Question Explanation | EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/UAFppQ2dh1g</video:player_loc><video:duration>429</video:duration><video:publication_date>2022-11-21T03:30:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/product-sales-analysis-iii-leetcode-1070</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/2aLXBwN7J_Y/hqdefault.jpg</video:thumbnail_loc><video:title>AMAZON LeetCode Medium “Product Sales Analysis III&quot; 1070 Interview SQL Question Explanation | EDS</video:title><video:description>AMAZON LeetCode Medium “Product Sales Analysis III&quot; 1070 Interview SQL Question Explanation | EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/2aLXBwN7J_Y</video:player_loc><video:duration>359</video:duration><video:publication_date>2022-11-22T03:30:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/game-play-analysis-iv-leetcode-550</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/VQxCMp6POhU/hqdefault.jpg</video:thumbnail_loc><video:title>GSN GAMES LeetCode Medium “Game Play Analysis IV&quot; 550 Interview SQL Question Explanation | EDS</video:title><video:description>GSN GAMES LeetCode Medium “Game Play Analysis IV&quot; 550 Interview SQL Question Explanation | EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/VQxCMp6POhU</video:player_loc><video:duration>515</video:duration><video:publication_date>2022-11-23T03:30:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/subqueries/popularity-percentage-leetcode-2720</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9JyZoOr2prA/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 2720 - Popularity Percentage SUBQUERY in SQL : Explained by Everyday Data Science</video:title><video:description>Leetcode HARD 2720 - Popularity Percentage SUBQUERY in SQL : Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9JyZoOr2prA</video:player_loc><video:duration>318</video:duration><video:publication_date>2024-10-02T02:00:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/ctes/generate-the-invoice-leetcode-2362</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/S95lmomqllE/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Hard 2362 “Generate the Invoice&quot; Interview SQL Question Explanation | EDS</video:title><video:description>LeetCode Hard 2362 “Generate the Invoice&quot; Interview SQL Question Explanation | EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/S95lmomqllE</video:player_loc><video:duration>528</video:duration><video:publication_date>2022-11-11T03:30:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/ctes/employees-project-allocation-leetcode-3057</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/GdygULhFr_8/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 3057 - Employees Project Allocation | Data Science Roadmap</video:title><video:description>Leetcode HARD 3057 - Employees Project Allocation | Data Science Roadmap. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/GdygULhFr_8</video:player_loc><video:duration>412</video:duration><video:publication_date>2024-06-18T04:00:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/ctes/class-performance-leetcode-2989</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/tNOhMctJjeU/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 2989 - Class Performance- Solved by Everyday Data Science | MIN() MAX() CTE</video:title><video:description>Leetcode MEDIUM 2989 - Class Performance- Solved by Everyday Data Science | MIN() MAX() CTE. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/tNOhMctJjeU</video:player_loc><video:duration>228</video:duration><video:publication_date>2024-06-21T06:15:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/ctes/find-drivers-with-improved-fuel-efficiency-leetcode-3601</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/UTsxiEZQrns/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3601 - COMMON TABLE EXPRESSIONS in SQL - Find Drivers Improved Fuel Efficiency | EDS</video:title><video:description>Leetcode MEDIUM 3601 - COMMON TABLE EXPRESSIONS in SQL - Find Drivers Improved Fuel Efficiency | EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/UTsxiEZQrns</video:player_loc><video:duration>675</video:duration><video:publication_date>2025-07-27T02:00:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/ctes/find-overbooked-employees-leetcode-3611</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/jqLHMyfxDjw/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3611 - Weeks Starting Monday vs Sunday &amp; CTE in SQL - Overbooked Employees | EDS</video:title><video:description>Leetcode MEDIUM 3611 - Weeks Starting Monday vs Sunday &amp; CTE in SQL - Overbooked Employees | EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/jqLHMyfxDjw</video:player_loc><video:duration>643</video:duration><video:publication_date>2025-07-31T02:00:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/ctes/find-loyal-customers-leetcode-3657</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ugNRBM1xK7E/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3657 - GROUP BY &amp; Common Table Expressions in SQL - Find Loyal Customers | EDS</video:title><video:description>Leetcode MEDIUM 3657 - GROUP BY &amp; Common Table Expressions in SQL - Find Loyal Customers | EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ugNRBM1xK7E</video:player_loc><video:duration>447</video:duration><video:publication_date>2025-09-07T02:01:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/ctes/find-zombie-sessions-leetcode-3673</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/qGsCQGULA7o/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 3673 - CTE in SQL Explained - Find Zombie Sessions | Everyday Data Science</video:title><video:description>Leetcode HARD 3673 - CTE in SQL Explained - Find Zombie Sessions | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/qGsCQGULA7o</video:player_loc><video:duration>554</video:duration><video:publication_date>2025-09-08T02:00:44.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/consecutive-available-seats-leetcode-603</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/PHzKd0T8ld8/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 603 | Window Fun</video:title><video:description>LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 603 | Window Fun. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/PHzKd0T8ld8</video:player_loc><video:duration>1071</video:duration><video:publication_date>2022-01-15T03:25:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/find-the-team-size-leetcode-1303</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/_BuFa0YwyaM/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1303 Interview SQL Question with Detailed Explanation | Practice SQL | Window Functions</video:title><video:description>LeetCode 1303 Interview SQL Question with Detailed Explanation | Practice SQL | Window Functions. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/_BuFa0YwyaM</video:player_loc><video:duration>476</video:duration><video:publication_date>2022-02-01T00:00:17.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/running-total-for-different-genders-leetcode-1308</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/p_gHLjNepfs/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1308 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode Medium 1308 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/p_gHLjNepfs</video:player_loc><video:duration>1011</video:duration><video:publication_date>2022-03-18T11:00:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/find-the-start-and-end-number-of-continuous-ranges-leetcode-1285</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Hck2f2Xt_ws/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1285 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode Medium 1285 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Hck2f2Xt_ws</video:player_loc><video:duration>735</video:duration><video:publication_date>2022-03-19T11:00:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/account-balance-leetcode-2066</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9zrL7Fdness/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 2066 Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 2066 Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9zrL7Fdness</video:player_loc><video:duration>538</video:duration><video:publication_date>2022-03-24T11:00:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/the-most-frequently-ordered-products-for-each-customer-leetcode-1596</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/OuTn48o-MGU/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1596 Amazon Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 1596 Amazon Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/OuTn48o-MGU</video:player_loc><video:duration>998</video:duration><video:publication_date>2022-03-25T11:00:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/maximum-transaction-each-day-leetcode-1831</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ZD-Vkm5N8Mg/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1831 Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 1831 Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ZD-Vkm5N8Mg</video:player_loc><video:duration>794</video:duration><video:publication_date>2022-03-26T10:45:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/game-play-analysis-iii-leetcode-534</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/IwN46uJbyuI/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 534 Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 534 Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/IwN46uJbyuI</video:player_loc><video:duration>399</video:duration><video:publication_date>2022-03-30T11:00:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/project-employees-iii-leetcode-1077</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Q2M37uY6s3c/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1077 Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 1077 Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Q2M37uY6s3c</video:player_loc><video:duration>507</video:duration><video:publication_date>2022-04-19T11:00:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/biggest-window-between-visits-leetcode-1709</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/KczXzBL62hg/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1709 Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 1709 Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/KczXzBL62hg</video:player_loc><video:duration>774</video:duration><video:publication_date>2022-04-22T11:00:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/last-person-to-fit-in-the-bus-leetcode-1204</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/UMQWnuI9WbU/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1204 Wayfair Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 1204 Wayfair Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/UMQWnuI9WbU</video:player_loc><video:duration>609</video:duration><video:publication_date>2022-04-28T11:00:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/highest-grade-for-each-student-leetcode-1112</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Nn1-SvqCAVU/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1112 Coursera Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 1112 Coursera Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Nn1-SvqCAVU</video:player_loc><video:duration>454</video:duration><video:publication_date>2022-05-02T11:00:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/restaurant-growth-leetcode-1321</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/BxwVHF2Ri0k/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1321 Amazon Point72 Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 1321 Amazon Point72 Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/BxwVHF2Ri0k</video:player_loc><video:duration>624</video:duration><video:publication_date>2022-05-05T11:00:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/the-most-recent-three-orders-leetcode-1532</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/-y-l2ulw7qA/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1532 Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 1532 Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/-y-l2ulw7qA</video:player_loc><video:duration>685</video:duration><video:publication_date>2022-05-06T11:00:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/rank-scores-leetcode-178</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/IEaEdvzmz2g/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 178 Amazon Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 178 Amazon Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/IEaEdvzmz2g</video:player_loc><video:duration>373</video:duration><video:publication_date>2022-05-31T11:00:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/the-change-in-global-rankings-leetcode-2175</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/WvM7kmq6HDA/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 2175 &quot;Change in Global Rankings&quot; Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 2175 &quot;Change in Global Rankings&quot; Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/WvM7kmq6HDA</video:player_loc><video:duration>964</video:duration><video:publication_date>2022-06-06T03:00:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/the-most-recent-orders-for-each-product-leetcode-1549</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/E2WhdRQSqzM/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1549 &quot;Most Recent Orders for Each Product&quot; Interview SQL Question with Explanation</video:title><video:description>LeetCode Medium 1549 &quot;Most Recent Orders for Each Product&quot; Interview SQL Question with Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/E2WhdRQSqzM</video:player_loc><video:duration>616</video:duration><video:publication_date>2022-06-07T03:00:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/get-the-second-most-recent-activity-leetcode-1369</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/-cHbE72YqqI/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Hard 1369 &quot;Second Most Recent Activity&quot; Microsoft Interview SQL Question with Explanation</video:title><video:description>LeetCode Hard 1369 &quot;Second Most Recent Activity&quot; Microsoft Interview SQL Question with Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/-cHbE72YqqI</video:player_loc><video:duration>626</video:duration><video:publication_date>2022-06-11T03:00:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/arrange-table-by-gender-leetcode-2308</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/BYhAyviXVgg/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 2308 &quot;Arrange Table by Gender&quot; Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 2308 &quot;Arrange Table by Gender&quot; Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/BYhAyviXVgg</video:player_loc><video:duration>774</video:duration><video:publication_date>2022-06-18T03:00:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/group-employees-of-the-same-salary-leetcode-1875</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/N6d6tDNtzjY/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1875 &quot;Group Employees of the Same Salary&quot; Interview SQL Question with Explanation</video:title><video:description>LeetCode Medium 1875 &quot;Group Employees of the Same Salary&quot; Interview SQL Question with Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/N6d6tDNtzjY</video:player_loc><video:duration>493</video:duration><video:publication_date>2022-06-22T03:00:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/the-first-day-of-the-maximum-recorded-degree-in-each-city-leetcode-2314</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5WpBM119_OE/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 2314 &quot;First Day of Maximum Recorded Degree&quot; Interview SQL Question with Explanation</video:title><video:description>LeetCode Medium 2314 &quot;First Day of Maximum Recorded Degree&quot; Interview SQL Question with Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5WpBM119_OE</video:player_loc><video:duration>429</video:duration><video:publication_date>2022-06-24T03:15:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/median-employee-salary-leetcode-569</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/CTS_5i0i278/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Hard 569 &quot;Median Employee Salary&quot; Google Interview SQL Question with Explanation</video:title><video:description>LeetCode Hard 569 &quot;Median Employee Salary&quot; Google Interview SQL Question with Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/CTS_5i0i278</video:player_loc><video:duration>625</video:duration><video:publication_date>2022-06-28T03:00:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/consecutive-numbers-leetcode-180</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/iNaLjT9ybYI/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 180 &quot;Consecutive Numbers&quot; Amazon Uber Interview SQL Question Detailed Explanation</video:title><video:description>LeetCode Medium 180 &quot;Consecutive Numbers&quot; Amazon Uber Interview SQL Question Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/iNaLjT9ybYI</video:player_loc><video:duration>406</video:duration><video:publication_date>2022-08-01T03:00:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/order-two-columns-independently-leetcode-2159</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/3H6DI54T_d4/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 2159 Booking.com “Order 2 Columns Independently&quot; Interview SQL Question Explanation</video:title><video:description>LeetCode Medium 2159 Booking.com “Order 2 Columns Independently&quot; Interview SQL Question Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/3H6DI54T_d4</video:player_loc><video:duration>592</video:duration><video:publication_date>2022-09-29T03:00:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/product-sales-analysis-iv-leetcode-2324</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/oTQLrbvncGY/hqdefault.jpg</video:thumbnail_loc><video:title>AMAZON LeetCode Medium 2324 “Product Sales Analysis IV&quot; Interview SQL Question Explanation | EDS</video:title><video:description>AMAZON LeetCode Medium 2324 “Product Sales Analysis IV&quot; Interview SQL Question Explanation | EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/oTQLrbvncGY</video:player_loc><video:duration>479</video:duration><video:publication_date>2022-11-04T02:30:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/find-interview-candidates-leetcode-1811</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/u281-jsR6bw/hqdefault.jpg</video:thumbnail_loc><video:title>AMAZON LeetCode Medium 1811 “Find Interview Candidates&quot; Interview SQL Question Explanation | EDS</video:title><video:description>AMAZON LeetCode Medium 1811 “Find Interview Candidates&quot; Interview SQL Question Explanation | EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/u281-jsR6bw</video:player_loc><video:duration>1048</video:duration><video:publication_date>2022-11-07T03:30:21.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/find-the-quiet-students-in-all-exams-leetcode-1412</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/4TbTwuWO010/hqdefault.jpg</video:thumbnail_loc><video:title>YAHOO LeetCode Hard 1412 “Quiet Students in All Exams&quot; Interview SQL Question Explanation | EDS</video:title><video:description>YAHOO LeetCode Hard 1412 “Quiet Students in All Exams&quot; Interview SQL Question Explanation | EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/4TbTwuWO010</video:player_loc><video:duration>662</video:duration><video:publication_date>2022-11-09T04:00:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/suspicious-bank-accounts-leetcode-1843</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8KcDP6t5BEE/hqdefault.jpg</video:thumbnail_loc><video:title>JP MORGAN LeetCode Medium “Suspicious Bank Accounts&quot; 1843 Interview SQL Question Explanation | EDS</video:title><video:description>JP MORGAN LeetCode Medium “Suspicious Bank Accounts&quot; 1843 Interview SQL Question Explanation | EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8KcDP6t5BEE</video:player_loc><video:duration>805</video:duration><video:publication_date>2022-11-25T03:30:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/all-the-pairs-with-the-maximum-number-of-common-followers-leetcode-1951</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/xSsCv5aTgwM/hqdefault.jpg</video:thumbnail_loc><video:title>INSTAGRAM LeetCode Medium “Pairs With Maximum Common Followers&quot; 1951 Interview SQL Question | EDS</video:title><video:description>INSTAGRAM LeetCode Medium “Pairs With Maximum Common Followers&quot; 1951 Interview SQL Question | EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/xSsCv5aTgwM</video:player_loc><video:duration>580</video:duration><video:publication_date>2022-11-27T03:30:13.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/report-contiguous-dates-leetcode-1225</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/oh1YtWsN5cw/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode Hard 1225: Find Continuous Dates META Advanced SQL Data Science Interview Question Solved!</video:title><video:description>Leetcode Hard 1225: Find Continuous Dates META Advanced SQL Data Science Interview Question Solved!. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/oh1YtWsN5cw</video:player_loc><video:duration>746</video:duration><video:publication_date>2024-04-03T02:30:21.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/find-expensive-cities-leetcode-2987</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/98KlvdbY8Jo/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode 2987 - Find Expensive Cities - Solved by Everyday Data Science | WINDOW Functions</video:title><video:description>Leetcode 2987 - Find Expensive Cities - Solved by Everyday Data Science | WINDOW Functions. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/98KlvdbY8Jo</video:player_loc><video:duration>258</video:duration><video:publication_date>2024-06-22T06:30:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/election-results-leetcode-2820</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/XRsIKlCfnUY/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 2820 - Election Results WINDOW SUM() RANK() - Solved by Everyday Data Science</video:title><video:description>Leetcode MEDIUM 2820 - Election Results WINDOW SUM() RANK() - Solved by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/XRsIKlCfnUY</video:player_loc><video:duration>428</video:duration><video:publication_date>2024-06-25T14:45:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/status-of-flight-tickets-leetcode-2793</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/IUHAMq62nJQ/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 2793 - Status of Flight Ticket WINDOW RANK() CASE WHEN-Solved by Everyday Data Science</video:title><video:description>Leetcode HARD 2793 - Status of Flight Ticket WINDOW RANK() CASE WHEN-Solved by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/IUHAMq62nJQ</video:player_loc><video:duration>380</video:duration><video:publication_date>2024-06-26T14:30:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/consecutive-available-seats-ii-leetcode-3140</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/zT4cgA8ywDA/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3140 - Consecutive Available Seats II RANKING SQL - Solved by Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3140 - Consecutive Available Seats II RANKING SQL - Solved by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/zT4cgA8ywDA</video:player_loc><video:duration>513</video:duration><video:publication_date>2024-06-30T15:45:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/market-analysis-ii-leetcode-1159</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/WX1ZMgorNl0/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 1159 - Market Analysis II COUNT WINDOW FUNCTIONS - Explained by Everyday Data Science</video:title><video:description>Leetcode HARD 1159 - Market Analysis II COUNT WINDOW FUNCTIONS - Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/WX1ZMgorNl0</video:player_loc><video:duration>684</video:duration><video:publication_date>2024-07-14T02:00:18.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/active-users-leetcode-1454</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/0fNMcaj6x7g/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 1454 - Active Users - How to find CONSECUTIVE Anything - Explained by EDS</video:title><video:description>Leetcode MEDIUM 1454 - Active Users - How to find CONSECUTIVE Anything - Explained by EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/0fNMcaj6x7g</video:player_loc><video:duration>576</video:duration><video:publication_date>2024-07-16T02:00:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/first-and-last-call-on-the-same-day-leetcode-1972</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/XRKh_KpoLE0/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 1972 - First &amp; Last Call on Same Day - FIRST_VALUE() WINDOW Function -Explained by EDS</video:title><video:description>Leetcode HARD 1972 - First &amp; Last Call on Same Day - FIRST_VALUE() WINDOW Function -Explained by EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/XRKh_KpoLE0</video:player_loc><video:duration>594</video:duration><video:publication_date>2024-07-18T02:00:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/longest-winning-streak-leetcode-2173</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/JDCmqo3YAy8/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 2173 - Longest Winning Streak - DOUBLE RANKING DIFFERENCE - Solved &amp; Explained by EDS</video:title><video:description>Leetcode HARD 2173 - Longest Winning Streak - DOUBLE RANKING DIFFERENCE - Solved &amp; Explained by EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/JDCmqo3YAy8</video:player_loc><video:duration>890</video:duration><video:publication_date>2024-07-19T02:00:13.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/products-with-three-or-more-orders-in-two-consecutive-years-leetcode-2292</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/lHI3Mwm9eqc/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 2292 - Products with 3 or More Orders in 2 Consecutive Years - Explained by EDS</video:title><video:description>Leetcode MEDIUM 2292 - Products with 3 or More Orders in 2 Consecutive Years - Explained by EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/lHI3Mwm9eqc</video:player_loc><video:duration>668</video:duration><video:publication_date>2024-07-20T02:00:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/compute-the-rank-as-a-percentage-leetcode-2346</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/qp-hfAQhHzM/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 2346 - Compute RANK as Percentage - RANK &amp; COUNT WINDOW Functions - Explained by EDS</video:title><video:description>Leetcode MEDIUM 2346 - Compute RANK as Percentage - RANK &amp; COUNT WINDOW Functions - Explained by EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/qp-hfAQhHzM</video:player_loc><video:duration>452</video:duration><video:publication_date>2024-07-21T02:00:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/customers-with-strictly-increasing-purchases-leetcode-2474</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/An0UmXUphvo/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 2474 - Customers with Strictly Increasing Purchase -Explained by Everyday Data Science</video:title><video:description>Leetcode HARD 2474 - Customers with Strictly Increasing Purchase -Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/An0UmXUphvo</video:player_loc><video:duration>914</video:duration><video:publication_date>2024-07-22T02:00:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/year-on-year-growth-rate-leetcode-3214</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/VCj6FMJ966I/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 3214 - Year on Year Growth Rate LAG() WINDOW - Explained by Everyday Data Science</video:title><video:description>Leetcode HARD 3214 - Year on Year Growth Rate LAG() WINDOW - Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/VCj6FMJ966I</video:player_loc><video:duration>413</video:duration><video:publication_date>2024-07-25T02:00:13.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/find-longest-calls-leetcode-3124</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/oILN4dBELas/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3124 - Find Longest Calls RANKING in SQL - Explained by Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3124 - Find Longest Calls RANKING in SQL - Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/oILN4dBELas</video:player_loc><video:duration>465</video:duration><video:publication_date>2024-07-29T02:00:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/top-percentile-fraud-leetcode-3055</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/mctr-wqLWBU/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3055 - Top Percentile Fraud PERCENT_RANK() SQL - Explained by Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3055 - Top Percentile Fraud PERCENT_RANK() SQL - Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/mctr-wqLWBU</video:player_loc><video:duration>401</video:duration><video:publication_date>2024-07-31T02:00:21.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/manager-of-the-largest-department-leetcode-2988</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/A6ERf9ugRPU/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 2988 - Manager Largest Department COUNT WINDOW - Explained by Everyday Data Science</video:title><video:description>Leetcode MEDIUM 2988 - Manager Largest Department COUNT WINDOW - Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/A6ERf9ugRPU</video:player_loc><video:duration>345</video:duration><video:publication_date>2024-08-05T02:00:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/find-third-transaction-leetcode-2986</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/0XC3tnLudUk/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 2986 - Find Third Transaction RANK() WINDOW - Explained by Everyday Data Science</video:title><video:description>Leetcode MEDIUM 2986 - Find Third Transaction RANK() WINDOW - Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/0XC3tnLudUk</video:player_loc><video:duration>561</video:duration><video:publication_date>2024-08-06T03:00:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/find-peak-calling-hours-for-each-city-leetcode-2984</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/nOxZcNrtFYU/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 2984 - Find Peak Calling Hour RANK() WINDOW - Explained by Everyday Data Science</video:title><video:description>Leetcode MEDIUM 2984 - Find Peak Calling Hour RANK() WINDOW - Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/nOxZcNrtFYU</video:player_loc><video:duration>349</video:duration><video:publication_date>2024-08-08T02:00:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/premier-league-table-ranking-leetcode-3246</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/IeG1rs8fXd4/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode 3246 - Premier League Ranking ORDER RANK() WINDOW - Explained by Everyday Data Science</video:title><video:description>Leetcode 3246 - Premier League Ranking ORDER RANK() WINDOW - Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/IeG1rs8fXd4</video:player_loc><video:duration>236</video:duration><video:publication_date>2024-08-09T02:00:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/find-cumulative-salary-of-an-employee-leetcode-579</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/AfV4E7BGy70/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 579 - Cumulative Salary of Employee RANGE vs ROW BETWEEN in SQL - Explained by EDS</video:title><video:description>Leetcode HARD 579 - Cumulative Salary of Employee RANGE vs ROW BETWEEN in SQL - Explained by EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/AfV4E7BGy70</video:player_loc><video:duration>557</video:duration><video:publication_date>2024-08-12T02:00:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/human-traffic-of-stadium-leetcode-601</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/gXD6zMlnr7s/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 601 - Human Traffic of Stadium CONSECUTIVE VALUES in SQL - Explained by EDS</video:title><video:description>Leetcode HARD 601 - Human Traffic of Stadium CONSECUTIVE VALUES in SQL - Explained by EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/gXD6zMlnr7s</video:player_loc><video:duration>375</video:duration><video:publication_date>2024-08-14T02:00:17.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/game-play-analysis-v-leetcode-1097</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5u0wpF3i60U/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 1097 - Game Play Analysis 5 RANK DATEDIFF CASE WHEN in SQL - Explained by EDS</video:title><video:description>Leetcode HARD 1097 - Game Play Analysis 5 RANK DATEDIFF CASE WHEN in SQL - Explained by EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5u0wpF3i60U</video:player_loc><video:duration>490</video:duration><video:publication_date>2024-08-16T02:00:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/premier-league-table-ranking-ii-leetcode-3252</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/DWr2yp-geSU/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3252 - Premier League Table Ranking 2 WINDOW - Explained by Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3252 - Premier League Table Ranking 2 WINDOW - Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/DWr2yp-geSU</video:player_loc><video:duration>597</video:duration><video:publication_date>2024-08-23T02:00:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/change-null-values-in-a-table-to-the-previous-value-leetcode-2388</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YaPY--4sGwQ/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 2388 - Change NULL Values to Previous Value - SQL Explained by Everyday Data Science</video:title><video:description>Leetcode MEDIUM 2388 - Change NULL Values to Previous Value - SQL Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YaPY--4sGwQ</video:player_loc><video:duration>631</video:duration><video:publication_date>2024-09-23T02:00:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/count-artist-occurrences-on-spotify-ranking-list-leetcode-2669</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/-V3cNYNJ-y4/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode 2669 - Count Artist Occurrence on Spotify - Complete SQL Explained by Everyday Data Science</video:title><video:description>Leetcode 2669 - Count Artist Occurrence on Spotify - Complete SQL Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/-V3cNYNJ-y4</video:player_loc><video:duration>156</video:duration><video:publication_date>2024-09-27T02:00:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/find-active-users-leetcode-2688</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/h1Bn3K5WJYo/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 2688 - Find Active Users - LEAD Window Func SQL Explained by Everyday Data Science</video:title><video:description>Leetcode MEDIUM 2688 - Find Active Users - LEAD Window Func SQL Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/h1Bn3K5WJYo</video:player_loc><video:duration>328</video:duration><video:publication_date>2024-09-30T02:00:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/customers-with-maximum-number-of-transactions-on-leetcode-2752</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/3-v2PY1APkg/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 2752 - Customers with Maximum Transactions on Consecutive Days : Everyday Data Science</video:title><video:description>Leetcode HARD 2752 - Customers with Maximum Transactions on Consecutive Days : Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/3-v2PY1APkg</video:player_loc><video:duration>503</video:duration><video:publication_date>2024-10-10T02:00:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/flight-occupancy-and-waitlist-analysis-leetcode-2783</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/mMumWOtRn4c/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 2783 - Flight Occupancy &amp; Waitlist - Rolling Count in SQL | Everyday Data Science</video:title><video:description>Leetcode MEDIUM 2783 - Flight Occupancy &amp; Waitlist - Rolling Count in SQL | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/mMumWOtRn4c</video:player_loc><video:duration>595</video:duration><video:publication_date>2024-10-13T02:00:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/rolling-average-steps-leetcode-2854</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/iLy1DefQcFY/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 2854 - Rolling Average Steps - Using ROWS BETWEEN in SQL | Everyday Data Science</video:title><video:description>Leetcode MEDIUM 2854 - Rolling Average Steps - Using ROWS BETWEEN in SQL | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/iLy1DefQcFY</video:player_loc><video:duration>608</video:duration><video:publication_date>2024-10-16T02:00:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/market-analysis-iii-leetcode-2922</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/w7XFsyk92yE/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 2922 - Market Analysis III - Using DENSE_RANK Window in SQL | Everyday Data Science</video:title><video:description>Leetcode MEDIUM 2922 - Market Analysis III - Using DENSE_RANK Window in SQL | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/w7XFsyk92yE</video:player_loc><video:duration>549</video:duration><video:publication_date>2024-10-23T02:00:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/premier-league-table-ranking-iii-leetcode-3322</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/kuJ1EHIRLiI/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3322 - Premier League Table Ranking III - RANKING in SQL | Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3322 - Premier League Table Ranking III - RANKING in SQL | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/kuJ1EHIRLiI</video:player_loc><video:duration>407</video:duration><video:publication_date>2024-10-29T02:00:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/second-highest-salary-ii-leetcode-3338</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/h-WCtL1i6Ng/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3338 - Second Highest Salary II - Window Functions in SQL | Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3338 - Second Highest Salary II - Window Functions in SQL | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/h-WCtL1i6Ng</video:player_loc><video:duration>240</video:duration><video:publication_date>2024-11-02T02:00:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/find-top-performing-driver-leetcode-3308</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/5nqIaNYH3T0/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3308 - Find Top Performing Driver - ROW_NUMBER() in SQL | Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3308 - Find Top Performing Driver - ROW_NUMBER() in SQL | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/5nqIaNYH3T0</video:player_loc><video:duration>761</video:duration><video:publication_date>2024-11-07T03:00:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/viewers-turned-streamers-leetcode-2995</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/dcdNpx9eD5A/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 2995 - Viewers Turned Streamers - ROW_NUMBER() Ranking in SQL | Everyday Data Science</video:title><video:description>Leetcode HARD 2995 - Viewers Turned Streamers - ROW_NUMBER() Ranking in SQL | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/dcdNpx9eD5A</video:player_loc><video:duration>392</video:duration><video:publication_date>2024-11-12T03:00:27.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/seasonal-sales-analysis-leetcode-3564</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Vi4-AraAvgk/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3564 - WINDOW FUNCTIONS in SQL - Seasonal Sales Analysis | Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3564 - WINDOW FUNCTIONS in SQL - Seasonal Sales Analysis | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Vi4-AraAvgk</video:player_loc><video:duration>658</video:duration><video:publication_date>2025-06-27T14:30:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/find-consistently-improving-employees-leetcode-3580</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/buuXCTHkajo/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3580 - RANKING in SQL - Consistently Improving Employees | Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3580 - RANKING in SQL - Consistently Improving Employees | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/buuXCTHkajo</video:player_loc><video:duration>684</video:duration><video:publication_date>2025-07-20T02:00:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/find-covid-recovery-patients-leetcode-3586</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/iAL40APcwOo/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3586 - WINDOW SELF JOINs in SQL - COVID Recovery Patients | Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3586 - WINDOW SELF JOINs in SQL - COVID Recovery Patients | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/iAL40APcwOo</video:player_loc><video:duration>856</video:duration><video:publication_date>2025-07-23T02:00:38.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/find-churn-risk-customers-leetcode-3716</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/mSQx0QDmRWg/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3716 - ROW_NUMBER() Ranking in SQL - Churn Risk Customer | Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3716 - ROW_NUMBER() Ranking in SQL - Churn Risk Customer | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/mSQx0QDmRWg</video:player_loc><video:duration>626</video:duration><video:publication_date>2025-10-19T02:00:48.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/merge-overlapping-events-in-the-same-hall-leetcode-2494</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/tmJ4ATzWCRI/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 2494 - Running Totals with Window Functions in SQL Explained | Everyday Data Science</video:title><video:description>Leetcode HARD 2494 - Running Totals with Window Functions in SQL Explained | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/tmJ4ATzWCRI</video:player_loc><video:duration>574</video:duration><video:publication_date>2025-11-03T03:01:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/user-activities-within-time-bounds-leetcode-3060</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/mrpCNZDA0gc/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 3060 - Self Joins Vs Window Functions in SQL Explained | Everyday Data Science</video:title><video:description>Leetcode HARD 3060 - Self Joins Vs Window Functions in SQL Explained | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/mrpCNZDA0gc</video:player_loc><video:duration>691</video:duration><video:publication_date>2025-11-17T03:01:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/most-common-course-pairs-leetcode-3764</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/fjyUiarT26I/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 3764 - Window Functions in SQL - Most Common Course Pairs | Everyday Data Science</video:title><video:description>Leetcode HARD 3764 - Window Functions in SQL - Most Common Course Pairs | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/fjyUiarT26I</video:player_loc><video:duration>609</video:duration><video:publication_date>2026-01-12T03:01:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/find-emotionally-consistent-users-leetcode-3808</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/l8d1ps_WVz4/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3808 - 3 Window Functions in 1 SQL Query - Find Emotionally Consistent Users | EDS</video:title><video:description>Leetcode MEDIUM 3808 - 3 Window Functions in 1 SQL Query - Find Emotionally Consistent Users | EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/l8d1ps_WVz4</video:player_loc><video:duration>604</video:duration><video:publication_date>2026-01-25T03:00:54.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/window-functions/find-users-with-persistent-behavior-patterns-leetcode-3832</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ev16mF_l0PY/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 3832 - Window Functions in SQL - Users with Persistent Behavior Patterns | EDS</video:title><video:description>Leetcode HARD 3832 - Window Functions in SQL - Users with Persistent Behavior Patterns | EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ev16mF_l0PY</video:player_loc><video:duration>627</video:duration><video:publication_date>2026-02-23T03:00:42.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/date-and-time/unique-orders-and-customers-per-month-leetcode-1565</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/S9nZUOV5wMY/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1565 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1565 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/S9nZUOV5wMY</video:player_loc><video:duration>594</video:duration><video:publication_date>2022-02-17T00:00:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/date-and-time/the-latest-login-in-2020-leetcode-1890</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/KIKtWCeydV8/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1890 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1890 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/KIKtWCeydV8</video:player_loc><video:duration>773</video:duration><video:publication_date>2022-03-08T11:45:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/date-and-time/convert-date-format-leetcode-1853</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9zhkP4N9Ico/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1853 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1853 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9zhkP4N9Ico</video:player_loc><video:duration>221</video:duration><video:publication_date>2022-03-22T11:00:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/date-and-time/list-the-products-ordered-in-a-period-leetcode-1327</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/2wyfpYerar8/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1327 Amazon Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1327 Amazon Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/2wyfpYerar8</video:player_loc><video:duration>427</video:duration><video:publication_date>2022-04-06T11:00:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/date-and-time/customer-order-frequency-leetcode-1511</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/AEBV0mZ9Ee4/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1511 Amazon &amp; Facebook Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1511 Amazon &amp; Facebook Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/AEBV0mZ9Ee4</video:player_loc><video:duration>836</video:duration><video:publication_date>2022-04-09T11:00:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/date-and-time/monthly-transactions-i-leetcode-1193</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/KYgixVTtTxs/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1193 Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 1193 Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/KYgixVTtTxs</video:player_loc><video:duration>540</video:duration><video:publication_date>2022-05-21T11:00:21.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/date-and-time/sales-by-day-of-the-week-leetcode-1479</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/HtSLEIf9CHI/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Hard 1479 &quot;Sales by Day of the Week&quot; Amazon Interview SQL Question with Explanation</video:title><video:description>LeetCode Hard 1479 &quot;Sales by Day of the Week&quot; Amazon Interview SQL Question with Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/HtSLEIf9CHI</video:player_loc><video:duration>891</video:duration><video:publication_date>2022-06-14T02:00:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/date-and-time/tasks-count-in-the-weekend-leetcode-2298</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/VdbDHgzmzkU/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 2298 &quot;Tasks Count in the Weekend&quot; Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 2298 &quot;Tasks Count in the Weekend&quot; Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/VdbDHgzmzkU</video:player_loc><video:duration>504</video:duration><video:publication_date>2022-06-16T02:30:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/date-and-time/user-activity-for-the-past-30-days-i-leetcode-1141</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Pyy-OlcV0-k/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1141 &quot;User Activity Past 30 Days I&quot; Meta Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode 1141 &quot;User Activity Past 30 Days I&quot; Meta Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Pyy-OlcV0-k</video:player_loc><video:duration>372</video:duration><video:publication_date>2022-08-08T03:00:17.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/date-and-time/friendly-movies-streamed-last-month-leetcode-1495</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/a9DuCoNd618/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1495 &quot;Friendly Movies Streamed Last Month&quot; Amazon Interview SQL Question with Explanation</video:title><video:description>LeetCode 1495 &quot;Friendly Movies Streamed Last Month&quot; Amazon Interview SQL Question with Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/a9DuCoNd618</video:player_loc><video:duration>406</video:duration><video:publication_date>2022-08-12T03:00:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/date-and-time/user-activity-for-the-past-30-days-ii-leetcode-1142</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/mcohcIyaImA/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1142 &quot;User Activity for the Past 30 Days II&quot; Netflix Interview SQL Question Explanation</video:title><video:description>LeetCode 1142 &quot;User Activity for the Past 30 Days II&quot; Netflix Interview SQL Question Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/mcohcIyaImA</video:player_loc><video:duration>433</video:duration><video:publication_date>2022-08-27T03:00:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/date-and-time/users-that-actively-request-confirmation-messages-leetcode-1939</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/FSHl8X4WOvc/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1939 &quot;Users That Actively Request Confirmation Messages&quot; Interview SQL Question Explanation</video:title><video:description>LeetCode 1939 &quot;Users That Actively Request Confirmation Messages&quot; Interview SQL Question Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/FSHl8X4WOvc</video:player_loc><video:duration>682</video:duration><video:publication_date>2022-09-16T03:00:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/date-and-time/rising-temperature-leetcode-197</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/b3LphTjCZ8o/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 197 &quot;Rising Temperature&quot; Amazon &amp; Adobe Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode 197 &quot;Rising Temperature&quot; Amazon &amp; Adobe Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/b3LphTjCZ8o</video:player_loc><video:duration>580</video:duration><video:publication_date>2022-09-20T03:00:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/date-and-time/users-with-two-purchases-within-seven-days-leetcode-2228</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/AXN1w4NX8ns/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 2228 Amazon “Users With 2 Purchases Within 7 Day&quot; Interview SQL Question Explanation</video:title><video:description>LeetCode Medium 2228 Amazon “Users With 2 Purchases Within 7 Day&quot; Interview SQL Question Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/AXN1w4NX8ns</video:player_loc><video:duration>603</video:duration><video:publication_date>2022-09-25T03:00:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/date-and-time/the-number-of-users-that-are-eligible-for-discount-leetcode-2205</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/hsvvkkVDnH0/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 2205 &quot;Number of Users Eligible for Discount&quot; Interview SQL Question Detailed Explanation</video:title><video:description>LeetCode 2205 &quot;Number of Users Eligible for Discount&quot; Interview SQL Question Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/hsvvkkVDnH0</video:player_loc><video:duration>426</video:duration><video:publication_date>2022-10-23T02:30:23.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/date-and-time/the-users-that-are-eligible-for-discount-leetcode-2230</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Ldfq2j3jbP0/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 2230 &quot;Users That Are Eligible for Discount&quot; Interview SQL Question Detailed Explanation</video:title><video:description>LeetCode 2230 &quot;Users That Are Eligible for Discount&quot; Interview SQL Question Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Ldfq2j3jbP0</video:player_loc><video:duration>382</video:duration><video:publication_date>2022-10-30T02:30:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/date-and-time/employees-with-deductions-leetcode-2394</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/nMUN4BfW6T8/hqdefault.jpg</video:thumbnail_loc><video:title>AMAZON LeetCode Medium “Employees With Deductions&quot; 2394 Interview SQL Question Explanation | EDS</video:title><video:description>AMAZON LeetCode Medium “Employees With Deductions&quot; 2394 Interview SQL Question Explanation | EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/nMUN4BfW6T8</video:player_loc><video:duration>602</video:duration><video:publication_date>2022-11-19T03:30:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/date-and-time/new-users-daily-count-leetcode-1107</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/kkJxSwCnzpM/hqdefault.jpg</video:thumbnail_loc><video:title>LINKEDIN LeetCode Medium “New Users Daily Count&quot; 1107 Interview SQL Question Explanation | EDS</video:title><video:description>LINKEDIN LeetCode Medium “New Users Daily Count&quot; 1107 Interview SQL Question Explanation | EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/kkJxSwCnzpM</video:player_loc><video:duration>516</video:duration><video:publication_date>2022-11-20T03:30:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/date-and-time/second-day-verification-leetcode-3172</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/v7B6vLdJZQs/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode 3172 - Second Day Verification - Solved &amp; Explained by Everyday Data Science |Job Interview</video:title><video:description>Leetcode 3172 - Second Day Verification - Solved &amp; Explained by Everyday Data Science |Job Interview. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/v7B6vLdJZQs</video:player_loc><video:duration>431</video:duration><video:publication_date>2024-06-12T02:15:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/date-and-time/calculate-parking-fees-and-duration-leetcode-3166</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/U2PqfM5p3cY/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3166 - Parking Fees &amp; Duration - Solved &amp; Explained by Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3166 - Parking Fees &amp; Duration - Solved &amp; Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/U2PqfM5p3cY</video:player_loc><video:duration>964</video:duration><video:publication_date>2024-06-13T04:00:25.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/date-and-time/friday-purchases-i-leetcode-2993</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/lGv_Y7gn7xM/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 2993 - Friday Purchases I - Solved by Everyday Data Science | DAYNAME(), WEEK()</video:title><video:description>Leetcode MEDIUM 2993 - Friday Purchases I - Solved by Everyday Data Science | DAYNAME(), WEEK(). Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/lGv_Y7gn7xM</video:player_loc><video:duration>429</video:duration><video:publication_date>2024-06-15T04:59:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/date-and-time/unpopular-books-leetcode-1098</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/uB_FQ-t6tqg/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 1098 - Unpopular Books DATE_SUB() TIMESTAMPDIFF - Explained by Everyday Data Science</video:title><video:description>Leetcode MEDIUM 1098 - Unpopular Books DATE_SUB() TIMESTAMPDIFF - Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/uB_FQ-t6tqg</video:player_loc><video:duration>625</video:duration><video:publication_date>2024-07-11T14:30:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/date-and-time/number-of-accounts-that-did-not-stream-leetcode-2020</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/hTAOpytExo0/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 2020 - Accounts That Did Not Stream - SQL Explained by Everyday Data Science</video:title><video:description>Leetcode MEDIUM 2020 - Accounts That Did Not Stream - SQL Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/hTAOpytExo0</video:player_loc><video:duration>369</video:duration><video:publication_date>2024-09-12T15:00:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/date-and-time/calculate-orders-within-each-interval-leetcode-2893</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/vQ-oS27WBFQ/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 2893 - Orders Within Each Interval - Using CEIL in SQL | Everyday Data Science</video:title><video:description>Leetcode MEDIUM 2893 - Orders Within Each Interval - Using CEIL in SQL | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/vQ-oS27WBFQ</video:player_loc><video:duration>273</video:duration><video:publication_date>2024-10-20T02:00:37.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/date-and-time/monthly-transactions-ii-leetcode-1205</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/zJpPB3tEqXg/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 1205 - FULL JOINs in SQL - Monthly Transactions 2 | Everyday Data Science</video:title><video:description>Leetcode MEDIUM 1205 - FULL JOINs in SQL - Monthly Transactions 2 | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/zJpPB3tEqXg</video:player_loc><video:duration>1024</video:duration><video:publication_date>2024-12-15T03:00:49.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/conditional-logic-case/triangle-judgement-leetcode-610</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/W-0CBw8CHW8/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 610</video:title><video:description>LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 610. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/W-0CBw8CHW8</video:player_loc><video:duration>323</video:duration><video:publication_date>2022-01-20T14:12:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/conditional-logic-case/weather-type-in-each-country-leetcode-1294</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/zcTjxkqBL1M/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1294 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1294 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/zcTjxkqBL1M</video:player_loc><video:duration>503</video:duration><video:publication_date>2022-01-31T00:00:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/conditional-logic-case/create-a-session-bar-chart-leetcode-1435</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Ft0WibN0MDM/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1435 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1435 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Ft0WibN0MDM</video:player_loc><video:duration>1005</video:duration><video:publication_date>2022-02-13T00:00:02.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/conditional-logic-case/calculate-special-bonus-leetcode-1873</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QML2wdAEx54/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1873 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1873 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QML2wdAEx54</video:player_loc><video:duration>312</video:duration><video:publication_date>2022-03-07T12:00:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/conditional-logic-case/apples-oranges-leetcode-1445</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/kRvlxHEIh8w/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1445 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode Medium 1445 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/kRvlxHEIh8w</video:player_loc><video:duration>739</video:duration><video:publication_date>2022-03-13T10:45:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/conditional-logic-case/capital-gainloss-leetcode-1393</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/BA4JC9-ppNY/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1393 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode Medium 1393 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/BA4JC9-ppNY</video:player_loc><video:duration>631</video:duration><video:publication_date>2022-03-15T10:45:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/conditional-logic-case/number-of-calls-between-two-persons-leetcode-1699</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/0p1iSPCeikw/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1699 Facebook/Meta Amazon Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 1699 Facebook/Meta Amazon Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/0p1iSPCeikw</video:player_loc><video:duration>581</video:duration><video:publication_date>2022-03-23T11:00:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/conditional-logic-case/immediate-food-delivery-i-leetcode-1173</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/h9orekQVw7c/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1173 DoorDash Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1173 DoorDash Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/h9orekQVw7c</video:player_loc><video:duration>373</video:duration><video:publication_date>2022-03-27T10:45:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/conditional-logic-case/calculate-salaries-leetcode-1468</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/U2n5CLcVWIc/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1468 Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 1468 Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/U2n5CLcVWIc</video:player_loc><video:duration>487</video:duration><video:publication_date>2022-03-29T11:00:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/conditional-logic-case/customers-who-bought-products-a-and-b-but-not-c-leetcode-1398</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/HPloY232Gt8/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1398 Amazon Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 1398 Amazon Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/HPloY232Gt8</video:player_loc><video:duration>836</video:duration><video:publication_date>2022-03-31T11:00:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/conditional-logic-case/the-winner-university-leetcode-2072</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/0GHdzmamjxA/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 2072 Amazon Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 2072 Amazon Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/0GHdzmamjxA</video:player_loc><video:duration>330</video:duration><video:publication_date>2022-05-03T11:00:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/conditional-logic-case/tree-node-leetcode-608</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/jfE0d4hR--s/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 608 Uber &amp; Amazon Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 608 Uber &amp; Amazon Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/jfE0d4hR--s</video:player_loc><video:duration>410</video:duration><video:publication_date>2022-05-04T11:00:24.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/conditional-logic-case/exchange-seats-leetcode-626</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/c26iq_pkxoI/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 626 Amazon Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode Medium 626 Amazon Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/c26iq_pkxoI</video:player_loc><video:duration>518</video:duration><video:publication_date>2022-05-13T11:00:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/conditional-logic-case/the-category-of-each-member-in-the-store-leetcode-2051</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/B1A5-Og2WVc/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 2051 &quot;Category of Each Member in the Store&quot; Interview SQL Question with Explanation</video:title><video:description>LeetCode Medium 2051 &quot;Category of Each Member in the Store&quot; Interview SQL Question with Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/B1A5-Og2WVc</video:player_loc><video:duration>973</video:duration><video:publication_date>2022-06-20T03:00:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/conditional-logic-case/ads-performance-leetcode-1322</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/UJPj9JNi-Yw/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1322 &quot;Ads Performance&quot; Facebook (Meta) Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode 1322 &quot;Ads Performance&quot; Facebook (Meta) Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/UJPj9JNi-Yw</video:player_loc><video:duration>437</video:duration><video:publication_date>2022-06-30T03:00:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/conditional-logic-case/team-scores-in-football-tournament-leetcode-1212</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/u2rr9ZFHb4U/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1212 &quot;Team Scores in Football Tournament&quot; Wayfair Interview SQL Question Explanation</video:title><video:description>LeetCode Medium 1212 &quot;Team Scores in Football Tournament&quot; Wayfair Interview SQL Question Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/u2rr9ZFHb4U</video:player_loc><video:duration>676</video:duration><video:publication_date>2022-07-18T03:00:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/conditional-logic-case/evaluate-boolean-expression-leetcode-1440</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/YApvVwzcAgs/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1440 Point72 “Evaluate Boolean Expression&quot; Interview SQL Question Explanation</video:title><video:description>LeetCode Medium 1440 Point72 “Evaluate Boolean Expression&quot; Interview SQL Question Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/YApvVwzcAgs</video:player_loc><video:duration>435</video:duration><video:publication_date>2022-10-11T03:00:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/conditional-logic-case/count-salary-categories-leetcode-1907</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/cbN0pdwruFc/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Medium 1907 “Count Salary Categories&quot; Interview SQL Question Explanation | EDS</video:title><video:description>LeetCode Medium 1907 “Count Salary Categories&quot; Interview SQL Question Explanation | EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/cbN0pdwruFc</video:player_loc><video:duration>418</video:duration><video:publication_date>2022-11-10T03:30:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/conditional-logic-case/classifying-triangles-by-lengths-leetcode-3053</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/B_L5NxblwEE/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode 3053 - Classifying Triangles by Lengths - Solved &amp; Explained by Everyday Data Science</video:title><video:description>Leetcode 3053 - Classifying Triangles by Lengths - Solved &amp; Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/B_L5NxblwEE</video:player_loc><video:duration>422</video:duration><video:publication_date>2024-06-17T05:45:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/conditional-logic-case/snaps-analysis-leetcode-3056</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/TYNjJeOJmXE/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3056 - Snaps Analysis - Solved by Everyday Data Science | CASE WHEN ROUND() SUM()</video:title><video:description>Leetcode MEDIUM 3056 - Snaps Analysis - Solved by Everyday Data Science | CASE WHEN ROUND() SUM(). Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/TYNjJeOJmXE</video:player_loc><video:duration>370</video:duration><video:publication_date>2024-06-19T04:15:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/conditional-logic-case/odd-and-even-transactions-leetcode-3220</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Fpv6X1xzOgU/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3220 - Odd and Even Transactions SUM CASE WHEN - Explained by Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3220 - Odd and Even Transactions SUM CASE WHEN - Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Fpv6X1xzOgU</video:player_loc><video:duration>270</video:duration><video:publication_date>2024-07-23T02:00:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/conditional-logic-case/binary-tree-nodes-leetcode-3054</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/iZ-d7In2KX4/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3054 - Binary Tree Nodes CASE WHEN DSA SQL - Explained by Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3054 - Binary Tree Nodes CASE WHEN DSA SQL - Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/iZ-d7In2KX4</video:player_loc><video:duration>273</video:duration><video:publication_date>2024-08-01T02:00:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/conditional-logic-case/maximize-items-leetcode-3052</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/js8EyYxpXAY/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 3052 - Maximize Items FLOOR CASE WHEN SQL - Explained by Everyday Data Science</video:title><video:description>Leetcode HARD 3052 - Maximize Items FLOOR CASE WHEN SQL - Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/js8EyYxpXAY</video:player_loc><video:duration>622</video:duration><video:publication_date>2024-08-02T02:00:19.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/conditional-logic-case/trips-and-users-leetcode-262</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/AFEDK-g2HDc/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 262 - Trips and Users JOINs CASE WHEN GROUP SQL - Explained by Everyday Data Science</video:title><video:description>Leetcode HARD 262 - Trips and Users JOINs CASE WHEN GROUP SQL - Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/AFEDK-g2HDc</video:player_loc><video:duration>474</video:duration><video:publication_date>2024-08-10T02:00:08.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/conditional-logic-case/immediate-food-delivery-iii-leetcode-2686</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/11YCLfjDd5E/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 2686 - Immediate Food Delivery III - Complete SQL Explained by Everyday Data Science</video:title><video:description>Leetcode MEDIUM 2686 - Immediate Food Delivery III - Complete SQL Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/11YCLfjDd5E</video:player_loc><video:duration>353</video:duration><video:publication_date>2024-09-26T02:00:00.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/conditional-logic-case/find-golden-hour-customers-leetcode-3705</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ODVkCRlBFM4/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3705 - Counting with CASE WHEN in SQL - Golden Hour Customer | Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3705 - Counting with CASE WHEN in SQL - Golden Hour Customer | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ODVkCRlBFM4</video:player_loc><video:duration>639</video:duration><video:publication_date>2025-10-13T17:30:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/string-functions/group-sold-products-by-the-date-leetcode-1484</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/2JMccVZcAg8/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1484 Interview SQL Question with Detailed Explanation | GROUP_CONCAT() | Practice SQL</video:title><video:description>LeetCode 1484 Interview SQL Question with Detailed Explanation | GROUP_CONCAT() | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/2JMccVZcAg8</video:player_loc><video:duration>391</video:duration><video:publication_date>2022-02-15T00:00:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/string-functions/invalid-tweets-leetcode-1683</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/LEefv_0MIp4/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1683 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1683 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/LEefv_0MIp4</video:player_loc><video:duration>220</video:duration><video:publication_date>2022-02-25T00:00:07.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/string-functions/fix-names-in-a-table-leetcode-1667</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/e1irnRo4lgg/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1667 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1667 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/e1irnRo4lgg</video:player_loc><video:duration>388</video:duration><video:publication_date>2022-05-26T11:00:16.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/string-functions/fix-product-name-format-leetcode-1543</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/pFG4RfWbRk4/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1543 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1543 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/pFG4RfWbRk4</video:player_loc><video:duration>446</video:duration><video:publication_date>2022-05-28T11:00:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/string-functions/find-users-with-valid-e-mails-leetcode-1517</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/RVnmFDrRHHk/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1517 &quot;Find Users With Valid E-Mails&quot; Apple Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode 1517 &quot;Find Users With Valid E-Mails&quot; Apple Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/RVnmFDrRHHk</video:player_loc><video:duration>492</video:duration><video:publication_date>2022-07-09T03:00:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/string-functions/patients-with-a-condition-leetcode-1527</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/wwDQm_SR20o/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1527 &quot;Patients With a Condition&quot; Interview SQL Question with Detailed Explanation</video:title><video:description>LeetCode 1527 &quot;Patients With a Condition&quot; Interview SQL Question with Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/wwDQm_SR20o</video:player_loc><video:duration>269</video:duration><video:publication_date>2022-08-29T03:00:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/string-functions/finding-the-topic-of-each-post-leetcode-2199</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/_l735tL_SlI/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Hard 2199 Facebook “Finding the Topic of Each Post&quot; Interview SQL Question with Explanation</video:title><video:description>LeetCode Hard 2199 Facebook “Finding the Topic of Each Post&quot; Interview SQL Question with Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/_l735tL_SlI</video:player_loc><video:duration>1063</video:duration><video:publication_date>2022-09-27T03:00:20.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/string-functions/invalid-tweets-ii-leetcode-3150</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/K2vuwHDFXxo/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode 3150 - Invalid Tweets II - Solved by Everyday Data Science | CHAR_LENGTH(), REPLACE()</video:title><video:description>Leetcode 3150 - Invalid Tweets II - Solved by Everyday Data Science | CHAR_LENGTH(), REPLACE(). Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/K2vuwHDFXxo</video:player_loc><video:duration>288</video:duration><video:publication_date>2024-06-14T07:00:09.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/string-functions/pizza-toppings-cost-analysis-leetcode-3050</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/z66jcTm7hC0/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3050 - Pizza Toppings Cost Analysis- Solved by Everyday Data Science | JOIN v CONCAT</video:title><video:description>Leetcode MEDIUM 3050 - Pizza Toppings Cost Analysis- Solved by Everyday Data Science | JOIN v CONCAT. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/z66jcTm7hC0</video:player_loc><video:duration>369</video:duration><video:publication_date>2024-06-20T08:00:36.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/string-functions/concatenate-the-name-and-the-profession-leetcode-2504</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/OJ_w14VF59k/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode 2504 - Concatenate Name &amp; Profession CONCAT() LEFT() - Solved by Everyday Data Science</video:title><video:description>Leetcode 2504 - Concatenate Name &amp; Profession CONCAT() LEFT() - Solved by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/OJ_w14VF59k</video:player_loc><video:duration>195</video:duration><video:publication_date>2024-07-07T14:30:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/string-functions/find-trending-hashtags-leetcode-3087</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/F91O1WWxoFo/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3087 - Find Trending Hashtags REGEX Explained - Solved by Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3087 - Find Trending Hashtags REGEX Explained - Solved by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/F91O1WWxoFo</video:player_loc><video:duration>587</video:duration><video:publication_date>2024-06-28T14:30:05.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/string-functions/find-cities-in-each-state-leetcode-3198</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/H7H-xiOmASA/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode 3198 - Find Cities in Each State GROUP_CONCAT() Explained - Solved by Everyday Data Science</video:title><video:description>Leetcode 3198 - Find Cities in Each State GROUP_CONCAT() Explained - Solved by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/H7H-xiOmASA</video:player_loc><video:duration>255</video:duration><video:publication_date>2024-06-29T14:30:06.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/string-functions/top-three-wineries-leetcode-2991</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/74_hHkYe3Dk/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 2991 - Top Three Wineries MAX IFNULL CONCAT SQL - Explained by Everyday Data Science</video:title><video:description>Leetcode HARD 2991 - Top Three Wineries MAX IFNULL CONCAT SQL - Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/74_hHkYe3Dk</video:player_loc><video:duration>745</video:duration><video:publication_date>2024-08-04T02:00:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/string-functions/build-the-equation-leetcode-2118</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/mxhKhmTkpkg/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 2118 - Build The Equation CONCAT vs GROUP_CONCAT : Explained by Everyday Data Science</video:title><video:description>Leetcode HARD 2118 - Build The Equation CONCAT vs GROUP_CONCAT : Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/mxhKhmTkpkg</video:player_loc><video:duration>539</video:duration><video:publication_date>2024-09-17T02:00:32.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/string-functions/find-cities-in-each-state-ii-leetcode-3328</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/otWg6zsI7dQ/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3328 - Find Cities in Each State II - GROUP_CONCAT in SQL | Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3328 - Find Cities in Each State II - GROUP_CONCAT in SQL | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/otWg6zsI7dQ</video:player_loc><video:duration>478</video:duration><video:publication_date>2024-11-05T03:00:39.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/string-functions/find-valid-emails-leetcode-3436</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/qmgTm5lDgl4/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode 3436 - Regular Expressions (RegEx) in SQL - Find Valid Emails | Everyday Data Science</video:title><video:description>Leetcode 3436 - Regular Expressions (RegEx) in SQL - Find Valid Emails | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/qmgTm5lDgl4</video:player_loc><video:duration>356</video:duration><video:publication_date>2025-01-31T03:00:46.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/string-functions/find-products-with-three-consecutive-digits-leetcode-3415</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/d92of7Wd4bE/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode 3415 - Regular Expressions (RegEx) in SQL - Find Products With Three Consecutive Digits</video:title><video:description>Leetcode 3415 - Regular Expressions (RegEx) in SQL - Find Products With Three Consecutive Digits. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/d92of7Wd4bE</video:player_loc><video:duration>325</video:duration><video:publication_date>2025-02-03T03:00:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/string-functions/dna-pattern-recognition-leetcode-3475</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/QuyaLy-TokU/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3475 - Using REGEX in SQL - DNA Pattern Recognition | Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3475 - Using REGEX in SQL - DNA Pattern Recognition | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/QuyaLy-TokU</video:player_loc><video:duration>381</video:duration><video:publication_date>2025-03-07T03:00:17.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/string-functions/find-products-with-valid-serial-numbers-leetcode-3465</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/ARd3uI0oivo/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode 3465 - Regular Expressions (RegEx) in SQL - Find Products With Valid Serial Numbers</video:title><video:description>Leetcode 3465 - Regular Expressions (RegEx) in SQL - Find Products With Valid Serial Numbers. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/ARd3uI0oivo</video:player_loc><video:duration>490</video:duration><video:publication_date>2025-03-27T02:00:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/string-functions/find-all-unique-email-domains-leetcode-3059</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/LV7UkY5Kka0/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode 3059 - Learn RegEx in SQL - Find All Unique Email Domains | Everyday Data Science</video:title><video:description>Leetcode 3059 - Learn RegEx in SQL - Find All Unique Email Domains | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/LV7UkY5Kka0</video:player_loc><video:duration>459</video:duration><video:publication_date>2025-11-12T03:00:33.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/string-functions/find-invalid-ip-addresses-leetcode-3451</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/9wz35ENpIPk/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode HARD 3451: Find Invalid IP Addresses | SQL REGEX Trick Every Data Scientist Should Know</video:title><video:description>LeetCode HARD 3451: Find Invalid IP Addresses | SQL REGEX Trick Every Data Scientist Should Know. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/9wz35ENpIPk</video:player_loc><video:duration>829</video:duration><video:publication_date>2026-06-21T02:00:21.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/recursive-ctes/find-the-subtasks-that-did-not-execute-leetcode-1767</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/NwZAYQSH81k/hqdefault.jpg</video:thumbnail_loc><video:title>GOOGLE LeetCode Hard 1767 “Subtasks That Did Not Execute&quot; Interview SQL Question Explanation | EDS</video:title><video:description>GOOGLE LeetCode Hard 1767 “Subtasks That Did Not Execute&quot; Interview SQL Question Explanation | EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/NwZAYQSH81k</video:player_loc><video:duration>626</video:duration><video:publication_date>2022-11-13T03:30:04.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/recursive-ctes/find-the-missing-ids-leetcode-1613</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/WX9WLJOslHs/hqdefault.jpg</video:thumbnail_loc><video:title>AMAZON LeetCode Medium 1613 “Find the Missing IDs&quot; Interview SQL Question Explanation | EDS</video:title><video:description>AMAZON LeetCode Medium 1613 “Find the Missing IDs&quot; Interview SQL Question Explanation | EDS. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/WX9WLJOslHs</video:player_loc><video:duration>364</video:duration><video:publication_date>2022-11-14T03:30:13.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/recursive-ctes/find-the-subtasks-that-did-not-execute-leetcode-1767-2</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8VA2XWZvYNA/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode Hard 1767 Google Interview Question Explained - Recursive CTE Advanced SQL Data Science</video:title><video:description>Leetcode Hard 1767 Google Interview Question Explained - Recursive CTE Advanced SQL Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8VA2XWZvYNA</video:player_loc><video:duration>637</video:duration><video:publication_date>2024-04-02T02:30:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/recursive-ctes/ceo-subordinate-hierarchy-leetcode-3236</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/F3RU6wnRyLc/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 3236 - RECURSIVE CTE SQL Explained - CEO Subordinate Hierarchy | Everyday Data Science</video:title><video:description>Leetcode HARD 3236 - RECURSIVE CTE SQL Explained - CEO Subordinate Hierarchy | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/F3RU6wnRyLc</video:player_loc><video:duration>725</video:duration><video:publication_date>2024-11-27T03:00:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/recursive-ctes/find-median-given-frequency-of-numbers-leetcode-571</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/A1s3hFTx2G8/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 571 - Decompressing Tables with Recursive CTE - Find Median | Everyday Data Science</video:title><video:description>Leetcode HARD 571 - Decompressing Tables with Recursive CTE - Find Median | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/A1s3hFTx2G8</video:player_loc><video:duration>803</video:duration><video:publication_date>2024-12-06T03:00:12.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/recursive-ctes/number-of-transactions-per-visit-leetcode-1336</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/aCb49Ilv_1E/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 1336 - RECURSIVE CTE SQL Explained - Transactions Per Visit | Everyday Data Science</video:title><video:description>Leetcode HARD 1336 - RECURSIVE CTE SQL Explained - Transactions Per Visit | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/aCb49Ilv_1E</video:player_loc><video:duration>962</video:duration><video:publication_date>2024-12-18T03:00:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/recursive-ctes/hopper-company-queries-i-leetcode-1635</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/gUqMdxi-S-c/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 1635 - RECURSIVE CTE SQL Explained - Hopper Company Queries 1 | Everyday Data Science</video:title><video:description>Leetcode HARD 1635 - RECURSIVE CTE SQL Explained - Hopper Company Queries 1 | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/gUqMdxi-S-c</video:player_loc><video:duration>788</video:duration><video:publication_date>2024-12-28T03:00:26.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/recursive-ctes/hopper-company-queries-ii-leetcode-1645</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/iTiP8PjigB0/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 1645 - RECURSIVE CTE SQL Explained - Hopper Company Queries 2 | Everyday Data Science</video:title><video:description>Leetcode HARD 1645 - RECURSIVE CTE SQL Explained - Hopper Company Queries 2 | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/iTiP8PjigB0</video:player_loc><video:duration>804</video:duration><video:publication_date>2025-01-08T03:00:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/recursive-ctes/students-report-by-geography-leetcode-618</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Eoyg3c6Xc1o/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 618 - RECURSIVE CTE SQL Explained - Student Report by Geography |Everyday Data Science</video:title><video:description>Leetcode HARD 618 - RECURSIVE CTE SQL Explained - Student Report by Geography |Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Eoyg3c6Xc1o</video:player_loc><video:duration>661</video:duration><video:publication_date>2025-04-18T02:00:11.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/recursive-ctes/friday-purchases-ii-leetcode-2994</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/CNu8kFwsogc/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 2994 - RECURSIVE Common Table Expressions in SQL Explained | Everyday Data Science</video:title><video:description>Leetcode HARD 2994 - RECURSIVE Common Table Expressions in SQL Explained | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/CNu8kFwsogc</video:player_loc><video:duration>943</video:duration><video:publication_date>2025-09-29T02:00:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/recursive-ctes/friday-purchase-iii-leetcode-3118</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/LhrmXhEq5n0/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3118 - RECURSIVE CTE Concept in SQL - Friday Purchases 3 | Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3118 - RECURSIVE CTE Concept in SQL - Friday Purchases 3 | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/LhrmXhEq5n0</video:player_loc><video:duration>959</video:duration><video:publication_date>2025-10-05T02:00:18.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/recursive-ctes/hopper-company-queries-iii-leetcode-1651</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/rIEadIaKn7o/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 1651 - Asked in UBER Interview RECURSIVE CTE in SQL Explained | Everyday Data Science</video:title><video:description>Leetcode HARD 1651 - Asked in UBER Interview RECURSIVE CTE in SQL Explained | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/rIEadIaKn7o</video:player_loc><video:duration>879</video:duration><video:publication_date>2025-10-27T02:00:49.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/recursive-ctes/analyze-organization-hierarchy-leetcode-3482</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/X2OiMQvhSGY/hqdefault.jpg</video:thumbnail_loc><video:title>Most People Fail This SQL Interview Question | LeetCode HARD 3482 - Recursive CTE Logic Explained</video:title><video:description>Most People Fail This SQL Interview Question | LeetCode HARD 3482 - Recursive CTE Logic Explained. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/X2OiMQvhSGY</video:player_loc><video:duration>1704</video:duration><video:publication_date>2026-06-08T02:00:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/recursive-ctes/first-letter-capitalization-leetcode-3368</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/qimMfE4NToY/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 3368 - Recursive CTE Trick That Solves Hardest String Problem | SQL Tutorial</video:title><video:description>Leetcode HARD 3368 - Recursive CTE Trick That Solves Hardest String Problem | SQL Tutorial. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/qimMfE4NToY</video:player_loc><video:duration>1025</video:duration><video:publication_date>2026-07-11T20:45:28.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/pivoting/rearrange-products-table-leetcode-1795</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/mSh7NS_zoJE/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1795 Interview SQL Question with Detailed Explanation | Practice SQL</video:title><video:description>LeetCode 1795 Interview SQL Question with Detailed Explanation | Practice SQL. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/mSh7NS_zoJE</video:player_loc><video:duration>725</video:duration><video:publication_date>2022-03-16T10:45:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/pivoting/products-price-for-each-store-leetcode-1777</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/n5CDWrSGciE/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1777 Amazon &quot;Product&apos;s Price for Each Store&quot; Interview SQL Question Detailed Explanation</video:title><video:description>LeetCode 1777 Amazon &quot;Product&apos;s Price for Each Store&quot; Interview SQL Question Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/n5CDWrSGciE</video:player_loc><video:duration>430</video:duration><video:publication_date>2022-10-01T03:00:31.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/pivoting/reformat-department-table-leetcode-1179</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/RJfqIYG5yXs/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode 1179 Amazon &quot;Reformat Department Table&quot; Interview SQL Question Detailed Explanation</video:title><video:description>LeetCode 1179 Amazon &quot;Reformat Department Table&quot; Interview SQL Question Detailed Explanation. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/RJfqIYG5yXs</video:player_loc><video:duration>391</video:duration><video:publication_date>2022-10-04T03:00:15.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/data-modification/swap-sex-of-employees-leetcode-627</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/2AnzabKXZRs/hqdefault.jpg</video:thumbnail_loc><video:title>LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 627</video:title><video:description>LeetCode Interview SQL Question with Detailed Explanation | Practice SQL | LeetCode 627. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/2AnzabKXZRs</video:player_loc><video:duration>444</video:duration><video:publication_date>2022-01-25T00:00:01.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/advanced-interview-mix/bitwise-user-permissions-analysis-leetcode-3204</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Kgn5bYiPseA/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 3204 - Bitwise User Permissions Analysis - Explained by Everyday Data Science</video:title><video:description>Leetcode MEDIUM 3204 - Bitwise User Permissions Analysis - Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Kgn5bYiPseA</video:player_loc><video:duration>343</video:duration><video:publication_date>2024-07-28T02:00:10.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/advanced-interview-mix/the-number-of-passengers-in-each-bus-i-leetcode-2142</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/8sfTeQmpcMw/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode MEDIUM 2142 - Number of Passengers in Each Bus 1 - SQL Explained by Everyday Data Science</video:title><video:description>Leetcode MEDIUM 2142 - Number of Passengers in Each Bus 1 - SQL Explained by Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/8sfTeQmpcMw</video:player_loc><video:duration>622</video:duration><video:publication_date>2024-09-19T02:00:03.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/advanced-interview-mix/user-purchase-platform-leetcode-1127</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/g18btfnaKkc/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 1127 - Easy Solution Fully Explained - User Purchase Platform | Everyday Data Science</video:title><video:description>Leetcode HARD 1127 - Easy Solution Fully Explained - User Purchase Platform | Everyday Data Science. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/g18btfnaKkc</video:player_loc><video:duration>813</video:duration><video:publication_date>2024-12-11T03:00:30.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
<url><loc>https://mik-academy.vercel.app/sql/advanced-interview-mix/find-students-with-study-spiral-pattern-leetcode-3617</loc><lastmod>2026-10-26</lastmod><video:video><video:thumbnail_loc>https://i.ytimg.com/vi/Ad1jF5PcMLo/hqdefault.jpg</video:thumbnail_loc><video:title>Leetcode HARD 3617 - Find Students with Study Spiral Pattern | Everyday Data Science - SQL Playlist</video:title><video:description>Leetcode HARD 3617 - Find Students with Study Spiral Pattern | Everyday Data Science - SQL Playlist. Video lecture by Everyday Data Science on Avio Lines.</video:description><video:player_loc>https://www.youtube.com/embed/Ad1jF5PcMLo</video:player_loc><video:duration>1323</video:duration><video:publication_date>2026-04-12T02:00:22.000Z</video:publication_date><video:family_friendly>yes</video:family_friendly></video:video></url>
</urlset>
