<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Data Structures on Yeah, I Made a Website</title><link>https://site.aaronhsyong.com/categories/data-structures/</link><description>Recent content in Data Structures on Yeah, I Made a Website</description><generator>Hugo -- gohugo.io</generator><language>en</language><managingEditor>aaronhsyong2@gmail.com (Aaron Yong)</managingEditor><webMaster>aaronhsyong2@gmail.com (Aaron Yong)</webMaster><copyright>© 2026 Aaron Yong</copyright><lastBuildDate>Sun, 22 Feb 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://site.aaronhsyong.com/categories/data-structures/index.xml" rel="self" type="application/rss+xml"/><item><title>The Data Structure That's Okay With Being Wrong</title><link>https://site.aaronhsyong.com/posts/the-data-structure-thats-okay-with-being-wrong/</link><pubDate>Sun, 22 Feb 2026 00:00:00 +0000</pubDate><author>aaronhsyong2@gmail.com (Aaron Yong)</author><guid>https://site.aaronhsyong.com/posts/the-data-structure-thats-okay-with-being-wrong/</guid><description>Bloom filters — probabilistic, memory-efficient, and surprisingly useful</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://site.aaronhsyong.com/posts/the-data-structure-thats-okay-with-being-wrong/featured.jpg"/></item></channel></rss>