Skip to content

Latest commit

 

History

History
40 lines (28 loc) · 923 Bytes

File metadata and controls

40 lines (28 loc) · 923 Bytes

Given an array arr of integers, check if there exist two indices i and j such that :

  • i != j
  • 0 <= i, j < arr.length
  • arr[i] == 2 * arr[j]
Examples

Example 1:

Input: arr = [10,2,5,3]
Output: true
Explanation: For i = 0 and j = 2, arr[i] == 10 == 2 * 5 == 2 * arr[j]

Example 2:

Input: arr = [3,1,7,11]
Output: false
Explanation: There is no i and j that satisfy the conditions.

Example 3:

Input: arr = [10,2,6,8,3,12]
Output: true
Explanation: For i = 2 and j = 5, arr[i] * 2 == 6 * 2 == 12 == arr[j]
Constraints
  • 2 <= arr.length <= 500
  • -103 <= arr[i] <= 103