There are several ways to locate and remove nans in a matrix, and return an 1d row vector.
In this problem the challenge is to do it within a set time as measured by tic-toc.
The problem will be run numerous times and an average time tested.
Note: I noticed a rare failure depending on when I ran the testsuite, so you might have to resubmit your code if it runs faster on your machine than the limit set here.
Find the longest sequence of 1's in a binary sequence.
2253 Solvers
Solve the set of simultaneous linear equations
160 Solvers
Convert from Base 10 to base 5
116 Solvers
199 Solvers
44 Solvers
Tags