<?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>Hamming Weight on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/tags/hamming-weight/</link><description>Recent content in Hamming Weight on Jeanphilo Blog</description><generator>Hugo -- 0.165.0</generator><language>en-us</language><lastBuildDate>Wed, 15 Jul 2026 00:00:00 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/tags/hamming-weight/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 191: Number of 1 Bits and How to Skip Irrelevant Zeros</title><link>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/191-number-of-1-bits/</link><pubDate>Wed, 15 Jul 2026 00:00:00 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/191-number-of-1-bits/</guid><description>Start from a right-shift baseline, derive how n &amp;amp; (n - 1) clears one lowest set bit, and prove LeetCode 191 with a loop invariant.</description></item></channel></rss>