<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Top-K-Elements on Jesus Oseguera</title><link>https://r0tbyt3.dev/tags/top-k-elements/</link><description>Recent content in Top-K-Elements on Jesus Oseguera</description><generator>Hugo</generator><language>en-us</language><atom:link href="https://r0tbyt3.dev/tags/top-k-elements/index.xml" rel="self" type="application/rss+xml"/><item><title>Top K Elements</title><link>https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/patterns/top-k-elements/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/patterns/top-k-elements/</guid><description>Top K Elements Top K Elements - using a min-heap of size K to efficiently find the K largest or most frequent elements.
Related Links: BFS Pattern Binary Search Pattern DFS Pattern Fast and Slow Pointers Merge Intervals Monotonic Stack Sliding Window Two Pointers Union Find</description></item></channel></rss>