<?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>Xor on Jeanphilo Blog</title><link>https://jeanphilogong.github.io/jeanblog/tags/xor/</link><description>Recent content in Xor on Jeanphilo Blog</description><generator>Hugo -- 0.168.0</generator><language>en-us</language><lastBuildDate>Wed, 15 Jul 2026 00:00:00 +0800</lastBuildDate><atom:link href="https://jeanphilogong.github.io/jeanblog/tags/xor/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 136: Single Number Without Growing Extra Storage</title><link>https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/136-single-number/</link><pubDate>Wed, 15 Jul 2026 00:00:00 +0800</pubDate><guid>https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/136-single-number/</guid><description>Start from a set-based pairing baseline, derive XOR cancellation, and solve LeetCode 136 in O(n) time with O(1) extra space.</description></item><item><title>XOR and RC4: From Principles to Go Practice (with Safer Alternatives)</title><link>https://jeanphilogong.github.io/jeanblog/dev/go/xor-rec4-primer/</link><pubDate>Tue, 16 Dec 2025 18:12:00 +0800</pubDate><guid>https://jeanphilogong.github.io/jeanblog/dev/go/xor-rec4-primer/</guid><description>An intro to XOR and RC4 for Go/backend engineers, with runnable examples and safer alternatives.</description></item></channel></rss>