It took me a while to figure this one out. Your mathmatical intuition and ability of code implementation keep stunning me. The solution really a mind blower. Bravo!
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%% test 1
nterms = 10;
term0 = randi(10);
increment = (-1)^randi(2)*randi(10);
correctsequence = term0:increment:term0+(nterms-1)*increment;
for position = 1:nterms
errorsequence = correctsequence;
errorsequence(position) = errorsequence(position) + (-1)^randi(2)*randi(50);
[errorposition, truesequence] = find_error(errorsequence);
assert(errorposition == position && isequal(truesequence, correctsequence), 'failed test 1 at position %d', position);
end
|
2 | Pass |
%%test 2
nterms = 201;
term0 = randi(10);
increment = (-1)^randi(2)*randi(10);
correctsequence = term0:increment:term0+(nterms-1)*increment;
for position = 1:10:nterms
errorsequence = correctsequence;
errorsequence(position) = errorsequence(position) + (-1)^randi(2)*randi(50);
[errorposition, truesequence] = find_error(errorsequence);
assert(errorposition == position && isequal(truesequence, correctsequence), 'failed test 2 at position %d', position);
end
|
Find the alphabetic word product
2322 Solvers
669 Solvers
2457 Solvers
Return fibonacci sequence do not use loop and condition
218 Solvers
184 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!