<?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://dsaanimator.com/</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>daily</changefreq>
    <priority>1.0</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-animations</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.95</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.95</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.95</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.95</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/java-interview</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.9</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/mockInterview</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.9</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/java</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/duplicate-webhook-transaction</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/duplicate-payment-double-click</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/flash-sale-limited-inventory</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/payment-timeout-ambiguous</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/concurrent-seat-booking</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/wallet-concurrent-double-spend</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/coupon-duplicate-redemption</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/create-order-api-idempotency</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/exactly-once-confirmation-email</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/distributed-cron-exactly-once</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/kafka-consumer-exactly-once</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/cache-stampede-million-rpm</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/zero-downtime-db-migration</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/distributed-rate-limiter</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/distributed-order-id-generation</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/concurrent-document-updates</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/cascading-failure-retry-storm</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/zero-downtime-payment-deploy</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/distributed-lock-design</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/redis-down-failure-handling</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/production-monitoring-system-design</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/consistency-availability-tradeoffs</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/p2p-money-transfer-service</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/notification-platform-exactly-once</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/shopping-cart-inventory-sync</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/cache-penetration-nonexistent-products</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/cache-database-price-consistency</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/inventory-caching-strategy-frequent-changes</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/trading-market-data-low-latency</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/saga-order-inventory-payment</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/multi-tenant-rate-data-isolation</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/fragile-kyc-third-party</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/traffic-spike-thousand-to-million</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/messaging-partition-delay-vs-inconsistency</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/cab-booking-partition-duplicate</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/read-your-writes-after-order</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/search-index-lag-elasticsearch</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/hot-key-celebrity-seller</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/partial-refund-restock</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/logout-everywhere-session-revoke</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/upload-virus-scan-cdn</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/feature-flag-kill-switch-deploy</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/dead-letter-poison-message</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/api-pagination-concurrent-inserts</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/interview-questions/gdpr-delete-across-services</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/lld-parking-lot</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/lld-bookmyshow</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/lld-rate-limiter</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/lld-lru-cache</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/lld-splitwise</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/lld-snake-and-ladder</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/lld-atm</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/lld-food-delivery</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/lld-elevator</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/lld-meeting-scheduler</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/lld-logger</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/single-responsibility-principle</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/open-closed-principle</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/liskov-substitution-principle</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/interface-segregation-principle</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/dependency-inversion-principle</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/class-relationships</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/concurrency-basics</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/synchronization-basics</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/synchronized-vs-reentrantlock</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/deadlock-livelock-starvation</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/concurrenthashmap-and-concurrent-collections</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/internal-working-hashmap-concurrenthashmap</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/weakhashmap</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/volatile-keyword</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/volatile-atomic-transient</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/thread-pools-executorservice</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/blocking-queue</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/completablefuture-async-composition</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/virtual-threads-java-21</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/jvm-gc-overview</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/java-reference-types</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/pagination-strategies</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/database-indexing</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/database-sharding-partitioning</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/transactions-and-isolation</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/connection-pooling-hikaricp</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/n-plus-one-queries-batching</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/idempotency-patterns</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/caching-patterns</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/rate-limiting</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/distributed-locks</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/circuit-breaker-retry-bulkhead</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/circuit-breakers-retries-resilience4j</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/fault-tolerance-recover-from-failures</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/websocket</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/webhook</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/rest-vs-grpc</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/grpc</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/jwt-vs-session-oauth</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/api-gateway</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/api-gateway-authentication-authorization</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/kafka-basics</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/sqs-basics</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/sqs-vs-rabbitmq</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/queue-based-systems-rabbitmq-vs-kafka</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/cqrs-event-sourcing-overview</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/saga-pattern</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/cqrs-pattern</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/junit-testing-spring-boot</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/docker-fundamentals</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/redis-fundamentals</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/trade-offs-in-system-design</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/zero-downtime-deployment-strategies</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/scale-from-zero-to-millions-of-users</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/framework-for-system-design-interviews</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/singleton-pattern</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/factory-method-pattern</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/abstract-factory-pattern</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/builder-pattern</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/prototype-pattern</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/adapter-pattern</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/composite-pattern</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/decorator-pattern</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/facade-pattern</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/proxy-pattern</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/chain-of-responsibility-pattern</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/command-pattern</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/mediator-pattern</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/memento-pattern</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/observer-pattern</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/state-pattern</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/strategy-pattern</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/template-method-pattern</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/system-design/visitor-pattern</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/java-interview/core-java-oop</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/java-interview/strings</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/java-interview/collections</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/java-interview/multithreading</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/java-interview/exceptions</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/java-interview/java8</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/java-interview/modern-java</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/java-interview/jvm-memory</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/java-interview/generics</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/java-interview/misc</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/java-interview/spring-core-di</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/java-interview/spring-boot-fundamentals</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/java-interview/spring-mvc-rest</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/java-interview/spring-data-jpa</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/java-interview/spring-security</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/java-interview/spring-testing-cloud</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/java-interview/spring-scenarios</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/1-two-sum</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/1004-max-consecutive-ones-iii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/11-container-with-most-water</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/121-best-time-buy-sell-stock</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/128-longest-consecutive-sequence</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/1470-shuffle-the-array</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/1480-running-sum</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/15-three-sum</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/167-two-sum-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/1672-richest-customer-wealth</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/169-majority-element</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/189-rotate-array</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/1929-concatenation-of-array</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/209-min-size-subarray-sum</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/217-contains-duplicate</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/2239-find-closest-number</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/238-product-except-self</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/26-remove-duplicates</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/31-next-permutation</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/383-ransom-note</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/41-first-missing-positive</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/42-trapping-rain-water</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/53-maximum-subarray</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/560-subarray-sum-equals-k</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/643-max-average-subarray</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/75-sort-colors</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/832-flipping-an-image</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/88-merge-sorted-array</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/arrays/977-squares-sorted-array</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/backtracking/17-letter-combinations-phone</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/backtracking/22-generate-parentheses</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/backtracking/37-sudoku-solver</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/backtracking/39-combination-sum</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/backtracking/46-permutations</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/backtracking/51-n-queens</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/backtracking/77-combinations</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/backtracking/78-subsets</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/backtracking/90-subsets-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/binarysearch/1011-capacity-to-ship-packages</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/binarysearch/153-find-minimum-rotated</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/binarysearch/162-find-peak-element</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/binarysearch/268-missing-number</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/binarysearch/33-search-rotated-sorted-array</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/binarysearch/34-first-last-position</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/binarysearch/35-search-insert-position</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/binarysearch/4-median-two-sorted-arrays</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/binarysearch/410-split-array-largest-sum</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/binarysearch/704-binary-search</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/binarysearch/81-search-rotated-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/binarysearch/875-koko-eating-bananas</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/binarysearch/gfg-allocate-minimum-pages</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/binarysearch/ib-painters-partition</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/bitmanipulation/136-single-number</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/bitmanipulation/137-single-number-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/bitmanipulation/191-number-of-1-bits</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/bitmanipulation/231-power-of-two</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/bitmanipulation/260-single-number-iii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/bitmanipulation/287-find-the-duplicate-number</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/bitmanipulation/338-counting-bits</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/bitmanipulation/371-sum-of-two-integers</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/bitmanipulation/389-find-the-difference</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/dp/1143-longest-common-subsequence</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/dp/120-triangle</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/dp/139-word-break</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/dp/152-maximum-product-subarray</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/dp/198-house-robber</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/dp/213-house-robber-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/dp/300-longest-increasing-subsequence</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/dp/322-coin-change</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/dp/416-partition-equal-subset-sum</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/dp/509-fibonacci-number</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/dp/62-unique-paths</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/dp/63-unique-paths-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/dp/70-climbing-stairs</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/dp/72-edit-distance</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/dp/746-min-cost-climbing-stairs</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/dp/91-decode-ways</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/dp/gfg-longest-common-substring</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/graph/127-word-ladder</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/graph/133-clone-graph</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/graph/1584-min-cost-connect-points</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/graph/1971-find-path-exists</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/graph/207-course-schedule</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/graph/210-course-schedule-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/graph/399-evaluate-division</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/graph/417-pacific-atlantic</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/graph/684-redundant-connection</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/graph/743-network-delay-time</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/graph/787-cheapest-flights-k-stops</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/graph/994-rotting-oranges</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/graph/gfg-is-graph-a-tree</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/greedy/134-gas-station</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/greedy/135-candy</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/greedy/45-jump-game-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/greedy/55-jump-game</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/greedy/763-partition-labels</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/greedy/gfg-minimum-platforms</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/heap/1046-last-stone-weight</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/heap/215-kth-largest-element</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/heap/295-find-median-data-stream</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/heap/347-top-k-frequent-elements</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/heap/621-task-scheduler</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/heap/973-k-closest-points</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/intervals/253-meeting-rooms-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/intervals/435-non-overlapping-intervals</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/intervals/452-minimum-arrows-balloons</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/intervals/56-merge-intervals</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/intervals/57-insert-interval</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/linkedlist/138-copy-list-with-random-pointer</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/linkedlist/141-linked-list-cycle</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/linkedlist/142-linked-list-cycle-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/linkedlist/143-reorder-list</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/linkedlist/19-remove-nth-from-end</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/linkedlist/2-add-two-numbers</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/linkedlist/202-happy-number</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/linkedlist/206-reverse-linked-list</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/linkedlist/21-merge-two-sorted-lists</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/linkedlist/23-merge-k-sorted-lists</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/linkedlist/234-palindrome-linked-list</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/linkedlist/25-reverse-nodes-in-k-group</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/linkedlist/83-remove-duplicates-sorted-list</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/linkedlist/876-middle-of-linked-list</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/linkedlist/92-reverse-linked-list-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/matrix/200-number-of-islands</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/matrix/240-search-2d-matrix-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/matrix/36-valid-sudoku</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/matrix/48-rotate-image</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/matrix/54-spiral-matrix</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/matrix/59-spiral-matrix-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/matrix/73-set-matrix-zeroes</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/matrix/74-search-2d-matrix</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/matrix/79-word-search</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/queue/239-sliding-window-maximum</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/queue/gfg-reverse-first-k-elements-queue</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/sorting/912-bubble-sort</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/sorting/912-heap-sort</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/sorting/912-insertion-sort</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/sorting/912-merge-sort</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/sorting/912-quick-sort</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/stack/150-evaluate-rpn</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/stack/155-min-stack</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/stack/20-valid-parentheses</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/stack/224-basic-calculator</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/stack/496-next-greater-element-i</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/stack/739-daily-temperatures</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/stack/84-largest-rectangle-histogram</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/stack/85-maximal-rectangle</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/strings/1189-maximum-number-of-balloons</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/strings/125-valid-palindrome</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/strings/13-roman-to-integer</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/strings/14-longest-common-prefix</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/strings/205-isomorphic-strings</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/strings/242-valid-anagram</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/strings/271-encode-decode-strings</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/strings/3-longest-substring-without-repeating</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/strings/344-reverse-string</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/strings/424-longest-repeating-char-replacement</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/strings/438-find-all-anagrams</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/strings/49-group-anagrams</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/strings/5-longest-palindromic-substring</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/strings/567-permutation-in-string</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/strings/647-palindromic-substrings</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/strings/680-valid-palindrome-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/strings/76-minimum-window-substring</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/tree/101-symmetric-tree</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/tree/102-binary-tree-level-order</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/tree/103-zigzag-level-order</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/tree/104-maximum-depth</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/tree/105-construct-from-preorder-inorder</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/tree/108-sorted-array-to-bst</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/tree/110-balanced-binary-tree</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/tree/112-path-sum</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/tree/113-path-sum-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/tree/114-flatten-to-linked-list</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/tree/124-binary-tree-max-path-sum</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/tree/129-sum-root-to-leaf-numbers</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/tree/199-right-side-view</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/tree/226-invert-binary-tree</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/tree/230-kth-smallest-bst</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/tree/236-lowest-common-ancestor</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/tree/297-serialize-deserialize-binary-tree</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/tree/543-diameter-of-binary-tree</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/tree/637-average-of-levels</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/tree/94-binary-tree-inorder-traversal</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/viz/problems/tree/98-validate-bst</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.85</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/backtrack-combos</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/backtrack-perms</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/backtrack-subsets</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/bfs-multisource</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/bfs-standard</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/binary-search-classic</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/binary-search-on-answer</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/dp-1d</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/dp-2d</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/graph-bellman-ford</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/graph-dijkstra</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/graph-prims</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/graph-topo-sort</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/graph-union-find</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/greedy-intervals</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/greedy-jump</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/hashing-frequency</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/heap-kway</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/heap-topk</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/heap-two-heaps</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/kadane</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/linkedlist-fastslow</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/linkedlist-merge</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/linkedlist-reversal</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/prefix-sum</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/sliding-window-dynamic</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/sliding-window-fixed</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/stack-monotonic-dec</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/stack-monotonic-inc</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/stack-simple</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/tree-bfs</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/tree-bst</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/tree-dfs</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/tree-paths</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/two-pointers-opposite</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/two-pointers-same</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/patterns/two-pointers-threesum</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/1929-concatenation-of-array</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/1929-concatenation-of-array.jpg</video:thumbnail_loc>
      <video:title>Concatenation of Array (LeetCode 1929) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: Concatenation of Array (LeetCode 1929, Easy) solved with the Basics pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/1929-concatenation-of-array.mp4</video:content_loc>
      <video:duration>70</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/1480-running-sum</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/1480-running-sum.jpg</video:thumbnail_loc>
      <video:title>Running Sum of 1D Array (LeetCode 1480) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: Running Sum of 1D Array (LeetCode 1480, Easy) solved with the Prefix Sum pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/1480-running-sum.mp4</video:content_loc>
      <video:duration>73</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/1672-richest-customer-wealth</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/1672-richest-customer-wealth.jpg</video:thumbnail_loc>
      <video:title>Richest Customer Wealth (LeetCode 1672) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: Richest Customer Wealth (LeetCode 1672, Easy) solved with the 2D Array pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/1672-richest-customer-wealth.mp4</video:content_loc>
      <video:duration>71</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/1470-shuffle-the-array</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/1470-shuffle-the-array.jpg</video:thumbnail_loc>
      <video:title>Shuffle the Array (LeetCode 1470) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: Shuffle the Array (LeetCode 1470, Easy) solved with the Basics pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/1470-shuffle-the-array.mp4</video:content_loc>
      <video:duration>77</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/832-flipping-an-image</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/832-flipping-an-image.jpg</video:thumbnail_loc>
      <video:title>Flipping an Image (LeetCode 832) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: Flipping an Image (LeetCode 832, Easy) solved with the 2D Array pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/832-flipping-an-image.mp4</video:content_loc>
      <video:duration>98</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/2239-find-closest-number</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/2239-find-closest-number.jpg</video:thumbnail_loc>
      <video:title>Find Closest Number to Zero (LeetCode 2239) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: Find Closest Number to Zero (LeetCode 2239, Easy) solved with the Basics pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/2239-find-closest-number.mp4</video:content_loc>
      <video:duration>75</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/88-merge-sorted-array</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/88-merge-sorted-array.jpg</video:thumbnail_loc>
      <video:title>Merge Sorted Array (LeetCode 88) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: Merge Sorted Array (LeetCode 88, Easy) solved with the Two Pointers pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/88-merge-sorted-array.mp4</video:content_loc>
      <video:duration>103</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/26-remove-duplicates</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/26-remove-duplicates.jpg</video:thumbnail_loc>
      <video:title>Remove Duplicates from Sorted Array (LeetCode 26) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: Remove Duplicates from Sorted Array (LeetCode 26, Easy) solved with the Two Pointers pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/26-remove-duplicates.mp4</video:content_loc>
      <video:duration>91</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/977-squares-sorted-array</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/977-squares-sorted-array.jpg</video:thumbnail_loc>
      <video:title>Squares of a Sorted Array (LeetCode 977) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: Squares of a Sorted Array (LeetCode 977, Easy) solved with the Two Pointers pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/977-squares-sorted-array.mp4</video:content_loc>
      <video:duration>91</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/15-three-sum</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/15-three-sum.jpg</video:thumbnail_loc>
      <video:title>3Sum (LeetCode 15) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: 3Sum (LeetCode 15, Medium) solved with the Sort + Two Pointers pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/15-three-sum.mp4</video:content_loc>
      <video:duration>107</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/42-trapping-rain-water</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/42-trapping-rain-water.jpg</video:thumbnail_loc>
      <video:title>Trapping Rain Water (LeetCode 42) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: Trapping Rain Water (LeetCode 42, Hard) solved with the Two Pointers pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/42-trapping-rain-water.mp4</video:content_loc>
      <video:duration>84</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/167-two-sum-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/167-two-sum-ii.jpg</video:thumbnail_loc>
      <video:title>Two Sum II (LeetCode 167) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: Two Sum II (LeetCode 167, Medium) solved with the Two Pointers pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/167-two-sum-ii.mp4</video:content_loc>
      <video:duration>116</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/11-container-with-most-water</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/11-container-with-most-water.jpg</video:thumbnail_loc>
      <video:title>Container With Most Water (LeetCode 11) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: Container With Most Water (LeetCode 11, Medium) solved with the Two Pointers pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/11-container-with-most-water.mp4</video:content_loc>
      <video:duration>89</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/31-next-permutation</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/31-next-permutation.jpg</video:thumbnail_loc>
      <video:title>Next Permutation (LeetCode 31) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: Next Permutation (LeetCode 31, Medium) solved with the Array Manipulation pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/31-next-permutation.mp4</video:content_loc>
      <video:duration>112</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/53-maximum-subarray</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/53-maximum-subarray.jpg</video:thumbnail_loc>
      <video:title>Maximum Subarray (LeetCode 53) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: Maximum Subarray (LeetCode 53, Medium) solved with the Kadane&apos;s Algorithm pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/53-maximum-subarray.mp4</video:content_loc>
      <video:duration>76</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/121-best-time-buy-sell-stock</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/121-best-time-buy-sell-stock.jpg</video:thumbnail_loc>
      <video:title>Best Time to Buy and Sell Stock (LeetCode 121) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: Best Time to Buy and Sell Stock (LeetCode 121, Easy) solved with the One Pass pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/121-best-time-buy-sell-stock.mp4</video:content_loc>
      <video:duration>80</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/643-max-average-subarray</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/643-max-average-subarray.jpg</video:thumbnail_loc>
      <video:title>Maximum Average Subarray I (LeetCode 643) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: Maximum Average Subarray I (LeetCode 643, Easy) solved with the Fixed Sliding Window pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/643-max-average-subarray.mp4</video:content_loc>
      <video:duration>91</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/1004-max-consecutive-ones-iii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/1004-max-consecutive-ones-iii.jpg</video:thumbnail_loc>
      <video:title>Max Consecutive Ones III (LeetCode 1004) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: Max Consecutive Ones III (LeetCode 1004, Medium) solved with the Sliding Window pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/1004-max-consecutive-ones-iii.mp4</video:content_loc>
      <video:duration>102</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/209-min-size-subarray-sum</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/209-min-size-subarray-sum.jpg</video:thumbnail_loc>
      <video:title>Minimum Size Subarray Sum (LeetCode 209) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: Minimum Size Subarray Sum (LeetCode 209, Medium) solved with the Sliding Window pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/209-min-size-subarray-sum.mp4</video:content_loc>
      <video:duration>99</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/1-two-sum</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/1-two-sum.jpg</video:thumbnail_loc>
      <video:title>Two Sum (LeetCode 1) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: Two Sum (LeetCode 1, Easy) solved with the Hash Map pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/1-two-sum.mp4</video:content_loc>
      <video:duration>72</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/217-contains-duplicate</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/217-contains-duplicate.jpg</video:thumbnail_loc>
      <video:title>Contains Duplicate (LeetCode 217) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: Contains Duplicate (LeetCode 217, Easy) solved with the Hash Set pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/217-contains-duplicate.mp4</video:content_loc>
      <video:duration>55</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/41-first-missing-positive</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/41-first-missing-positive.jpg</video:thumbnail_loc>
      <video:title>First Missing Positive (LeetCode 41) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: First Missing Positive (LeetCode 41, Hard) solved with the Cyclic Placement pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/41-first-missing-positive.mp4</video:content_loc>
      <video:duration>97</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/238-product-except-self</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/238-product-except-self.jpg</video:thumbnail_loc>
      <video:title>Product of Array Except Self (LeetCode 238) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: Product of Array Except Self (LeetCode 238, Medium) solved with the Prefix &amp; Suffix pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/238-product-except-self.mp4</video:content_loc>
      <video:duration>97</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/383-ransom-note</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/383-ransom-note.jpg</video:thumbnail_loc>
      <video:title>Ransom Note (LeetCode 383) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: Ransom Note (LeetCode 383, Easy) solved with the Frequency Count pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/383-ransom-note.mp4</video:content_loc>
      <video:duration>70</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/560-subarray-sum-equals-k</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/560-subarray-sum-equals-k.jpg</video:thumbnail_loc>
      <video:title>Subarray Sum Equals K (LeetCode 560) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: Subarray Sum Equals K (LeetCode 560, Medium) solved with the Prefix Sum + Hash Map pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/560-subarray-sum-equals-k.mp4</video:content_loc>
      <video:duration>78</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/169-majority-element</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/169-majority-element.jpg</video:thumbnail_loc>
      <video:title>Majority Element (LeetCode 169) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: Majority Element (LeetCode 169, Easy) solved with the Boyer-Moore Voting pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/169-majority-element.mp4</video:content_loc>
      <video:duration>75</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/128-longest-consecutive-sequence</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/128-longest-consecutive-sequence.jpg</video:thumbnail_loc>
      <video:title>Longest Consecutive Sequence (LeetCode 128) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: Longest Consecutive Sequence (LeetCode 128, Medium) solved with the Hash Set pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/128-longest-consecutive-sequence.mp4</video:content_loc>
      <video:duration>83</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/189-rotate-array</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/189-rotate-array.jpg</video:thumbnail_loc>
      <video:title>Rotate Array (LeetCode 189) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: Rotate Array (LeetCode 189, Medium) solved with the Reversal pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/189-rotate-array.mp4</video:content_loc>
      <video:duration>84</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/75-sort-colors</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/75-sort-colors.jpg</video:thumbnail_loc>
      <video:title>Sort Colors (LeetCode 75) — Video Explanation</video:title>
      <video:description>Animated Arrays revision video: Sort Colors (LeetCode 75, Medium) solved with the Dutch National Flag pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/01-arrays/75-sort-colors.mp4</video:content_loc>
      <video:duration>87</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/13-roman-to-integer</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/13-roman-to-integer.jpg</video:thumbnail_loc>
      <video:title>Roman to Integer (LeetCode 13) — Video Explanation</video:title>
      <video:description>Animated Strings revision video: Roman to Integer (LeetCode 13, Easy) solved with the Lookahead pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/02-strings/13-roman-to-integer.mp4</video:content_loc>
      <video:duration>87</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/14-longest-common-prefix</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/14-longest-common-prefix.jpg</video:thumbnail_loc>
      <video:title>Longest Common Prefix (LeetCode 14) — Video Explanation</video:title>
      <video:description>Animated Strings revision video: Longest Common Prefix (LeetCode 14, Easy) solved with the Vertical Scan pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/02-strings/14-longest-common-prefix.mp4</video:content_loc>
      <video:duration>80</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/271-encode-decode-strings</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/271-encode-decode-strings.jpg</video:thumbnail_loc>
      <video:title>Encode and Decode Strings (LeetCode 271) — Video Explanation</video:title>
      <video:description>Animated Strings revision video: Encode and Decode Strings (LeetCode 271, Medium) solved with the Length Prefix pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/02-strings/271-encode-decode-strings.mp4</video:content_loc>
      <video:duration>92</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/205-isomorphic-strings</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/205-isomorphic-strings.jpg</video:thumbnail_loc>
      <video:title>Isomorphic Strings (LeetCode 205) — Video Explanation</video:title>
      <video:description>Animated Strings revision video: Isomorphic Strings (LeetCode 205, Easy) solved with the Two Hash Maps pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/02-strings/205-isomorphic-strings.mp4</video:content_loc>
      <video:duration>84</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/344-reverse-string</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/344-reverse-string.jpg</video:thumbnail_loc>
      <video:title>Reverse String (LeetCode 344) — Video Explanation</video:title>
      <video:description>Animated Strings revision video: Reverse String (LeetCode 344, Easy) solved with the Two Pointers pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/02-strings/344-reverse-string.mp4</video:content_loc>
      <video:duration>58</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/3-longest-substring-without-repeating</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/3-longest-substring-without-repeating.jpg</video:thumbnail_loc>
      <video:title>Longest Substring Without Repeating Characters (LeetCode 3) — Video Explanation</video:title>
      <video:description>Animated Strings revision video: Longest Substring Without Repeating Characters (LeetCode 3, Medium) solved with the Sliding Window pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/02-strings/3-longest-substring-without-repeating.mp4</video:content_loc>
      <video:duration>111</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/424-longest-repeating-char-replacement</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/424-longest-repeating-char-replacement.jpg</video:thumbnail_loc>
      <video:title>Longest Repeating Character Replacement (LeetCode 424) — Video Explanation</video:title>
      <video:description>Animated Strings revision video: Longest Repeating Character Replacement (LeetCode 424, Medium) solved with the Sliding Window pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/02-strings/424-longest-repeating-char-replacement.mp4</video:content_loc>
      <video:duration>101</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/76-minimum-window-substring</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/76-minimum-window-substring.jpg</video:thumbnail_loc>
      <video:title>Minimum Window Substring (LeetCode 76) — Video Explanation</video:title>
      <video:description>Animated Strings revision video: Minimum Window Substring (LeetCode 76, Hard) solved with the Sliding Window pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/02-strings/76-minimum-window-substring.mp4</video:content_loc>
      <video:duration>108</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/567-permutation-in-string</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/567-permutation-in-string.jpg</video:thumbnail_loc>
      <video:title>Permutation in String (LeetCode 567) — Video Explanation</video:title>
      <video:description>Animated Strings revision video: Permutation in String (LeetCode 567, Medium) solved with the Fixed Sliding Window pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/02-strings/567-permutation-in-string.mp4</video:content_loc>
      <video:duration>79</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/438-find-all-anagrams</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/438-find-all-anagrams.jpg</video:thumbnail_loc>
      <video:title>Find All Anagrams in a String (LeetCode 438) — Video Explanation</video:title>
      <video:description>Animated Strings revision video: Find All Anagrams in a String (LeetCode 438, Medium) solved with the Fixed Sliding Window pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/02-strings/438-find-all-anagrams.mp4</video:content_loc>
      <video:duration>100</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/242-valid-anagram</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/242-valid-anagram.jpg</video:thumbnail_loc>
      <video:title>Valid Anagram (LeetCode 242) — Video Explanation</video:title>
      <video:description>Animated Strings revision video: Valid Anagram (LeetCode 242, Easy) solved with the Frequency Count pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/02-strings/242-valid-anagram.mp4</video:content_loc>
      <video:duration>99</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/49-group-anagrams</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/49-group-anagrams.jpg</video:thumbnail_loc>
      <video:title>Group Anagrams (LeetCode 49) — Video Explanation</video:title>
      <video:description>Animated Strings revision video: Group Anagrams (LeetCode 49, Medium) solved with the Hash Map pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/02-strings/49-group-anagrams.mp4</video:content_loc>
      <video:duration>81</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/1189-maximum-number-of-balloons</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/1189-maximum-number-of-balloons.jpg</video:thumbnail_loc>
      <video:title>Maximum Number of Balloons (LeetCode 1189) — Video Explanation</video:title>
      <video:description>Animated Strings revision video: Maximum Number of Balloons (LeetCode 1189, Easy) solved with the Frequency Count pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/02-strings/1189-maximum-number-of-balloons.mp4</video:content_loc>
      <video:duration>66</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/125-valid-palindrome</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/125-valid-palindrome.jpg</video:thumbnail_loc>
      <video:title>Valid Palindrome (LeetCode 125) — Video Explanation</video:title>
      <video:description>Animated Strings revision video: Valid Palindrome (LeetCode 125, Easy) solved with the Two Pointers pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/02-strings/125-valid-palindrome.mp4</video:content_loc>
      <video:duration>82</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/680-valid-palindrome-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/680-valid-palindrome-ii.jpg</video:thumbnail_loc>
      <video:title>Valid Palindrome II (LeetCode 680) — Video Explanation</video:title>
      <video:description>Animated Strings revision video: Valid Palindrome II (LeetCode 680, Medium) solved with the Two Pointers pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/02-strings/680-valid-palindrome-ii.mp4</video:content_loc>
      <video:duration>67</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/5-longest-palindromic-substring</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/5-longest-palindromic-substring.jpg</video:thumbnail_loc>
      <video:title>Longest Palindromic Substring (LeetCode 5) — Video Explanation</video:title>
      <video:description>Animated Strings revision video: Longest Palindromic Substring (LeetCode 5, Medium) solved with the Expand Around Center pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/02-strings/5-longest-palindromic-substring.mp4</video:content_loc>
      <video:duration>101</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/647-palindromic-substrings</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/647-palindromic-substrings.jpg</video:thumbnail_loc>
      <video:title>Palindromic Substrings (LeetCode 647) — Video Explanation</video:title>
      <video:description>Animated Strings revision video: Palindromic Substrings (LeetCode 647, Medium) solved with the Expand Around Center pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/02-strings/647-palindromic-substrings.mp4</video:content_loc>
      <video:duration>67</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/54-spiral-matrix</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/54-spiral-matrix.jpg</video:thumbnail_loc>
      <video:title>Spiral Matrix (LeetCode 54) — Video Explanation</video:title>
      <video:description>Animated Matrix revision video: Spiral Matrix (LeetCode 54, Medium) solved with the Boundary Traversal pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/03-matrix/54-spiral-matrix.mp4</video:content_loc>
      <video:duration>90</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/59-spiral-matrix-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/59-spiral-matrix-ii.jpg</video:thumbnail_loc>
      <video:title>Spiral Matrix II (LeetCode 59) — Video Explanation</video:title>
      <video:description>Animated Matrix revision video: Spiral Matrix II (LeetCode 59, Medium) solved with the Boundary Traversal pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/03-matrix/59-spiral-matrix-ii.mp4</video:content_loc>
      <video:duration>71</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/200-number-of-islands</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/200-number-of-islands.jpg</video:thumbnail_loc>
      <video:title>Number of Islands (LeetCode 200) — Video Explanation</video:title>
      <video:description>Animated Matrix revision video: Number of Islands (LeetCode 200, Medium) solved with the DFS Flood Fill pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/03-matrix/200-number-of-islands.mp4</video:content_loc>
      <video:duration>90</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/73-set-matrix-zeroes</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/73-set-matrix-zeroes.jpg</video:thumbnail_loc>
      <video:title>Set Matrix Zeroes (LeetCode 73) — Video Explanation</video:title>
      <video:description>Animated Matrix revision video: Set Matrix Zeroes (LeetCode 73, Medium) solved with the In-place Markers pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/03-matrix/73-set-matrix-zeroes.mp4</video:content_loc>
      <video:duration>97</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/79-word-search</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/79-word-search.jpg</video:thumbnail_loc>
      <video:title>Word Search (LeetCode 79) — Video Explanation</video:title>
      <video:description>Animated Matrix revision video: Word Search (LeetCode 79, Medium) solved with the Backtracking DFS pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/03-matrix/79-word-search.mp4</video:content_loc>
      <video:duration>86</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/240-search-2d-matrix-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/240-search-2d-matrix-ii.jpg</video:thumbnail_loc>
      <video:title>Search a 2D Matrix II (LeetCode 240) — Video Explanation</video:title>
      <video:description>Animated Matrix revision video: Search a 2D Matrix II (LeetCode 240, Medium) solved with the Staircase Search pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/03-matrix/240-search-2d-matrix-ii.mp4</video:content_loc>
      <video:duration>76</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/48-rotate-image</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/48-rotate-image.jpg</video:thumbnail_loc>
      <video:title>Rotate Image (LeetCode 48) — Video Explanation</video:title>
      <video:description>Animated Matrix revision video: Rotate Image (LeetCode 48, Medium) solved with the Transpose + Reverse pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/03-matrix/48-rotate-image.mp4</video:content_loc>
      <video:duration>78</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/74-search-2d-matrix</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/74-search-2d-matrix.jpg</video:thumbnail_loc>
      <video:title>Search a 2D Matrix (LeetCode 74) — Video Explanation</video:title>
      <video:description>Animated Matrix revision video: Search a 2D Matrix (LeetCode 74, Medium) solved with the Binary Search pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/03-matrix/74-search-2d-matrix.mp4</video:content_loc>
      <video:duration>85</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/36-valid-sudoku</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/36-valid-sudoku.jpg</video:thumbnail_loc>
      <video:title>Valid Sudoku (LeetCode 36) — Video Explanation</video:title>
      <video:description>Animated Matrix revision video: Valid Sudoku (LeetCode 36, Medium) solved with the Hash Sets pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/03-matrix/36-valid-sudoku.mp4</video:content_loc>
      <video:duration>102</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/20-valid-parentheses</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/20-valid-parentheses.jpg</video:thumbnail_loc>
      <video:title>Valid Parentheses (LeetCode 20) — Video Explanation</video:title>
      <video:description>Animated Stack revision video: Valid Parentheses (LeetCode 20, Easy) solved with the Stack pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/04-stack/20-valid-parentheses.mp4</video:content_loc>
      <video:duration>97</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/150-evaluate-rpn</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/150-evaluate-rpn.jpg</video:thumbnail_loc>
      <video:title>Evaluate Reverse Polish Notation (LeetCode 150) — Video Explanation</video:title>
      <video:description>Animated Stack revision video: Evaluate Reverse Polish Notation (LeetCode 150, Medium) solved with the Stack pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/04-stack/150-evaluate-rpn.mp4</video:content_loc>
      <video:duration>71</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/739-daily-temperatures</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/739-daily-temperatures.jpg</video:thumbnail_loc>
      <video:title>Daily Temperatures (LeetCode 739) — Video Explanation</video:title>
      <video:description>Animated Stack revision video: Daily Temperatures (LeetCode 739, Medium) solved with the Monotonic Stack pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/04-stack/739-daily-temperatures.mp4</video:content_loc>
      <video:duration>108</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/155-min-stack</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/155-min-stack.jpg</video:thumbnail_loc>
      <video:title>Min Stack (LeetCode 155) — Video Explanation</video:title>
      <video:description>Animated Stack revision video: Min Stack (LeetCode 155, Medium) solved with the Stack Design pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/04-stack/155-min-stack.mp4</video:content_loc>
      <video:duration>80</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/496-next-greater-element-i</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/496-next-greater-element-i.jpg</video:thumbnail_loc>
      <video:title>Next Greater Element I (LeetCode 496) — Video Explanation</video:title>
      <video:description>Animated Stack revision video: Next Greater Element I (LeetCode 496, Easy) solved with the Monotonic Stack pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/04-stack/496-next-greater-element-i.mp4</video:content_loc>
      <video:duration>83</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/84-largest-rectangle-histogram</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/84-largest-rectangle-histogram.jpg</video:thumbnail_loc>
      <video:title>Largest Rectangle in Histogram (LeetCode 84) — Video Explanation</video:title>
      <video:description>Animated Stack revision video: Largest Rectangle in Histogram (LeetCode 84, Hard) solved with the Monotonic Stack pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/04-stack/84-largest-rectangle-histogram.mp4</video:content_loc>
      <video:duration>100</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/85-maximal-rectangle</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/85-maximal-rectangle.jpg</video:thumbnail_loc>
      <video:title>Maximal Rectangle (LeetCode 85) — Video Explanation</video:title>
      <video:description>Animated Stack revision video: Maximal Rectangle (LeetCode 85, Hard) solved with the Histogram per Row pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/04-stack/85-maximal-rectangle.mp4</video:content_loc>
      <video:duration>85</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/224-basic-calculator</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/224-basic-calculator.jpg</video:thumbnail_loc>
      <video:title>Basic Calculator (LeetCode 224) — Video Explanation</video:title>
      <video:description>Animated Stack revision video: Basic Calculator (LeetCode 224, Hard) solved with the Stack pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/04-stack/224-basic-calculator.mp4</video:content_loc>
      <video:duration>91</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/gfg-reverse-first-k-elements-queue</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/gfg-reverse-first-k-elements-queue.jpg</video:thumbnail_loc>
      <video:title>Reversing First K Elements of a Queue (GFG) — Video Explanation</video:title>
      <video:description>Animated Queue revision video: Reversing First K Elements of a Queue (GFG, Medium) solved with the Queue + Stack pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/05-queue/gfg-reverse-first-k-elements-queue.mp4</video:content_loc>
      <video:duration>77</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/239-sliding-window-maximum</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/239-sliding-window-maximum.jpg</video:thumbnail_loc>
      <video:title>Sliding Window Maximum (LeetCode 239) — Video Explanation</video:title>
      <video:description>Animated Queue revision video: Sliding Window Maximum (LeetCode 239, Hard) solved with the Monotonic Deque pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/05-queue/239-sliding-window-maximum.mp4</video:content_loc>
      <video:duration>100</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/704-binary-search</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/704-binary-search.jpg</video:thumbnail_loc>
      <video:title>Binary Search (LeetCode 704) — Video Explanation</video:title>
      <video:description>Animated Binary Search revision video: Binary Search (LeetCode 704, Easy) solved with the Binary Search pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/06-binary-search/704-binary-search.mp4</video:content_loc>
      <video:duration>68</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/35-search-insert-position</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/35-search-insert-position.jpg</video:thumbnail_loc>
      <video:title>Search Insert Position (LeetCode 35) — Video Explanation</video:title>
      <video:description>Animated Binary Search revision video: Search Insert Position (LeetCode 35, Easy) solved with the Binary Search pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/06-binary-search/35-search-insert-position.mp4</video:content_loc>
      <video:duration>68</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/268-missing-number</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/268-missing-number.jpg</video:thumbnail_loc>
      <video:title>Missing Number (LeetCode 268) — Video Explanation</video:title>
      <video:description>Animated Binary Search revision video: Missing Number (LeetCode 268, Easy) solved with the Math / XOR pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/06-binary-search/268-missing-number.mp4</video:content_loc>
      <video:duration>73</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/34-first-last-position</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/34-first-last-position.jpg</video:thumbnail_loc>
      <video:title>Find First and Last Position of Element (LeetCode 34) — Video Explanation</video:title>
      <video:description>Animated Binary Search revision video: Find First and Last Position of Element (LeetCode 34, Medium) solved with the Binary Search Bounds pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/06-binary-search/34-first-last-position.mp4</video:content_loc>
      <video:duration>88</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/162-find-peak-element</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/162-find-peak-element.jpg</video:thumbnail_loc>
      <video:title>Find Peak Element (LeetCode 162) — Video Explanation</video:title>
      <video:description>Animated Binary Search revision video: Find Peak Element (LeetCode 162, Medium) solved with the Binary Search on Slope pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/06-binary-search/162-find-peak-element.mp4</video:content_loc>
      <video:duration>77</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/153-find-minimum-rotated</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/153-find-minimum-rotated.jpg</video:thumbnail_loc>
      <video:title>Find Minimum in Rotated Sorted Array (LeetCode 153) — Video Explanation</video:title>
      <video:description>Animated Binary Search revision video: Find Minimum in Rotated Sorted Array (LeetCode 153, Medium) solved with the Binary Search pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/06-binary-search/153-find-minimum-rotated.mp4</video:content_loc>
      <video:duration>72</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/33-search-rotated-sorted-array</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/33-search-rotated-sorted-array.jpg</video:thumbnail_loc>
      <video:title>Search in Rotated Sorted Array (LeetCode 33) — Video Explanation</video:title>
      <video:description>Animated Binary Search revision video: Search in Rotated Sorted Array (LeetCode 33, Medium) solved with the Binary Search pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/06-binary-search/33-search-rotated-sorted-array.mp4</video:content_loc>
      <video:duration>82</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/81-search-rotated-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/81-search-rotated-ii.jpg</video:thumbnail_loc>
      <video:title>Search in Rotated Sorted Array II (LeetCode 81) — Video Explanation</video:title>
      <video:description>Animated Binary Search revision video: Search in Rotated Sorted Array II (LeetCode 81, Medium) solved with the Binary Search pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/06-binary-search/81-search-rotated-ii.mp4</video:content_loc>
      <video:duration>75</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/875-koko-eating-bananas</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/875-koko-eating-bananas.jpg</video:thumbnail_loc>
      <video:title>Koko Eating Bananas (LeetCode 875) — Video Explanation</video:title>
      <video:description>Animated Binary Search revision video: Koko Eating Bananas (LeetCode 875, Medium) solved with the Binary Search on Answer pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/06-binary-search/875-koko-eating-bananas.mp4</video:content_loc>
      <video:duration>80</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/1011-capacity-to-ship-packages</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/1011-capacity-to-ship-packages.jpg</video:thumbnail_loc>
      <video:title>Capacity To Ship Packages Within D Days (LeetCode 1011) — Video Explanation</video:title>
      <video:description>Animated Binary Search revision video: Capacity To Ship Packages Within D Days (LeetCode 1011, Medium) solved with the Binary Search on Answer pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/06-binary-search/1011-capacity-to-ship-packages.mp4</video:content_loc>
      <video:duration>73</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/410-split-array-largest-sum</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/410-split-array-largest-sum.jpg</video:thumbnail_loc>
      <video:title>Split Array Largest Sum (LeetCode 410) — Video Explanation</video:title>
      <video:description>Animated Binary Search revision video: Split Array Largest Sum (LeetCode 410, Hard) solved with the Binary Search on Answer pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/06-binary-search/410-split-array-largest-sum.mp4</video:content_loc>
      <video:duration>69</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/gfg-allocate-minimum-pages</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/gfg-allocate-minimum-pages.jpg</video:thumbnail_loc>
      <video:title>Allocate Minimum Number of Pages (GFG) — Video Explanation</video:title>
      <video:description>Animated Binary Search revision video: Allocate Minimum Number of Pages (GFG, Hard) solved with the Binary Search on Answer pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/06-binary-search/gfg-allocate-minimum-pages.mp4</video:content_loc>
      <video:duration>85</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/ib-painters-partition</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/ib-painters-partition.jpg</video:thumbnail_loc>
      <video:title>The Painter&apos;s Partition Problem (InterviewBit) — Video Explanation</video:title>
      <video:description>Animated Binary Search revision video: The Painter&apos;s Partition Problem (InterviewBit, Hard) solved with the Binary Search on Answer pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/06-binary-search/ib-painters-partition.mp4</video:content_loc>
      <video:duration>75</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/4-median-two-sorted-arrays</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/4-median-two-sorted-arrays.jpg</video:thumbnail_loc>
      <video:title>Median of Two Sorted Arrays (LeetCode 4) — Video Explanation</video:title>
      <video:description>Animated Binary Search revision video: Median of Two Sorted Arrays (LeetCode 4, Hard) solved with the Binary Search on Partition pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/06-binary-search/4-median-two-sorted-arrays.mp4</video:content_loc>
      <video:duration>96</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/83-remove-duplicates-sorted-list</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/83-remove-duplicates-sorted-list.jpg</video:thumbnail_loc>
      <video:title>Remove Duplicates from Sorted List (LeetCode 83) — Video Explanation</video:title>
      <video:description>Animated Linked List revision video: Remove Duplicates from Sorted List (LeetCode 83, Easy) solved with the Linked List Traversal pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/07-linked-list/83-remove-duplicates-sorted-list.mp4</video:content_loc>
      <video:duration>66</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/206-reverse-linked-list</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/206-reverse-linked-list.jpg</video:thumbnail_loc>
      <video:title>Reverse Linked List (LeetCode 206) — Video Explanation</video:title>
      <video:description>Animated Linked List revision video: Reverse Linked List (LeetCode 206, Easy) solved with the Pointer Reversal pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/07-linked-list/206-reverse-linked-list.mp4</video:content_loc>
      <video:duration>65</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/141-linked-list-cycle</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/141-linked-list-cycle.jpg</video:thumbnail_loc>
      <video:title>Linked List Cycle (LeetCode 141) — Video Explanation</video:title>
      <video:description>Animated Linked List revision video: Linked List Cycle (LeetCode 141, Easy) solved with the Fast &amp; Slow Pointers pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/07-linked-list/141-linked-list-cycle.mp4</video:content_loc>
      <video:duration>71</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/876-middle-of-linked-list</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/876-middle-of-linked-list.jpg</video:thumbnail_loc>
      <video:title>Middle of Linked List (LeetCode 876) — Video Explanation</video:title>
      <video:description>Animated Linked List revision video: Middle of Linked List (LeetCode 876, Easy) solved with the Fast &amp; Slow Pointers pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/07-linked-list/876-middle-of-linked-list.mp4</video:content_loc>
      <video:duration>59</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/19-remove-nth-from-end</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/19-remove-nth-from-end.jpg</video:thumbnail_loc>
      <video:title>Remove Nth Node From End of List (LeetCode 19) — Video Explanation</video:title>
      <video:description>Animated Linked List revision video: Remove Nth Node From End of List (LeetCode 19, Medium) solved with the Two Pointers with Gap pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/07-linked-list/19-remove-nth-from-end.mp4</video:content_loc>
      <video:duration>75</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/138-copy-list-with-random-pointer</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/138-copy-list-with-random-pointer.jpg</video:thumbnail_loc>
      <video:title>Copy List with Random Pointer (LeetCode 138) — Video Explanation</video:title>
      <video:description>Animated Linked List revision video: Copy List with Random Pointer (LeetCode 138, Medium) solved with the Interleaving pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/07-linked-list/138-copy-list-with-random-pointer.mp4</video:content_loc>
      <video:duration>90</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/2-add-two-numbers</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/2-add-two-numbers.jpg</video:thumbnail_loc>
      <video:title>Add Two Numbers (LeetCode 2) — Video Explanation</video:title>
      <video:description>Animated Linked List revision video: Add Two Numbers (LeetCode 2, Medium) solved with the Linked List Arithmetic pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/07-linked-list/2-add-two-numbers.mp4</video:content_loc>
      <video:duration>69</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/202-happy-number</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/202-happy-number.jpg</video:thumbnail_loc>
      <video:title>Happy Number (LeetCode 202) — Video Explanation</video:title>
      <video:description>Animated Linked List revision video: Happy Number (LeetCode 202, Easy) solved with the Cycle Detection pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/07-linked-list/202-happy-number.mp4</video:content_loc>
      <video:duration>72</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/92-reverse-linked-list-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/92-reverse-linked-list-ii.jpg</video:thumbnail_loc>
      <video:title>Reverse Linked List II (LeetCode 92) — Video Explanation</video:title>
      <video:description>Animated Linked List revision video: Reverse Linked List II (LeetCode 92, Medium) solved with the Pointer Reversal pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/07-linked-list/92-reverse-linked-list-ii.mp4</video:content_loc>
      <video:duration>72</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/234-palindrome-linked-list</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/234-palindrome-linked-list.jpg</video:thumbnail_loc>
      <video:title>Palindrome Linked List (LeetCode 234) — Video Explanation</video:title>
      <video:description>Animated Linked List revision video: Palindrome Linked List (LeetCode 234, Easy) solved with the Fast &amp; Slow + Reverse pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/07-linked-list/234-palindrome-linked-list.mp4</video:content_loc>
      <video:duration>63</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/143-reorder-list</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/143-reorder-list.jpg</video:thumbnail_loc>
      <video:title>Reorder List (LeetCode 143) — Video Explanation</video:title>
      <video:description>Animated Linked List revision video: Reorder List (LeetCode 143, Medium) solved with the Fast &amp; Slow + Reverse + Merge pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/07-linked-list/143-reorder-list.mp4</video:content_loc>
      <video:duration>65</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/21-merge-two-sorted-lists</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/21-merge-two-sorted-lists.jpg</video:thumbnail_loc>
      <video:title>Merge Two Sorted Lists (LeetCode 21) — Video Explanation</video:title>
      <video:description>Animated Linked List revision video: Merge Two Sorted Lists (LeetCode 21, Easy) solved with the Two Pointers Merge pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/07-linked-list/21-merge-two-sorted-lists.mp4</video:content_loc>
      <video:duration>71</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/23-merge-k-sorted-lists</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/23-merge-k-sorted-lists.jpg</video:thumbnail_loc>
      <video:title>Merge K Sorted Lists (LeetCode 23) — Video Explanation</video:title>
      <video:description>Animated Linked List revision video: Merge K Sorted Lists (LeetCode 23, Hard) solved with the Heap Merge pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/07-linked-list/23-merge-k-sorted-lists.mp4</video:content_loc>
      <video:duration>70</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/25-reverse-nodes-in-k-group</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/25-reverse-nodes-in-k-group.jpg</video:thumbnail_loc>
      <video:title>Reverse Nodes in K-Group (LeetCode 25) — Video Explanation</video:title>
      <video:description>Animated Linked List revision video: Reverse Nodes in K-Group (LeetCode 25, Hard) solved with the Pointer Reversal pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/07-linked-list/25-reverse-nodes-in-k-group.mp4</video:content_loc>
      <video:duration>67</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/142-linked-list-cycle-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/142-linked-list-cycle-ii.jpg</video:thumbnail_loc>
      <video:title>Linked List Cycle II (LeetCode 142) — Video Explanation</video:title>
      <video:description>Animated Linked List revision video: Linked List Cycle II (LeetCode 142, Medium) solved with the Fast &amp; Slow Pointers pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/07-linked-list/142-linked-list-cycle-ii.mp4</video:content_loc>
      <video:duration>74</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/55-jump-game</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/55-jump-game.jpg</video:thumbnail_loc>
      <video:title>Jump Game (LeetCode 55) — Video Explanation</video:title>
      <video:description>Animated Greedy revision video: Jump Game (LeetCode 55, Medium) solved with the Greedy Reach pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/08-greedy/55-jump-game.mp4</video:content_loc>
      <video:duration>78</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/45-jump-game-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/45-jump-game-ii.jpg</video:thumbnail_loc>
      <video:title>Jump Game II (LeetCode 45) — Video Explanation</video:title>
      <video:description>Animated Greedy revision video: Jump Game II (LeetCode 45, Medium) solved with the Greedy BFS Levels pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/08-greedy/45-jump-game-ii.mp4</video:content_loc>
      <video:duration>82</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/135-candy</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/135-candy.jpg</video:thumbnail_loc>
      <video:title>Candy (LeetCode 135) — Video Explanation</video:title>
      <video:description>Animated Greedy revision video: Candy (LeetCode 135, Hard) solved with the Two-Pass Greedy pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/08-greedy/135-candy.mp4</video:content_loc>
      <video:duration>85</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/134-gas-station</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/134-gas-station.jpg</video:thumbnail_loc>
      <video:title>Gas Station (LeetCode 134) — Video Explanation</video:title>
      <video:description>Animated Greedy revision video: Gas Station (LeetCode 134, Medium) solved with the Greedy Reset pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/08-greedy/134-gas-station.mp4</video:content_loc>
      <video:duration>85</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/gfg-minimum-platforms</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/gfg-minimum-platforms.jpg</video:thumbnail_loc>
      <video:title>Minimum Platforms (GFG) — Video Explanation</video:title>
      <video:description>Animated Greedy revision video: Minimum Platforms (GFG, Medium) solved with the Sort + Sweep pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/08-greedy/gfg-minimum-platforms.mp4</video:content_loc>
      <video:duration>86</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/763-partition-labels</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/763-partition-labels.jpg</video:thumbnail_loc>
      <video:title>Partition Labels (LeetCode 763) — Video Explanation</video:title>
      <video:description>Animated Greedy revision video: Partition Labels (LeetCode 763, Medium) solved with the Greedy Last Occurrence pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/08-greedy/763-partition-labels.mp4</video:content_loc>
      <video:duration>89</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/56-merge-intervals</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/56-merge-intervals.jpg</video:thumbnail_loc>
      <video:title>Merge Intervals (LeetCode 56) — Video Explanation</video:title>
      <video:description>Animated Intervals revision video: Merge Intervals (LeetCode 56, Medium) solved with the Sort + Merge pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/09-intervals/56-merge-intervals.mp4</video:content_loc>
      <video:duration>83</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/57-insert-interval</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/57-insert-interval.jpg</video:thumbnail_loc>
      <video:title>Insert Interval (LeetCode 57) — Video Explanation</video:title>
      <video:description>Animated Intervals revision video: Insert Interval (LeetCode 57, Medium) solved with the Three-Phase Scan pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/09-intervals/57-insert-interval.mp4</video:content_loc>
      <video:duration>84</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/253-meeting-rooms-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/253-meeting-rooms-ii.jpg</video:thumbnail_loc>
      <video:title>Meeting Rooms II (LeetCode 253) — Video Explanation</video:title>
      <video:description>Animated Intervals revision video: Meeting Rooms II (LeetCode 253, Medium) solved with the Min Heap of End Times pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/09-intervals/253-meeting-rooms-ii.mp4</video:content_loc>
      <video:duration>70</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/435-non-overlapping-intervals</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/435-non-overlapping-intervals.jpg</video:thumbnail_loc>
      <video:title>Non-Overlapping Intervals (LeetCode 435) — Video Explanation</video:title>
      <video:description>Animated Intervals revision video: Non-Overlapping Intervals (LeetCode 435, Medium) solved with the Greedy by End pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/09-intervals/435-non-overlapping-intervals.mp4</video:content_loc>
      <video:duration>73</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/452-minimum-arrows-balloons</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/452-minimum-arrows-balloons.jpg</video:thumbnail_loc>
      <video:title>Minimum Number of Arrows to Burst Balloons (LeetCode 452) — Video Explanation</video:title>
      <video:description>Animated Intervals revision video: Minimum Number of Arrows to Burst Balloons (LeetCode 452, Medium) solved with the Greedy by End pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/09-intervals/452-minimum-arrows-balloons.mp4</video:content_loc>
      <video:duration>71</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/78-subsets</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/78-subsets.jpg</video:thumbnail_loc>
      <video:title>Subsets (LeetCode 78) — Video Explanation</video:title>
      <video:description>Animated Backtracking revision video: Subsets (LeetCode 78, Medium) solved with the Backtracking pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/10-backtracking/78-subsets.mp4</video:content_loc>
      <video:duration>79</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/90-subsets-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/90-subsets-ii.jpg</video:thumbnail_loc>
      <video:title>Subsets II (LeetCode 90) — Video Explanation</video:title>
      <video:description>Animated Backtracking revision video: Subsets II (LeetCode 90, Medium) solved with the Backtracking + Skip Duplicates pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/10-backtracking/90-subsets-ii.mp4</video:content_loc>
      <video:duration>77</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/46-permutations</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/46-permutations.jpg</video:thumbnail_loc>
      <video:title>Permutations (LeetCode 46) — Video Explanation</video:title>
      <video:description>Animated Backtracking revision video: Permutations (LeetCode 46, Medium) solved with the Backtracking with Used Set pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/10-backtracking/46-permutations.mp4</video:content_loc>
      <video:duration>72</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/77-combinations</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/77-combinations.jpg</video:thumbnail_loc>
      <video:title>Combinations (LeetCode 77) — Video Explanation</video:title>
      <video:description>Animated Backtracking revision video: Combinations (LeetCode 77, Medium) solved with the Backtracking + Pruning pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/10-backtracking/77-combinations.mp4</video:content_loc>
      <video:duration>75</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/39-combination-sum</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/39-combination-sum.jpg</video:thumbnail_loc>
      <video:title>Combination Sum (LeetCode 39) — Video Explanation</video:title>
      <video:description>Animated Backtracking revision video: Combination Sum (LeetCode 39, Medium) solved with the Backtracking + Reuse pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/10-backtracking/39-combination-sum.mp4</video:content_loc>
      <video:duration>84</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/17-letter-combinations-phone</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/17-letter-combinations-phone.jpg</video:thumbnail_loc>
      <video:title>Letter Combinations of a Phone Number (LeetCode 17) — Video Explanation</video:title>
      <video:description>Animated Backtracking revision video: Letter Combinations of a Phone Number (LeetCode 17, Medium) solved with the Backtracking on Digits pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/10-backtracking/17-letter-combinations-phone.mp4</video:content_loc>
      <video:duration>70</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/22-generate-parentheses</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/22-generate-parentheses.jpg</video:thumbnail_loc>
      <video:title>Generate Parentheses (LeetCode 22) — Video Explanation</video:title>
      <video:description>Animated Backtracking revision video: Generate Parentheses (LeetCode 22, Medium) solved with the Backtracking with Counts pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/10-backtracking/22-generate-parentheses.mp4</video:content_loc>
      <video:duration>89</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/51-n-queens</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/51-n-queens.jpg</video:thumbnail_loc>
      <video:title>N-Queens (LeetCode 51) — Video Explanation</video:title>
      <video:description>Animated Backtracking revision video: N-Queens (LeetCode 51, Hard) solved with the Backtracking on a Board pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/10-backtracking/51-n-queens.mp4</video:content_loc>
      <video:duration>92</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/37-sudoku-solver</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/37-sudoku-solver.jpg</video:thumbnail_loc>
      <video:title>Sudoku Solver (LeetCode 37) — Video Explanation</video:title>
      <video:description>Animated Backtracking revision video: Sudoku Solver (LeetCode 37, Hard) solved with the Backtracking on a Board pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/10-backtracking/37-sudoku-solver.mp4</video:content_loc>
      <video:duration>87</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/102-binary-tree-level-order</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/102-binary-tree-level-order.jpg</video:thumbnail_loc>
      <video:title>Binary Tree Level Order Traversal (LeetCode 102) — Video Explanation</video:title>
      <video:description>Animated Tree revision video: Binary Tree Level Order Traversal (LeetCode 102, Medium) solved with the BFS pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/11-tree/102-binary-tree-level-order.mp4</video:content_loc>
      <video:duration>107</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/637-average-of-levels</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/637-average-of-levels.jpg</video:thumbnail_loc>
      <video:title>Average of Levels in Binary Tree (LeetCode 637) — Video Explanation</video:title>
      <video:description>Animated Tree revision video: Average of Levels in Binary Tree (LeetCode 637, Easy) solved with the BFS Level Order pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/11-tree/637-average-of-levels.mp4</video:content_loc>
      <video:duration>155</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/103-zigzag-level-order</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/103-zigzag-level-order.jpg</video:thumbnail_loc>
      <video:title>Binary Tree Zigzag Level Order Traversal (LeetCode 103) — Video Explanation</video:title>
      <video:description>Animated Tree revision video: Binary Tree Zigzag Level Order Traversal (LeetCode 103, Medium) solved with the BFS Level Order pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/11-tree/103-zigzag-level-order.mp4</video:content_loc>
      <video:duration>138</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/199-right-side-view</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/199-right-side-view.jpg</video:thumbnail_loc>
      <video:title>Binary Tree Right Side View (LeetCode 199) — Video Explanation</video:title>
      <video:description>Animated Tree revision video: Binary Tree Right Side View (LeetCode 199, Medium) solved with the BFS Level Order pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/11-tree/199-right-side-view.mp4</video:content_loc>
      <video:duration>110</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/101-symmetric-tree</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/101-symmetric-tree.jpg</video:thumbnail_loc>
      <video:title>Symmetric Tree (LeetCode 101) — Video Explanation</video:title>
      <video:description>Animated Tree revision video: Symmetric Tree (LeetCode 101, Easy) solved with the Mirror Recursion pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/11-tree/101-symmetric-tree.mp4</video:content_loc>
      <video:duration>118</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/543-diameter-of-binary-tree</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/543-diameter-of-binary-tree.jpg</video:thumbnail_loc>
      <video:title>Diameter of Binary Tree (LeetCode 543) — Video Explanation</video:title>
      <video:description>Animated Tree revision video: Diameter of Binary Tree (LeetCode 543, Easy) solved with the DFS Height pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/11-tree/543-diameter-of-binary-tree.mp4</video:content_loc>
      <video:duration>118</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/226-invert-binary-tree</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/226-invert-binary-tree.jpg</video:thumbnail_loc>
      <video:title>Invert Binary Tree (LeetCode 226) — Video Explanation</video:title>
      <video:description>Animated Tree revision video: Invert Binary Tree (LeetCode 226, Easy) solved with the DFS Swap pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/11-tree/226-invert-binary-tree.mp4</video:content_loc>
      <video:duration>110</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/104-maximum-depth</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/104-maximum-depth.jpg</video:thumbnail_loc>
      <video:title>Maximum Depth of Binary Tree (LeetCode 104) — Video Explanation</video:title>
      <video:description>Animated Tree revision video: Maximum Depth of Binary Tree (LeetCode 104, Easy) solved with the DFS Height pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/11-tree/104-maximum-depth.mp4</video:content_loc>
      <video:duration>96</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/110-balanced-binary-tree</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/110-balanced-binary-tree.jpg</video:thumbnail_loc>
      <video:title>Balanced Binary Tree (LeetCode 110) — Video Explanation</video:title>
      <video:description>Animated Tree revision video: Balanced Binary Tree (LeetCode 110, Easy) solved with the DFS Height with Early Exit pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/11-tree/110-balanced-binary-tree.mp4</video:content_loc>
      <video:duration>127</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/108-sorted-array-to-bst</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/108-sorted-array-to-bst.jpg</video:thumbnail_loc>
      <video:title>Convert Sorted Array to Binary Search Tree (LeetCode 108) — Video Explanation</video:title>
      <video:description>Animated Tree revision video: Convert Sorted Array to Binary Search Tree (LeetCode 108, Easy) solved with the Divide and Conquer pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/11-tree/108-sorted-array-to-bst.mp4</video:content_loc>
      <video:duration>126</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/114-flatten-to-linked-list</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/114-flatten-to-linked-list.jpg</video:thumbnail_loc>
      <video:title>Flatten Binary Tree to Linked List (LeetCode 114) — Video Explanation</video:title>
      <video:description>Animated Tree revision video: Flatten Binary Tree to Linked List (LeetCode 114, Medium) solved with the Preorder Rewiring pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/11-tree/114-flatten-to-linked-list.mp4</video:content_loc>
      <video:duration>146</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/98-validate-bst</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/98-validate-bst.jpg</video:thumbnail_loc>
      <video:title>Validate Binary Search Tree (LeetCode 98) — Video Explanation</video:title>
      <video:description>Animated Tree revision video: Validate Binary Search Tree (LeetCode 98, Medium) solved with the DFS with Bounds pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/11-tree/98-validate-bst.mp4</video:content_loc>
      <video:duration>137</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/236-lowest-common-ancestor</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/236-lowest-common-ancestor.jpg</video:thumbnail_loc>
      <video:title>Lowest Common Ancestor of a Binary Tree (LeetCode 236) — Video Explanation</video:title>
      <video:description>Animated Tree revision video: Lowest Common Ancestor of a Binary Tree (LeetCode 236, Medium) solved with the Postorder DFS pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/11-tree/236-lowest-common-ancestor.mp4</video:content_loc>
      <video:duration>137</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/230-kth-smallest-bst</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/230-kth-smallest-bst.jpg</video:thumbnail_loc>
      <video:title>Kth Smallest Element in a BST (LeetCode 230) — Video Explanation</video:title>
      <video:description>Animated Tree revision video: Kth Smallest Element in a BST (LeetCode 230, Medium) solved with the Inorder Counting pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/11-tree/230-kth-smallest-bst.mp4</video:content_loc>
      <video:duration>109</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/105-construct-from-preorder-inorder</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/105-construct-from-preorder-inorder.jpg</video:thumbnail_loc>
      <video:title>Construct Binary Tree from Preorder and Inorder Traversal (LeetCode 105) — Video Explanation</video:title>
      <video:description>Animated Tree revision video: Construct Binary Tree from Preorder and Inorder Traversal (LeetCode 105, Medium) solved with the Divide and Conquer pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/11-tree/105-construct-from-preorder-inorder.mp4</video:content_loc>
      <video:duration>136</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/297-serialize-deserialize-binary-tree</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/297-serialize-deserialize-binary-tree.jpg</video:thumbnail_loc>
      <video:title>Serialize and Deserialize Binary Tree (LeetCode 297) — Video Explanation</video:title>
      <video:description>Animated Tree revision video: Serialize and Deserialize Binary Tree (LeetCode 297, Hard) solved with the Preorder with Null Markers pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/11-tree/297-serialize-deserialize-binary-tree.mp4</video:content_loc>
      <video:duration>129</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/112-path-sum</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/112-path-sum.jpg</video:thumbnail_loc>
      <video:title>Path Sum (LeetCode 112) — Video Explanation</video:title>
      <video:description>Animated Tree revision video: Path Sum (LeetCode 112, Easy) solved with the DFS with Remaining Target pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/11-tree/112-path-sum.mp4</video:content_loc>
      <video:duration>103</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/113-path-sum-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/113-path-sum-ii.jpg</video:thumbnail_loc>
      <video:title>Path Sum II (LeetCode 113) — Video Explanation</video:title>
      <video:description>Animated Tree revision video: Path Sum II (LeetCode 113, Medium) solved with the DFS Backtracking pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/11-tree/113-path-sum-ii.mp4</video:content_loc>
      <video:duration>111</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/129-sum-root-to-leaf-numbers</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/129-sum-root-to-leaf-numbers.jpg</video:thumbnail_loc>
      <video:title>Sum Root to Leaf Numbers (LeetCode 129) — Video Explanation</video:title>
      <video:description>Animated Tree revision video: Sum Root to Leaf Numbers (LeetCode 129, Medium) solved with the DFS Carry Value pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/11-tree/129-sum-root-to-leaf-numbers.mp4</video:content_loc>
      <video:duration>105</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/124-binary-tree-max-path-sum</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/124-binary-tree-max-path-sum.jpg</video:thumbnail_loc>
      <video:title>Binary Tree Maximum Path Sum (LeetCode 124) — Video Explanation</video:title>
      <video:description>Animated Tree revision video: Binary Tree Maximum Path Sum (LeetCode 124, Hard) solved with the DFS Gain pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/11-tree/124-binary-tree-max-path-sum.mp4</video:content_loc>
      <video:duration>130</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/94-binary-tree-inorder-traversal</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/94-binary-tree-inorder-traversal.jpg</video:thumbnail_loc>
      <video:title>Binary Tree Inorder Traversal (LeetCode 94) — Video Explanation</video:title>
      <video:description>Animated Tree revision video: Binary Tree Inorder Traversal (LeetCode 94, Easy) solved with the Inorder with Stack pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/11-tree/94-binary-tree-inorder-traversal.mp4</video:content_loc>
      <video:duration>117</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/1046-last-stone-weight</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/1046-last-stone-weight.jpg</video:thumbnail_loc>
      <video:title>Last Stone Weight (LeetCode 1046) — Video Explanation</video:title>
      <video:description>Animated Heap / Priority Queue revision video: Last Stone Weight (LeetCode 1046, Easy) solved with the Max Heap Simulation pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/12-heap-priority-queue/1046-last-stone-weight.mp4</video:content_loc>
      <video:duration>123</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/215-kth-largest-element</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/215-kth-largest-element.jpg</video:thumbnail_loc>
      <video:title>Kth Largest Element in an Array (LeetCode 215) — Video Explanation</video:title>
      <video:description>Animated Heap / Priority Queue revision video: Kth Largest Element in an Array (LeetCode 215, Medium) solved with the Min Heap of Size K pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/12-heap-priority-queue/215-kth-largest-element.mp4</video:content_loc>
      <video:duration>111</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/347-top-k-frequent-elements</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/347-top-k-frequent-elements.jpg</video:thumbnail_loc>
      <video:title>Top K Frequent Elements (LeetCode 347) — Video Explanation</video:title>
      <video:description>Animated Heap / Priority Queue revision video: Top K Frequent Elements (LeetCode 347, Medium) solved with the Count + Min Heap pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/12-heap-priority-queue/347-top-k-frequent-elements.mp4</video:content_loc>
      <video:duration>107</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/973-k-closest-points</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/973-k-closest-points.jpg</video:thumbnail_loc>
      <video:title>K Closest Points to Origin (LeetCode 973) — Video Explanation</video:title>
      <video:description>Animated Heap / Priority Queue revision video: K Closest Points to Origin (LeetCode 973, Medium) solved with the Max Heap of Size K pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/12-heap-priority-queue/973-k-closest-points.mp4</video:content_loc>
      <video:duration>103</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/621-task-scheduler</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/621-task-scheduler.jpg</video:thumbnail_loc>
      <video:title>Task Scheduler (LeetCode 621) — Video Explanation</video:title>
      <video:description>Animated Heap / Priority Queue revision video: Task Scheduler (LeetCode 621, Medium) solved with the Greedy by Max Frequency pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/12-heap-priority-queue/621-task-scheduler.mp4</video:content_loc>
      <video:duration>121</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/295-find-median-data-stream</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/295-find-median-data-stream.jpg</video:thumbnail_loc>
      <video:title>Find Median from Data Stream (LeetCode 295) — Video Explanation</video:title>
      <video:description>Animated Heap / Priority Queue revision video: Find Median from Data Stream (LeetCode 295, Hard) solved with the Two Heaps pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/12-heap-priority-queue/295-find-median-data-stream.mp4</video:content_loc>
      <video:duration>120</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/1971-find-path-exists</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/1971-find-path-exists.jpg</video:thumbnail_loc>
      <video:title>Find if Path Exists in Graph (LeetCode 1971) — Video Explanation</video:title>
      <video:description>Animated Graph revision video: Find if Path Exists in Graph (LeetCode 1971, Easy) solved with the BFS / Union Find pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/13-graph/1971-find-path-exists.mp4</video:content_loc>
      <video:duration>120</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/994-rotting-oranges</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/994-rotting-oranges.jpg</video:thumbnail_loc>
      <video:title>Rotting Oranges (LeetCode 994) — Video Explanation</video:title>
      <video:description>Animated Graph revision video: Rotting Oranges (LeetCode 994, Medium) solved with the Multi-Source BFS pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/13-graph/994-rotting-oranges.mp4</video:content_loc>
      <video:duration>120</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/133-clone-graph</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/133-clone-graph.jpg</video:thumbnail_loc>
      <video:title>Clone Graph (LeetCode 133) — Video Explanation</video:title>
      <video:description>Animated Graph revision video: Clone Graph (LeetCode 133, Medium) solved with the DFS + Hash Map pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/13-graph/133-clone-graph.mp4</video:content_loc>
      <video:duration>106</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/207-course-schedule</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/207-course-schedule.jpg</video:thumbnail_loc>
      <video:title>Course Schedule (LeetCode 207) — Video Explanation</video:title>
      <video:description>Animated Graph revision video: Course Schedule (LeetCode 207, Medium) solved with the Topological Sort pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/13-graph/207-course-schedule.mp4</video:content_loc>
      <video:duration>123</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/210-course-schedule-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/210-course-schedule-ii.jpg</video:thumbnail_loc>
      <video:title>Course Schedule II (LeetCode 210) — Video Explanation</video:title>
      <video:description>Animated Graph revision video: Course Schedule II (LeetCode 210, Medium) solved with the Topological Sort pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/13-graph/210-course-schedule-ii.mp4</video:content_loc>
      <video:duration>110</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/gfg-is-graph-a-tree</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/gfg-is-graph-a-tree.jpg</video:thumbnail_loc>
      <video:title>Is Graph a Tree? (GFG) — Video Explanation</video:title>
      <video:description>Animated Graph revision video: Is Graph a Tree? (GFG, Medium) solved with the Union Find pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/13-graph/gfg-is-graph-a-tree.mp4</video:content_loc>
      <video:duration>115</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/417-pacific-atlantic</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/417-pacific-atlantic.jpg</video:thumbnail_loc>
      <video:title>Pacific Atlantic Water Flow (LeetCode 417) — Video Explanation</video:title>
      <video:description>Animated Graph revision video: Pacific Atlantic Water Flow (LeetCode 417, Medium) solved with the Reverse Multi-Source DFS pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/13-graph/417-pacific-atlantic.mp4</video:content_loc>
      <video:duration>114</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/743-network-delay-time</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/743-network-delay-time.jpg</video:thumbnail_loc>
      <video:title>Network Delay Time (LeetCode 743) — Video Explanation</video:title>
      <video:description>Animated Graph revision video: Network Delay Time (LeetCode 743, Medium) solved with the Dijkstra pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/13-graph/743-network-delay-time.mp4</video:content_loc>
      <video:duration>118</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/787-cheapest-flights-k-stops</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/787-cheapest-flights-k-stops.jpg</video:thumbnail_loc>
      <video:title>Cheapest Flights Within K Stops (LeetCode 787) — Video Explanation</video:title>
      <video:description>Animated Graph revision video: Cheapest Flights Within K Stops (LeetCode 787, Medium) solved with the Bellman-Ford with Rounds pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/13-graph/787-cheapest-flights-k-stops.mp4</video:content_loc>
      <video:duration>134</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/399-evaluate-division</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/399-evaluate-division.jpg</video:thumbnail_loc>
      <video:title>Evaluate Division (LeetCode 399) — Video Explanation</video:title>
      <video:description>Animated Graph revision video: Evaluate Division (LeetCode 399, Medium) solved with the Weighted Graph DFS pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/13-graph/399-evaluate-division.mp4</video:content_loc>
      <video:duration>120</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/1584-min-cost-connect-points</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/1584-min-cost-connect-points.jpg</video:thumbnail_loc>
      <video:title>Min Cost to Connect All Points (LeetCode 1584) — Video Explanation</video:title>
      <video:description>Animated Graph revision video: Min Cost to Connect All Points (LeetCode 1584, Medium) solved with the Minimum Spanning Tree pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/13-graph/1584-min-cost-connect-points.mp4</video:content_loc>
      <video:duration>110</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/127-word-ladder</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/127-word-ladder.jpg</video:thumbnail_loc>
      <video:title>Word Ladder (LeetCode 127) — Video Explanation</video:title>
      <video:description>Animated Graph revision video: Word Ladder (LeetCode 127, Hard) solved with the BFS on Implicit Graph pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/13-graph/127-word-ladder.mp4</video:content_loc>
      <video:duration>119</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/684-redundant-connection</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/684-redundant-connection.jpg</video:thumbnail_loc>
      <video:title>Redundant Connection (LeetCode 684) — Video Explanation</video:title>
      <video:description>Animated Graph revision video: Redundant Connection (LeetCode 684, Medium) solved with the Union Find pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/13-graph/684-redundant-connection.mp4</video:content_loc>
      <video:duration>105</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/509-fibonacci-number</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/509-fibonacci-number.jpg</video:thumbnail_loc>
      <video:title>Fibonacci Number (LeetCode 509) — Video Explanation</video:title>
      <video:description>Animated Dynamic Programming revision video: Fibonacci Number (LeetCode 509, Easy) solved with the 1D DP pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/14-dynamic-programming/509-fibonacci-number.mp4</video:content_loc>
      <video:duration>107</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/70-climbing-stairs</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/70-climbing-stairs.jpg</video:thumbnail_loc>
      <video:title>Climbing Stairs (LeetCode 70) — Video Explanation</video:title>
      <video:description>Animated Dynamic Programming revision video: Climbing Stairs (LeetCode 70, Easy) solved with the 1D DP pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/14-dynamic-programming/70-climbing-stairs.mp4</video:content_loc>
      <video:duration>91</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/746-min-cost-climbing-stairs</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/746-min-cost-climbing-stairs.jpg</video:thumbnail_loc>
      <video:title>Min Cost Climbing Stairs (LeetCode 746) — Video Explanation</video:title>
      <video:description>Animated Dynamic Programming revision video: Min Cost Climbing Stairs (LeetCode 746, Easy) solved with the 1D DP pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/14-dynamic-programming/746-min-cost-climbing-stairs.mp4</video:content_loc>
      <video:duration>125</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/62-unique-paths</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/62-unique-paths.jpg</video:thumbnail_loc>
      <video:title>Unique Paths (LeetCode 62) — Video Explanation</video:title>
      <video:description>Animated Dynamic Programming revision video: Unique Paths (LeetCode 62, Easy) solved with the 2D Grid DP pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/14-dynamic-programming/62-unique-paths.mp4</video:content_loc>
      <video:duration>94</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/63-unique-paths-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/63-unique-paths-ii.jpg</video:thumbnail_loc>
      <video:title>Unique Paths II (LeetCode 63) — Video Explanation</video:title>
      <video:description>Animated Dynamic Programming revision video: Unique Paths II (LeetCode 63, Medium) solved with the 2D Grid DP pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/14-dynamic-programming/63-unique-paths-ii.mp4</video:content_loc>
      <video:duration>112</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/120-triangle</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/120-triangle.jpg</video:thumbnail_loc>
      <video:title>Triangle (LeetCode 120) — Video Explanation</video:title>
      <video:description>Animated Dynamic Programming revision video: Triangle (LeetCode 120, Medium) solved with the Bottom-Up DP pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/14-dynamic-programming/120-triangle.mp4</video:content_loc>
      <video:duration>105</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/198-house-robber</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/198-house-robber.jpg</video:thumbnail_loc>
      <video:title>House Robber (LeetCode 198) — Video Explanation</video:title>
      <video:description>Animated Dynamic Programming revision video: House Robber (LeetCode 198, Medium) solved with the 1D DP pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/14-dynamic-programming/198-house-robber.mp4</video:content_loc>
      <video:duration>109</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/213-house-robber-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/213-house-robber-ii.jpg</video:thumbnail_loc>
      <video:title>House Robber II (LeetCode 213) — Video Explanation</video:title>
      <video:description>Animated Dynamic Programming revision video: House Robber II (LeetCode 213, Medium) solved with the Circular 1D DP pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/14-dynamic-programming/213-house-robber-ii.mp4</video:content_loc>
      <video:duration>103</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/152-maximum-product-subarray</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/152-maximum-product-subarray.jpg</video:thumbnail_loc>
      <video:title>Maximum Product Subarray (LeetCode 152) — Video Explanation</video:title>
      <video:description>Animated Dynamic Programming revision video: Maximum Product Subarray (LeetCode 152, Medium) solved with the Track Max and Min pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/14-dynamic-programming/152-maximum-product-subarray.mp4</video:content_loc>
      <video:duration>114</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/300-longest-increasing-subsequence</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/300-longest-increasing-subsequence.jpg</video:thumbnail_loc>
      <video:title>Longest Increasing Subsequence (LeetCode 300) — Video Explanation</video:title>
      <video:description>Animated Dynamic Programming revision video: Longest Increasing Subsequence (LeetCode 300, Medium) solved with the 1D DP pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/14-dynamic-programming/300-longest-increasing-subsequence.mp4</video:content_loc>
      <video:duration>118</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/91-decode-ways</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/91-decode-ways.jpg</video:thumbnail_loc>
      <video:title>Decode Ways (LeetCode 91) — Video Explanation</video:title>
      <video:description>Animated Dynamic Programming revision video: Decode Ways (LeetCode 91, Medium) solved with the 1D DP pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/14-dynamic-programming/91-decode-ways.mp4</video:content_loc>
      <video:duration>119</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/322-coin-change</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/322-coin-change.jpg</video:thumbnail_loc>
      <video:title>Coin Change (LeetCode 322) — Video Explanation</video:title>
      <video:description>Animated Dynamic Programming revision video: Coin Change (LeetCode 322, Medium) solved with the Unbounded Knapsack pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/14-dynamic-programming/322-coin-change.mp4</video:content_loc>
      <video:duration>126</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/1143-longest-common-subsequence</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/1143-longest-common-subsequence.jpg</video:thumbnail_loc>
      <video:title>Longest Common Subsequence (LeetCode 1143) — Video Explanation</video:title>
      <video:description>Animated Dynamic Programming revision video: Longest Common Subsequence (LeetCode 1143, Medium) solved with the 2D String DP pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/14-dynamic-programming/1143-longest-common-subsequence.mp4</video:content_loc>
      <video:duration>112</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/72-edit-distance</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/72-edit-distance.jpg</video:thumbnail_loc>
      <video:title>Edit Distance (LeetCode 72) — Video Explanation</video:title>
      <video:description>Animated Dynamic Programming revision video: Edit Distance (LeetCode 72, Hard) solved with the 2D String DP pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/14-dynamic-programming/72-edit-distance.mp4</video:content_loc>
      <video:duration>115</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/gfg-longest-common-substring</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/gfg-longest-common-substring.jpg</video:thumbnail_loc>
      <video:title>Longest Common Substring (GFG) — Video Explanation</video:title>
      <video:description>Animated Dynamic Programming revision video: Longest Common Substring (GFG, Medium) solved with the 2D String DP pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/14-dynamic-programming/gfg-longest-common-substring.mp4</video:content_loc>
      <video:duration>108</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/139-word-break</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/139-word-break.jpg</video:thumbnail_loc>
      <video:title>Word Break (LeetCode 139) — Video Explanation</video:title>
      <video:description>Animated Dynamic Programming revision video: Word Break (LeetCode 139, Medium) solved with the 1D DP over Prefixes pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/14-dynamic-programming/139-word-break.mp4</video:content_loc>
      <video:duration>110</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/416-partition-equal-subset-sum</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/416-partition-equal-subset-sum.jpg</video:thumbnail_loc>
      <video:title>Partition Equal Subset Sum (LeetCode 416) — Video Explanation</video:title>
      <video:description>Animated Dynamic Programming revision video: Partition Equal Subset Sum (LeetCode 416, Medium) solved with the 0/1 Knapsack pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/14-dynamic-programming/416-partition-equal-subset-sum.mp4</video:content_loc>
      <video:duration>109</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/389-find-the-difference</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/389-find-the-difference.jpg</video:thumbnail_loc>
      <video:title>Find the Difference (LeetCode 389) — Video Explanation</video:title>
      <video:description>Animated Bit Manipulation revision video: Find the Difference (LeetCode 389, Easy) solved with the XOR on Characters pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/15-bit-manipulation/389-find-the-difference.mp4</video:content_loc>
      <video:duration>81</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/191-number-of-1-bits</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/191-number-of-1-bits.jpg</video:thumbnail_loc>
      <video:title>Number of 1 Bits (LeetCode 191) — Video Explanation</video:title>
      <video:description>Animated Bit Manipulation revision video: Number of 1 Bits (LeetCode 191, Easy) solved with the Brian Kernighan pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/15-bit-manipulation/191-number-of-1-bits.mp4</video:content_loc>
      <video:duration>86</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/231-power-of-two</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/231-power-of-two.jpg</video:thumbnail_loc>
      <video:title>Power of Two (LeetCode 231) — Video Explanation</video:title>
      <video:description>Animated Bit Manipulation revision video: Power of Two (LeetCode 231, Easy) solved with the Single Set Bit pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/15-bit-manipulation/231-power-of-two.mp4</video:content_loc>
      <video:duration>89</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/338-counting-bits</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/338-counting-bits.jpg</video:thumbnail_loc>
      <video:title>Counting Bits (LeetCode 338) — Video Explanation</video:title>
      <video:description>Animated Bit Manipulation revision video: Counting Bits (LeetCode 338, Easy) solved with the DP on Bits pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/15-bit-manipulation/338-counting-bits.mp4</video:content_loc>
      <video:duration>88</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/371-sum-of-two-integers</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/371-sum-of-two-integers.jpg</video:thumbnail_loc>
      <video:title>Sum of Two Integers (LeetCode 371) — Video Explanation</video:title>
      <video:description>Animated Bit Manipulation revision video: Sum of Two Integers (LeetCode 371, Medium) solved with the XOR + Carry pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/15-bit-manipulation/371-sum-of-two-integers.mp4</video:content_loc>
      <video:duration>91</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/260-single-number-iii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/260-single-number-iii.jpg</video:thumbnail_loc>
      <video:title>Single Number III (LeetCode 260) — Video Explanation</video:title>
      <video:description>Animated Bit Manipulation revision video: Single Number III (LeetCode 260, Medium) solved with the XOR + Split by Bit pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/15-bit-manipulation/260-single-number-iii.mp4</video:content_loc>
      <video:duration>97</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/137-single-number-ii</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/137-single-number-ii.jpg</video:thumbnail_loc>
      <video:title>Single Number II (LeetCode 137) — Video Explanation</video:title>
      <video:description>Animated Bit Manipulation revision video: Single Number II (LeetCode 137, Medium) solved with the Bit Counting mod 3 pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/15-bit-manipulation/137-single-number-ii.mp4</video:content_loc>
      <video:duration>82</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/287-find-the-duplicate-number</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/287-find-the-duplicate-number.jpg</video:thumbnail_loc>
      <video:title>Find the Duplicate Number (LeetCode 287) — Video Explanation</video:title>
      <video:description>Animated Bit Manipulation revision video: Find the Duplicate Number (LeetCode 287, Medium) solved with the Bit Counting pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/15-bit-manipulation/287-find-the-duplicate-number.mp4</video:content_loc>
      <video:duration>95</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/136-single-number</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/136-single-number.jpg</video:thumbnail_loc>
      <video:title>Single Number (LeetCode 136) — Video Explanation</video:title>
      <video:description>Animated Bit Manipulation revision video: Single Number (LeetCode 136, Easy) solved with the XOR pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/15-bit-manipulation/136-single-number.mp4</video:content_loc>
      <video:duration>91</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/912-bubble-sort</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/912-bubble-sort.jpg</video:thumbnail_loc>
      <video:title>Bubble Sort (LeetCode 912) — Video Explanation</video:title>
      <video:description>Animated Sorting Algorithms revision video: Bubble Sort (LeetCode 912, Easy) solved with the Adjacent Swaps pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/16-sorting-algorithms/912-bubble-sort.mp4</video:content_loc>
      <video:duration>102</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/912-insertion-sort</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/912-insertion-sort.jpg</video:thumbnail_loc>
      <video:title>Insertion Sort (LeetCode 912) — Video Explanation</video:title>
      <video:description>Animated Sorting Algorithms revision video: Insertion Sort (LeetCode 912, Easy) solved with the Insert into Sorted Prefix pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/16-sorting-algorithms/912-insertion-sort.mp4</video:content_loc>
      <video:duration>96</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/912-quick-sort</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/912-quick-sort.jpg</video:thumbnail_loc>
      <video:title>Quick Sort (LeetCode 912) — Video Explanation</video:title>
      <video:description>Animated Sorting Algorithms revision video: Quick Sort (LeetCode 912, Medium) solved with the Partition + Recursion pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/16-sorting-algorithms/912-quick-sort.mp4</video:content_loc>
      <video:duration>108</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/912-merge-sort</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/912-merge-sort.jpg</video:thumbnail_loc>
      <video:title>Merge Sort (LeetCode 912) — Video Explanation</video:title>
      <video:description>Animated Sorting Algorithms revision video: Merge Sort (LeetCode 912, Medium) solved with the Divide and Conquer pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/16-sorting-algorithms/912-merge-sort.mp4</video:content_loc>
      <video:duration>101</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/dsa-revision/912-heap-sort</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.8</priority>
    <video:video>
      <video:thumbnail_loc>https://videos.dsaanimator.com/posters/912-heap-sort.jpg</video:thumbnail_loc>
      <video:title>Heap Sort (LeetCode 912) — Video Explanation</video:title>
      <video:description>Animated Sorting Algorithms revision video: Heap Sort (LeetCode 912, Medium) solved with the Max Heap pattern — problem, brute force, key idea, dry run and Java code.</video:description>
      <video:content_loc>https://videos.dsaanimator.com/16-sorting-algorithms/912-heap-sort.mp4</video:content_loc>
      <video:duration>107</video:duration>
      <video:publication_date>2026-11-01T09:00:00+05:30</video:publication_date>
      <video:family_friendly>yes</video:family_friendly>
    </video:video>
  </url>
  <url>
    <loc>https://dsaanimator.com/about</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>yearly</changefreq>
    <priority>0.3</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/contact</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>yearly</changefreq>
    <priority>0.3</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/privacy</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>yearly</changefreq>
    <priority>0.3</priority>
  </url>
  <url>
    <loc>https://dsaanimator.com/terms</loc>
    <lastmod>2026-11-02</lastmod>
    <changefreq>yearly</changefreq>
    <priority>0.3</priority>
  </url>
</urlset>
