JavaScript Algorithms: Find All Duplicates in an Array (LeetCode)

Anatolii Kurochkin
Nov 29, 2020 · 2 min read
Image for post
Image for post
Photo by Beth Jnr on Unsplash

Description

Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.

Solution

The first solution that comes to my mind was two nested for loops:

Image for post
Image for post
Image for post
Image for post
Image for post
Image for post
Photo by Fabrizio Verrecchia on Unsplash

JavaScript In Plain English

New JavaScript + Web Development articles every day.

Medium is an open platform where 170 million readers come to find insightful and dynamic thinking. Here, expert and undiscovered voices alike dive into the heart of any topic and bring new ideas to the surface. Learn more

Follow the writers, publications, and topics that matter to you, and you’ll see them on your homepage and in your inbox. Explore

If you have a story to tell, knowledge to share, or a perspective to offer — welcome home. It’s easy and free to post your thinking on any topic. Write on Medium

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store