DIFF.BLOG
New Following Discover Jobs
More
Top Writers Suggest a blog Upvotes plugin
Report bug Contact About
Sign up
Topics
Follow your own topics →
Menu
New Following Discover Jobs Top Writers
More
Suggest a blog Upvotes plugin Report bug Contact About
Sign up
The home for great developer writing.
We surface the best developer writing from thousands of independent blogs, updated daily.
Join Diff.blog
TOPICS

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

33 · Raymond Chen · April 13, 2026, 8:04 p.m.
Old New Thing Code 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
PS Leetcode
Iterator of mutable references over a hashmap
Users Rust Lang · Aug 16, 2026
Rust HashMap
How should Futhark expose irregular arrays to the programmer?
Futhark Lang · Aug 12, 2026
Futhark programming-languages
Graph neural networks are turning hidden fraud into visible networks
Siliconangle · Aug 10, 2026
AI Cube Event Coverage
Introducing FILE type: a native column type for multimodal data
Mooncake · Aug 7, 2026
Platform Multimodal Data
Testing modern hash table designs in OVN and OVS
Red Hat · Aug 5, 2026
Hashmap Design OVN
Discover more posts →
AUTHOR
BLOG POST FEATURED ON

Placeholder image
Hacker News

3 points

Add this plugin to your blog
RECENT POSTS FROM THE AUTHOR
Choose how you want to continue.
Continue with GitHub Continue with Google