The home for great developer writing.

We surface the best developer writing from thousands of independent blogs, updated daily.

Finding a duplicated item in an array of N integers in the range 1 to N − 1

· Raymond Chen · April 13, 2026, 8:04 p.m.

Code Old New Thing algorithm data-structures array manipulation Duplicate Detection

Summary

This blog post discusses a technique for finding a duplicated item in an array of integers ranging from 1 to N-1, leveraging the array's special characteristics.

Read full post on devblogs.microsoft.com →

MORE POSTS LIKE THIS

[LeetCode] Make Array Elements Equal to Zero

SongHayoung · Nov 17, 2024

Math problem-solving

Bloom Filters Explained: The Probabilistic Data Structure Powering Instagram, Google, and High-Scale Systems

freeCodeCamp.org · Sep 1, 2026

system-architecture Distributed System

LLM: Devise a plan

Thiago Perrotta · Aug 22, 2026

AI Dev

Grobner / Buchberger / Knuth Bendix for Semirings and Seven Trees in One

philzook58 · Aug 21, 2026

mathematics algebra

How to group array items with Object.groupBy()

Flaviocopes · Aug 22, 2026

Javascript array manipulation

Wrapping a `HashSet` and implementing `Iterator`

Users Rust Lang · Aug 22, 2026

Rust programming

Discover more posts →

AUTHOR

Sponsored

Zulip

Organized team chat for people who take work seriously. Topic-based threading keeps conversations focused.

Become a sponsor →

BLOG POST FEATURED ON

Placeholder image

Add this plugin to your blog