<?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>LeetCode 503 on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/tags/leetcode-503/</link><description>Recent content in LeetCode 503 on Jeanphilo Blog</description><generator>Hugo -- 0.165.0</generator><language>en-us</language><lastBuildDate>Mon, 20 Jul 2026 00:00:00 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/tags/leetcode-503/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 503: Where Does the Right Side End in a Circular Array?</title><link>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/503-next-greater-element-ii/</link><pubDate>Mon, 20 Jul 2026 00:00:00 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/503-next-greater-element-ii/</guid><description>Start from the exact circular next-greater query, build a verifiable scan, then derive a linear monotonic-stack solution that pushes each original index once.</description></item></channel></rss>