Yahoo India Web Search

Search results

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

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

   A medium-level problem that asks to find all the integers that appear twice in an array of length n in O(n) time and constant space. See the input, output, and constraints for examples and solutions.

   • Discuss (999+)

     Find All Duplicates in an Array - Level up your coding...

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

   www.geeksforgeeks.org › find-duplicates-given

   • Cached

   Dec 14, 2023 · Learn how to print the duplicates in an array using nested loop, hash-map, or sorting algorithms. See examples, code, and time complexity analysis for C++, Java, Python, and Javascript.

   • Video Duration: 12 min

3. 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.

4. walkccc.me › LeetCode › problems442. Find All Duplicates in an Array - LeetCode Solutions

   walkccc.me › LeetCode › problems

   • Cached

   class Solution { public: vector<int> findDuplicates(vector<int>& nums) { vector<int> ans; for (const int num : nums) { nums[abs(num) - 1] *= -1; if (nums[abs(num) - 1] > 0) ans.push_back(abs(num)); } return ans; } }; LeetCode Solutions in C++20, Java, Python, MySQL, and TypeScript.

5. 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

   • Video Duration: 12 min

6. algo.monster › liteproblems › 442442. Find All Duplicates in an Array - In-Depth Explanation

   algo.monster › liteproblems › 442

   • Cached

   Learn how to find all the numbers that appear twice in an array using cyclic sort and constant extra space. See the problem description, solution approach, code snippet, and time and space complexity analysis.

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 print duplicate elements in an array of n integers?

   • Given an array of n integers. The task is to print the duplicates in the given array. If there are no duplicates then print -1. Examples: Output: 2 10 11 Input: {5, 40, 1, 40, 100000, 1, 5, 1} Output: 5 40 1 Note: The duplicate elements can be printed in any order.

   Find duplicate elements in an array - GeeksforGeeks

   www.geeksforgeeks.org/find-duplicates-given-array-elements-not-limited-range/

   See all results for this question

   How to return an array of all integers that appear twice?

   • 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: Output: Example 3: Output:

   Find All Duplicates in an Array - LeetCode

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

   See all results for this question

   How to duplicate an array using a hash map?

   • Duplicates in an array in O (n) and by using O (1) extra space | Set-1. Approach: The basic idea is based on the hash map to solve the problem. But there is a catch, the numbers in the array are from 0 to n-1, and the input array has length n. So, the input array itself can be used as a hash map.

   Duplicates in an array in O(n) and by using O(1) extra space | Set-2

   www.geeksforgeeks.org/duplicates-array-using-o1-extra-space-set-2/

   See all results for this question

8. leetcode.ca › 2017/02/14-442-Find-All-Duplicates442 - Find All Duplicates in an Array - Leetcode

   leetcode.ca › 2017/02/14-442-Find-All-Duplicates

   • Cached

   Feb 14, 2017 · Learn how to solve this problem using Java, C++, Python or Go. Given an array of integers in the range [1, n] where each element appears once or twice, return an array of duplicates.