Given an array of size N-1 such that it only contains distinct integers in the range of 1 to N. Find the missing element.
Example 1:
Input:N = 5A[] = {1,2,3,5}Output: 4
Discussion posts and replies are publicly visible
a!localVariables( local!list: {1,2,3,5}, difference(1 + enumerate(max(local!list)), local!list) )
I'd say this is the best approach except that I would go by length of the array +1, rather than by max value. That eliminates the possibility of tripping up on first value or last value. But I was totally about to bust out a!forEach.
Plus I never knew that 1 + enumerate(n) worked; I always did enumerate(n) +1. Still trying to decide which is more readable.