A non-empty array A consisting of N integers is given.
A permutation is a sequence containing each element from 1 to N once, and only once.
For example, array A such that:
A[0] = 4 A[1] = 1 A[2] = 3 A[3] = 2is a permutation, but array A such that:
A[0] = 4 A[1] = 1 A[2] = 3is not a permutation, because value 2 is missing.
The goal is to check whether array A is a permutation.
Write a function:
def solution(A)
that, given an array A, returns 1 if array A is a permutation and 0 if it is not.
For example, given array A such that:
A[0] = 4 A[1] = 1 A[2] = 3 A[3] = 2the function should return 1.
Given array A such that:
A[0] = 4 A[1] = 1 A[2] = 3the function should return 0.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [1..1,000,000,000].
The following issues have been detected: wrong answers, runtime errors.
For example, for the input [1, 1] the solution returned a wrong answer (got 1 expected 0).
single element with minimal/maximal value
tested program terminated unexpectedly
Traceback (most recent call last):
File "user.py", line 109, in <module>
main()
File "user.py", line 86, in main
result = sol.solution ( A )
File "/tmp/solution.py", line 13, in solution
T = [0] * max
MemoryError
permutation + one element occurs twice, N = ~100
got 1 expected 0
permutation + few elements occur twice, N = ~10,000
got 1 expected 0
permutation + one element occurs three times, N = ~100,000
got 1 expected 0
sequence 1, 2, ..., N, N = ~100,000
tested program terminated unexpectedly
Traceback (most recent call last):
File "user.py", line 109, in <module>
main()
File "user.py", line 86, in main
result = sol.solution ( A )
File "/tmp/solution.py", line 13, in solution
T = [0] * max
MemoryError