Problem Brief

Find Largest Number (Google Early Career)

FULLTIMEOA

See Google online assessment and hiring insights

Here's an array with a minimum length of 3, and you need to find a three-digit number made up of three elements from the array, such that the resulting number is as large as possible.

1Example 1

Input

nums = [7, 4, 3, 8, 2]

Output

782

Explanation

🐹🐹

Constraints

Limits and guarantees your solution can rely on.

🥲🥲

Draft autosaves locally

public int findLargestNumber(int[] nums) {
  // write your code here
}

Input

nums

[7, 4, 3, 8, 2]

Output

782