Tap here to switch tabs
Problem
Submissions

Problem: Unique 3-Digit Even Numbers

med
30 min
Try to solve the Unique 3-Digit Even Numbers problem.

Statement

Given an integer array digits, return the total number of unique 33 digit even numbers that can be formed using the elements in digits.

A valid 33 digit even number must satisfy the following conditions:

  • It contains exactly 33 digits.

  • It does not have a leading 00.

  • The integer formed is even.

  • Each element in digits can be used at most as many times as it appears in the array.

Constraints:

  • 3≤3 \leq digits.length ≤10\leq 10

  • 0≤0 \leq digits[i] ≤9\leq 9

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Unique 3-Digit Even Numbers

med
30 min
Try to solve the Unique 3-Digit Even Numbers problem.

Statement

Given an integer array digits, return the total number of unique 33 digit even numbers that can be formed using the elements in digits.

A valid 33 digit even number must satisfy the following conditions:

  • It contains exactly 33 digits.

  • It does not have a leading 00.

  • The integer formed is even.

  • Each element in digits can be used at most as many times as it appears in the array.

Constraints:

  • 3≤3 \leq digits.length ≤10\leq 10

  • 0≤0 \leq digits[i] ≤9\leq 9