<?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 49 on Jeanphilo Blog</title><link>https://jeanphilogong.github.io/jeanblog/tags/leetcode-49/</link><description>Recent content in LeetCode 49 on Jeanphilo Blog</description><generator>Hugo -- 0.168.0</generator><language>en-us</language><lastBuildDate>Sat, 10 Oct 2026 10:00:00 +0800</lastBuildDate><atom:link href="https://jeanphilogong.github.io/jeanblog/tags/leetcode-49/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 49: Group Anagrams, from Scanning Groups to Building a Grouping Key</title><link>https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/49-group-anagrams/</link><pubDate>Sat, 10 Oct 2026 10:00:00 +0800</pubDate><guid>https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/49-group-anagrams/</guid><description>Build a Python solution one step at a time: compare two anagrams, scan group representatives, then derive sorted-string and character-count keys to understand why hash-table grouping works.</description></item></channel></rss>