Search
⌘K
Leetcode 1346. Check If N and Its Double Exist
Determine whether the array contains two distinct indices i and j such that one element is exactly double the other (arr[i] == 2 * arr[j]); typically solved with a hash set for O(n) checks while handling the zero-duplicate case.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.