<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Eulerian Circuit on LeetCode 题解笔记</title><link>https://leetcode-solutions-5zk.pages.dev/tags/eulerian-circuit/</link><description>Recent content in Eulerian Circuit on LeetCode 题解笔记</description><generator>Hugo</generator><language>zh-cn</language><copyright>2026 ZenzZwei</copyright><lastBuildDate>Mon, 11 May 2026 12:12:02 +0800</lastBuildDate><atom:link href="https://leetcode-solutions-5zk.pages.dev/tags/eulerian-circuit/index.xml" rel="self" type="application/rss+xml"/><item><title>2097. 有效数对排列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2097-valid-arrangement-of-pairs/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2097-valid-arrangement-of-pairs/</guid><description>Hard | Array, Depth-First Search, Graph Theory, Eulerian Circuit</description></item><item><title>753. 破解保险箱</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0753-cracking-the-safe/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0753-cracking-the-safe/</guid><description>Hard | String, Depth-First Search, Graph Theory, Eulerian Circuit</description></item><item><title>332. 重新安排行程</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0332-reconstruct-itinerary/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0332-reconstruct-itinerary/</guid><description>Hard | Array, String, Depth-First Search, Graph Theory, Sorting, Heap (Priority Queue), Eulerian Circuit</description></item></channel></rss>