Yahoo India Web Search

Search results

1. www.geeksforgeeks.org › find-duplicates-givenFind duplicate elements in an array - GeeksforGeeks

   www.geeksforgeeks.org › find-duplicates-given

   • Cached

   Dec 14, 2023 · Given an array arr[] consisting of N integers and an integer K, the task is to find the sum of the array elements possible by traversing the array and adding arr[i] / K, K number of times at the end of the array, if arr[i] is divisible by K. Otherwise, stop the traversal.

   • Array Duplicates | Practice | GeeksforGeeks

     Array Duplicates. Difficulty: Easy Accuracy: 18.95%...

   • Duplicates in an array in O(n) and by using O(1) extra space ...

     Given an array of n elements containing elements from 0 to...

2. leetcode.com › problems › find-the-duplicate-numberFind the Duplicate Number - LeetCode

   leetcode.com › problems › find-the-duplicate-number

   Find the Duplicate Number - Given an array of integers nums containing n + 1 integers where each integer is in the range [1, n] inclusive. There is only one repeated number in nums, return this repeated number.

3. leetcode.com › find-all-duplicates-in-an-arrayFind All Duplicates in an Array - LeetCode

   leetcode.com › find-all-duplicates-in-an-array

   Find All Duplicates in an Array - Given an integer array nums of length n where all the integers of nums are in the range [1, n] and each integer appears once or twice, return an array of all the integers that appears twice.

4. www.geeksforgeeks.org › problems › find-duplicatesArray Duplicates | Practice | GeeksforGeeks

   www.geeksforgeeks.org › problems › find-duplicates

   • Cached

   Learn how to find all the elements occurring more than once in an array of size n with elements from 0 to n-1. See examples, constraints, time and space complexity, and company tags for this easy problem.

5. www.tutorialstonight.com › javascript-findJavaScript Find Duplicates in Array - Tutorials Tonight

   www.tutorialstonight.com › javascript-find

   • Cached

   • Using indexOf() and lastIndexOf() Another way to find duplicate elements in an array is by using the indexOf() and lastIndexOf() methods. For each element in the array, check if the first index of the element is equal to the last index of the element, if not, then it is a duplicate element.
   • Using filter() and includes() You can also filter out the duplicate elements from an array using the filter() method. For each element in the array, check if the element is already present in the new array or not, if not, then add it to the new array.
   • Using forEach() and includes() This is the same as using for loop, you need to go through each element in the array and check if the element is already present in the new array or not, if not, then add it to the new array.
   • Using reduce() and includes() The reduce() method executes a function on each element of the array, that results in a single output value of the array.

6. javaconceptoftheday.com › find-duplicates-in-arrayHow To Find Duplicates In Array In Java? - 5 Methods

   javaconceptoftheday.com › find-duplicates-in-array

   • Cached

   Jan 21, 2019 · Learn five methods to find duplicate elements in array in java using Brute Force, Sorting, HashSet, HashMap and Java 8 Streams. Compare the time and space complexity of each method and see the code examples.

7. People also ask

   How to find all duplicates in an array?

   • Find All Duplicates in an Array Given an integer array nums of length n where all the integers of nums are in the range [1, n] and each integer appears once or twice, return an array of all the integers that appears twice. You must write an algorithm that runs in O(n) time and uses only constant extra space. Example 1: Output: [2,3] Example 2:

   Find All Duplicates in an Array - LeetCode

   leetcode.com/problems/find-all-duplicates-in-an-array/

   See all results for this question

   How to find a duplicate number?

   • Find the Duplicate Number - Given an array of integers nums containing n + 1 integers where each integer is in the range [1, n] inclusive. There is only one repeated number in nums, return this repeated number. You must solve the problem without modifying the array nums and uses only constant extra space.

   Find the Duplicate Number - LeetCode

   leetcode.com/problems/find-the-duplicate-number/

   See all results for this question

   How to find duplicate elements in an array using nested for loop?

   • 1. Using Nested for loop The most basic way to find duplicate elements in an array is by using a nested for loops. For each element in the array, check if it is present in the rest of the array or not, if it is present, then increment the count of duplicates by 1.

   JavaScript Find Duplicates in Array (in 5 ways) - Tutorials Tonight

   www.tutorialstonight.com/javascript-find-duplicates-in-array

   See all results for this question

   How to find duplicates by reducing an array in Java?

   • Using reduce () and includes () The reduce () method executes a function on each element of the array, that results in a single output value of the array. You can use this property of the reduce () method to find duplicates by reducing the array by removing the duplicate elements from the array.

   JavaScript Find Duplicates in Array (in 5 ways) - Tutorials Tonight

   www.tutorialstonight.com/javascript-find-duplicates-in-array

   See all results for this question

8. www.geeksforgeeks.org › duplicates-array-using-o1Duplicates in an array in O(n) and by using O(1) extra space ...

   www.geeksforgeeks.org › duplicates-array-using-o1

   • Cached

   Jul 16, 2024 · Given an array of n elements containing elements from 0 to n-1, with any of these numbers appearing any number of times, find these repeating numbers in O(n) and using only constant memory space. Example: Input: n = 7 , array = {1, 2, 3, 1, 3, 6, 6} Output: 1, 3 and 6. Explanation: Duplicate element in the array are 1 , 3 and 6