This solution is outdated. To rescore this solution, sign in.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
assert(isequal(ecount(1:10,2),1))
|
2 | Pass |
assert(isequal(ecount([1 1 1 1 1 1 1 1],1),8))
|
3 | Pass |
assert(isequal(ecount([1 1 1 1 1 1 1 1],2),0))
|
4 | Pass |
assert(isequal(ecount([1 1 1 1 NaN NaN 1 1],NaN),2))
|
5 | Pass |
assert(isequal(ecount([15 13 6 2 71 -5 -7 15],15),2))
|
How to find the position of an element in a vector without using the find function
2322 Solvers
Count from 0 to N^M in base N.
200 Solvers
Project Euler: Problem 10, Sum of Primes
555 Solvers
204 Solvers
07 - Common functions and indexing 2
255 Solvers