Check If N and Its Double Exist in an array - The Coding Shala
Home >> Programming Questions >> N and its double
Check if N and its Double Exist in an array
In this post, we will learn how to check if N and its double exist in an array and will implement its solution in Java.
Given an array arr of integers, check if there exist two integers N and M such that N is the double of M ( i.e. N = 2 * M).
More formally check if there exists two indices i and j such that:
i != jk
0 <= i, j < arr.length
arr[i] == 2 * arr[j]
Input: arr = [10,2,5,3]
Explanation: N = 10 is the double of M = 5,that is, 10 = 2 * 5.
Input: arr = [7,1,14,11]
Explanation: N = 14 is the double of M = 7,that is, 14 = 2 * 7.
Input: arr = [3,1,7,11]
Explanation: In this case does not exist N and M, such that N = 2 * M.
Check N and its double exist Solution
We can check this using HashSet.
Check every number's double and if its divisible by two then check its half in the set.
Other Posts You May Like
- InterviewBit - Colorful Number
- Min Steps in an infinite grid
- LeetCode - Contains Duplicate
- Hackerrank - Minimum Swaps 2
- LeetCode - Swap Nodes in pairs