https://h30306.github.io/blog/tags/pigeonhole-principle/Recent content in Pigeonhole-Principle onHugo -- gohugo.ioenhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungWed, 21 Oct 2026 00:00:00 +0000https://h30306.github.io/blog/algorithm/bucket-sort/Wed, 21 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/algorithm/bucket-sort/Split the value range into n - 1 buckets; the largest gap can never fall inside one bucket, so keeping each bucket’s minimum and maximum finds the maximum adjacent difference in linear timehttps://h30306.github.io/blog/leetcode/leetcode-961/Mon, 26 Sep 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-961/LeetCode 961 note: the other n values are distinct, so the first value seen twice is the answer