<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Bit-Manipulation on</title><link>https://h30306.github.io/blog/tags/bit-manipulation/</link><description>Recent content in Bit-Manipulation on</description><generator>Hugo -- gohugo.io</generator><language>en</language><managingEditor>hwork0511@gmail.com (Wei Yi Chung)</managingEditor><webMaster>hwork0511@gmail.com (Wei Yi Chung)</webMaster><copyright>© 2026 Wei Yi Chung</copyright><lastBuildDate>Sat, 12 Apr 2025 00:00:00 +0000</lastBuildDate><atom:link href="https://h30306.github.io/blog/tags/bit-manipulation/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 3513: Number of Unique XOR Triplets I</title><link>https://h30306.github.io/blog/leetcode/leetcode-3513/</link><pubDate>Sat, 12 Apr 2025 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/leetcode/leetcode-3513/</guid><description>LeetCode Problem Solving</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-3513/featured.png"/></item></channel></rss>