Finding 3-Digit Even Numbers
You receive an integer array digits , where each element is a digit. The array may contain duplicates.
You need to determine all the unique integers that follow the given requirements:
-
The integer consists of the concatenation of three elements from
digitsin any arbitrary order. -
The integer does not have leading zeros .
-
The integer is even .
For example, if the given digits were [1, 2, 3] , integers 132 and 312 follow the requirements.
Produce a sorted array of the unique integers.
Input: digits = [2,1,3,0]
Output: [102,120,130,132,210,230,302,310,312,320]
Explanation: All the possible integers that follow the requirements are in the output array.
Notice that there are no odd integers or integers with leading zeros.
Input: digits = [2,2,8,8,2]
Output: [222,228,282,288,822,828,882]
Explanation: The same digit can be used as many times as it appears in digits.
In this example, the digit 8 is used twice each time in 288, 828, and 882.
Input: digits = [3,7,5]
Output: []
Explanation: No even integers can be formed using the given digits.
Constraints
3 <= digits.length <= 1000 <= digits[i] <= 9
Did this problem appear in one of your interviews?
Responses stay private.
