<feed xmlns="http://www.w3.org/2005/Atom"> <id>https://hyeseonko.github.io/</id><title>Hyeseon Ko</title><subtitle>A minimal, portfolio, sidebar, bootstrap Jekyll theme with responsive web design and focuses on text presentation.</subtitle> <updated>2026-08-20T23:40:57+09:00</updated> <author> <name>Hyeseon Ko</name> <uri>https://hyeseonko.github.io/</uri> </author><link rel="self" type="application/atom+xml" href="https://hyeseonko.github.io/feed.xml"/><link rel="alternate" type="text/html" hreflang="en" href="https://hyeseonko.github.io/"/> <generator uri="https://jekyllrb.com/" version="4.4.1">Jekyll</generator> <rights> © 2026 Hyeseon Ko </rights> <icon>/assets/img/favicons/favicon.ico</icon> <logo>/assets/img/favicons/favicon-96x96.png</logo> <entry><title>Top K Frequent Elements: Why Eviction Is Safe</title><link href="https://hyeseonko.github.io/posts/top-k-frequent-elements-why-eviction-is-safe/" rel="alternate" type="text/html" title="Top K Frequent Elements: Why Eviction Is Safe" /><published>2026-08-20T09:00:00+09:00</published> <updated>2026-08-20T09:00:00+09:00</updated> <id>https://hyeseonko.github.io/posts/top-k-frequent-elements-why-eviction-is-safe/</id> <content src="https://hyeseonko.github.io/posts/top-k-frequent-elements-why-eviction-is-safe/" /> <author> <name>Hyeseon Ko</name> </author> <category term="Algorithms" /> <summary> LC347 Top K Frequent Elements asks for the k most frequent values in an array. The real question The problem splits into two steps, and only one of them is interesting: Count how often each number appears. Pick the top k by count. Step 1 is a Counter. There is nothing to decide. The whole problem is step 2 — and the follow-up note pins down what’s wanted: Your algorithm’s time com... </summary> </entry> <entry><title>Group Anagrams: Choosing a Canonical Key</title><link href="https://hyeseonko.github.io/posts/group-anagrams-canonical-keys/" rel="alternate" type="text/html" title="Group Anagrams: Choosing a Canonical Key" /><published>2026-08-18T09:00:00+09:00</published> <updated>2026-08-18T16:28:24+09:00</updated> <id>https://hyeseonko.github.io/posts/group-anagrams-canonical-keys/</id> <content src="https://hyeseonko.github.io/posts/group-anagrams-canonical-keys/" /> <author> <name>Hyeseon Ko</name> </author> <category term="Algorithms" /> <summary> LC49 Group Anagrams asks you to group words that are permutations of each other. The real question Grouping is trivial once you have the right key: build a dict from key to list, append, done. The entire problem is “what makes two anagrams collide and everything else not?” That’s a canonical form question — pick any representation that is identical for all members of a group and unique across... </summary> </entry> </feed>
