Find the Largest Prime Number

You are given an array of non-negative integers as an argument. Return the largest prime number that is formed by summing any number of integers in any combination.

Consider the original integer + 0 a valid sum operation.

Requirements

  • Must return a single integer.

Example #1

solve([23, 13, 11])
> 47
  1. Calculated all possible sums of 23, 13, and 11, which are 47, 36, 34, 23, 24, 13, and 11.
  2. 47, 23, 13, and 11 are all prime numbers. Return 47 since it is the largest.