Best score without using Neural Net Toolbox is 38
It took me half an hour to solve test 4.
Huh, using indices within each other actually worked.
Worlds longest solution winner please, cody!
Wow this is long haha. Congrats!
This Solution works perfectly on MATLAB. Why not here? Need help
my solution passes all the tests in matlab R2011a
function [index1, index2] = nearestNumbers(A)
for i = 1:length(A)-1
for j= 1:length(A)-i
This passed all of the test cases when using MATLAB on my computer, yet it fails here. Anyone know what's wrong with it? I'd appreciate it!
Hard, but doable!
I really liked this problem and although I provided a lot of code to solve it I am pleased with the thought process that took me to it.
This solution is working on my computer.
I don't understand why it is not working
why is this not working? gives correct solution to all test cases on my computer
Another unreadable statement. Does anyone else have trouble using backspace in the "comment on solution box"?
This only works if you have the Neural Network Toolbox
Until they are banned like other functions, many people are using these. It is interesting that only a subset of functions work.
I am partial to dist, it's such a useful function...
Read a Soroban Abacus
Project Euler: Problem 9, Pythagorean numbers
First non-zero element in each column
Back to basics 4 - Search Path
Connect blocks in a model
Find all elements less than 0 or greater than 10 and replace them with NaN
Find the sum of all the numbers of the input vector
Which doors are open?
Remove the polynomials that have positive real elements of their roots.
Return a list sorted by number of occurrences
Find the treasures in MATLAB Central and discover how the community can help you!
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office