<?xml version="1.0" encoding="utf-8" standalone="yes"?><urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9" xmlns:xhtml="http://www.w3.org/1999/xhtml"><url><loc>https://notes.riyt.dev/notes/</loc><lastmod>2026-05-25T17:29:30+03:00</lastmod></url><url><loc>https://notes.riyt.dev/</loc><lastmod>2026-05-19T21:33:26+03:00</lastmod></url><url><loc>https://notes.riyt.dev/tags/array/</loc><lastmod>2026-04-16T15:22:39+03:00</lastmod></url><url><loc>https://notes.riyt.dev/tags/go/</loc><lastmod>2026-04-16T15:22:39+03:00</lastmod></url><url><loc>https://notes.riyt.dev/notes/leetcode-solutions/minimum-distance-to-the-target-element/</loc><lastmod>2026-04-16T15:22:39+03:00</lastmod></url><url><loc>https://notes.riyt.dev/tags/</loc><lastmod>2026-04-16T15:22:39+03:00</lastmod></url><url><loc>https://notes.riyt.dev/notes/leetcode-solutions/angles-of-a-triangle/</loc><lastmod>2026-04-12T19:19:19+03:00</lastmod></url><url><loc>https://notes.riyt.dev/tags/geometry/</loc><lastmod>2026-04-12T19:19:19+03:00</lastmod></url><url><loc>https://notes.riyt.dev/tags/mathematics/</loc><lastmod>2026-04-12T19:19:19+03:00</lastmod></url><url><loc>https://notes.riyt.dev/tags/sorting/</loc><lastmod>2026-04-12T19:19:19+03:00</lastmod></url><url><loc>https://notes.riyt.dev/notes/leetcode-solutions/find-the-degree-of-each-vertex/</loc><lastmod>2026-04-12T18:47:16+03:00</lastmod></url><url><loc>https://notes.riyt.dev/tags/graph-theory/</loc><lastmod>2026-04-12T18:47:16+03:00</lastmod></url><url><loc>https://notes.riyt.dev/tags/matrix/</loc><lastmod>2026-04-12T18:47:16+03:00</lastmod></url><url><loc>https://notes.riyt.dev/tags/dynamic-programming/</loc><lastmod>2026-04-02T23:17:48+03:00</lastmod></url><url><loc>https://notes.riyt.dev/notes/leetcode-solutions/maximum-amount-of-money-robot-can-earn/</loc><lastmod>2026-04-02T23:17:48+03:00</lastmod></url><url><loc>https://notes.riyt.dev/notes/leetcode-solutions/robot-collisions/</loc><lastmod>2026-04-01T22:28:56+03:00</lastmod></url><url><loc>https://notes.riyt.dev/tags/simulation/</loc><lastmod>2026-04-01T22:28:56+03:00</lastmod></url><url><loc>https://notes.riyt.dev/tags/stack/</loc><lastmod>2026-04-01T22:28:56+03:00</lastmod></url><url><loc>https://notes.riyt.dev/notes/leetcode-solutions/check-if-strings-can-be-made-equal-with-operations-ii/</loc><lastmod>2026-03-29T14:19:22+03:00</lastmod></url><url><loc>https://notes.riyt.dev/tags/hash-table/</loc><lastmod>2026-03-29T14:19:22+03:00</lastmod></url><url><loc>https://notes.riyt.dev/tags/string/</loc><lastmod>2026-03-29T14:19:22+03:00</lastmod></url><url><loc>https://notes.riyt.dev/tags/bit-manipulation/</loc><lastmod>2026-03-28T23:03:34+02:00</lastmod></url><url><loc>https://notes.riyt.dev/notes/leetcode-solutions/minimum-xor-path-in-a-grid/</loc><lastmod>2026-03-28T23:03:34+02:00</lastmod></url><url><loc>https://notes.riyt.dev/tags/rolling-array/</loc><lastmod>2026-03-28T23:03:34+02:00</lastmod></url><url><loc>https://notes.riyt.dev/tags/word-level-parallelism/</loc><lastmod>2026-03-28T23:03:34+02:00</lastmod></url><url><loc>https://notes.riyt.dev/notes/leetcode-solutions/</loc><lastmod>2026-03-25T09:54:46+02:00</lastmod></url><url><loc>https://notes.riyt.dev/categories/</loc></url></urlset>